Swanand Kadhe

Orcid: 0000-0003-2006-1030

According to our database1, Swanand Kadhe authored at least 58 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Turning Generative Models Degenerate: The Power of Data Poisoning Attacks.
CoRR, 2024

Split, Unlearn, Merge: Leveraging Data Attributes for More Effective Unlearning in LLMs.
CoRR, 2024

2023
Optimal Information Security Against Limited-View Adversaries: Beyond MDS Codes.
IEEE Trans. Commun., December, 2023

Minimum-Rate Spectrum-Blind Sampling Based on Sparse-Graph Codes.
IEEE Trans. Signal Process., 2023

FairSISA: Ensemble Post-Processing to Improve Fairness of Unlearning in LLMs.
CoRR, 2023

Forcing Generative Models to Degenerate Ones: The Power of Data Poisoning Attacks.
CoRR, 2023

Privacy-Preserving Federated Learning over Vertically and Horizontally Partitioned Data for Financial Anomaly Detection.
CoRR, 2023

Benchmarking the Effect of Poisoning Defenses on the Security and Bias of Deep Learning Models.
Proceedings of the 2023 IEEE Security and Privacy Workshops (SPW), 2023

LESS-VFL: Communication-Efficient Feature Selection for Vertical Federated Learning.
Proceedings of the International Conference on Machine Learning, 2023

2022
Federated Unlearning: How to Efficiently Erase a Client in FL?
CoRR, 2022

Robust Learning Protocol for Federated Tumor Segmentation Challenge.
Proceedings of the Brainlesion: Glioma, Multiple Sclerosis, Stroke and Traumatic Brain Injuries, 2022

DeTrust-FL: Privacy-Preserving Federated Learning in Decentralized Trust Setting.
Proceedings of the IEEE 15th International Conference on Cloud Computing, 2022

2021
Service Rate Region: A New Aspect of Coded Distributed System Design.
IEEE Trans. Inf. Theory, 2021

Download Time Analysis for Distributed Storage Codes With Locality and Availability.
IEEE Trans. Commun., 2021

Single-Server Private Information Retrieval Schemes are Equivalent to Locally Recoverable Coding Schemes.
IEEE J. Sel. Areas Inf. Theory, 2021

Communication-Efficient and Byzantine-Robust Distributed Learning With Error Feedback.
IEEE J. Sel. Areas Inf. Theory, 2021

Leveraging Spatial and Temporal Correlations in Sparsified Mean Estimation.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

FastShare: Scalable Secret Sharing by Leveraging Locality.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Private Information Retrieval With Side Information.
IEEE Trans. Inf. Theory, 2020

Stealthy Communication Over Adversarially Jammed Multipath Networks.
IEEE Trans. Commun., 2020

FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning.
CoRR, 2020

Communication-Efficient and Byzantine-Robust Distributed Learning.
Proceedings of the Information Theory and Applications Workshop, 2020

Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Communication Efficient and Byzantine Tolerant Distributed Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2020

CoVer: Collaborative Light-Node-Only Verification and Data Availability for Blockchains.
Proceedings of the IEEE International Conference on Blockchain, 2020

OverSketched Newton: Fast Convex Optimization for Serverless Systems.
Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019
Codes With Locality in the Rank and Subspace Metrics.
IEEE Trans. Inf. Theory, 2019

Analyzing the Download Time of Availability Codes.
CoRR, 2019

Logical Clifford Synthesis for Stabilizer Codes.
CoRR, 2019

SeF: A Secure Fountain Architecture for Slashing Storage Costs in Blockchains.
CoRR, 2019

On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Low-degree Pseudo-Boolean Function Recovery Using Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Single-Server Multi-Message Individually-Private Information Retrieval with Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Multipath Stealth Communication with Jammers.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Synthesis of Logical Clifford Operators via Symplectic Geometry.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

On the Capacity of Single-Server Multi-Message Private Information Retrieval with Side Information.
Proceedings of the 56th Annual Allerton Conference on Communication, 2018

2017
Security for minimum storage regenerating codes and locally repairable codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Rate optimal binary linear locally repairable codes with small availability.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Universally weakly secure coset coding schemes for minimum storage regenerating (MSR) codes.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

Private information retrieval with side information: The single server case.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

On the service capacity region of accessing erasure coded content.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Codes with unequal locality.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rank-metric codes with local recoverability.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Successive omniscience.
Proceedings of the 2015 International Symposium on Network Coding, 2015

Talking reliably, secretly, and efficiently: A "complete" characterization.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Coding against a limited-view adversary: The effect of causality and feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Analyzing the download time of availability codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

When do the availability codes make the stored data more available?
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Reliable and secure communication over adversarial multipath networks: A survey.
Proceedings of the 10th International Conference on Information, 2015

2014
Weakly secure regenerating codes for distributed storage.
Proceedings of the International Symposium on Network Coding, 2014

Reliable, deniable and hidable communication: A quick survey.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Reliable, deniable, and hidable communication over multipath networks.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On a weakly secure regenerating code construction for minimum storage regime.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
A Framework for Non Intrusive Load Monitoring Using Bayesian Inference.
Proceedings of the Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing, 2013

On electrical load disaggregation using factor graphs.
Proceedings of the International Conference on Advances in Computing, 2013

A Network Coding Based Framework for Construction of Systematic Minimum Bandwidth Regenerating (MBR) Codes for Distributed Storage.
Proceedings of the 19th International Conference on Management of Data, 2013

2010
SpreadStore: A LDPC Erasure Code Scheme for Distributed Storage System.
Proceedings of the International Conference on Data Storage and Data Engineering, 2010


  Loading...