Siddhartha Kumar

Orcid: 0000-0003-3610-6440

According to our database1, Siddhartha Kumar authored at least 24 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
CodedPaddedFL and CodedSecAgg: Straggler Mitigation and Secure Aggregation in Federated Learning.
IEEE Trans. Commun., April, 2023

2022
Multi-Server Weakly-Private Information Retrieval.
IEEE Trans. Inf. Theory, 2022

Privacy-Preserving Coded Mobile Edge Computing for Low-Latency Distributed Inference.
IEEE J. Sel. Areas Commun., 2022

Coding for Straggler Mitigation in Federated Learning.
Proceedings of the IEEE International Conference on Communications, 2022

Straggler-Resilient Secure Aggregation for Federated Learning.
Proceedings of the 30th European Signal Processing Conference, 2022

2021
The Capacity of Single-Server Weakly-Private Information Retrieval.
IEEE J. Sel. Areas Inf. Theory, 2021

Rateless Codes for Low-Latency Distributed Inference in Mobile Edge Computing.
CoRR, 2021

Low-Latency Distributed Inference at the Network Edge Using Rateless Codes (Invited Paper).
Proceedings of the 17th International Symposium on Wireless Communication Systems, 2021

2020
Private Edge Computing for Linear Inference Based on Secret Sharing.
Proceedings of the IEEE Global Communications Conference, 2020

2019
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes.
IEEE Trans. Inf. Theory, 2019

Private Information Retrieval From a Cellular Network With Caching at the Edge.
IEEE Trans. Commun., 2019

Private Information Retrieval in Wireless Coded Caching.
Proceedings of the 20th IEEE International Workshop on Signal Processing Advances in Wireless Communications, 2019

Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper).
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Weakly-Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Code Constructions for Distributed Storage With Low Repair Bandwidth and Low Repair Complexity.
IEEE Trans. Commun., 2018

On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage.
CoRR, 2018

A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code.
CoRR, 2018

Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage.
Proceedings of the IEEE Information Theory Workshop, 2018

Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes.
Proceedings of the IEEE Information Theory Workshop, 2018

An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code.
CoRR, 2017

Private information retrieval in distributed storage systems using an arbitrary linear code.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Secure Repairable Fountain Codes.
IEEE Commun. Lett., 2016

2015
A Family of Erasure Correcting Codes with Low Repair Bandwidth and Low Repair Complexity.
Proceedings of the 2015 IEEE Global Communications Conference, 2015


  Loading...