Manoj Prabhakaran
YOU?
Author Swipe
View article: Towards Building Efficient SCALES Protocols
Towards Building Efficient SCALES Protocols Open
View article: Intelligent Motion based Animal Repulsion System for Agriculture
Intelligent Motion based Animal Repulsion System for Agriculture Open
The protection of crops from birds and animals is a significant concern for farmers worldwide. Birds and animals such as crows, sparrows, goats, and cows often cause substantial damage to crops, leading to financial losses and reduced yiel…
View article: R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications
R3PO: Reach-Restricted Reactive Program Obfuscation and Its Applications Open
View article: Randomness Requirements for Three-Secret Sharing
Randomness Requirements for Three-Secret Sharing Open
We study a secret sharing problem with three secrets where the secrets are allowed to be related to each other, i.e., only certain combinations of the three secrets are permitted. The dealer produces three shares such that every pair of sh…
View article: Spectrum of Infections in Renal Transplant Recipients, Factors Affecting Long Term Patient and Graft Outcomes Over 10 Years Including COVID Pandemic Periods
Spectrum of Infections in Renal Transplant Recipients, Factors Affecting Long Term Patient and Graft Outcomes Over 10 Years Including COVID Pandemic Periods Open
Introduction: Multiple factors including infections affect graft and patient outcomes in Renal Allograft Recipients. Survival data from tropical countries is scarce, especially during the COVID 19 pandemic. Subjects and Methods: In this am…
View article: Flexible Accuracy for Differential Privacy
Flexible Accuracy for Differential Privacy Open
Differential Privacy (DP) has become a gold standard in privacy-preserving data analysis. While it provides one of the most rigorous notions of privacy, there are many settings where its applicability is limited. Our main contribution is i…
View article: Group Structure in Correlations and Its Applications in Cryptography
Group Structure in Correlations and Its Applications in Cryptography Open
Correlated random variables are a key tool in cryptographic applications like secure multi-party computation. We investigate the power of a class of correlations that we term group correlations: A group correlation is a uniform distributio…
View article: The Bottleneck Complexity of Secure Multiparty Computation
The Bottleneck Complexity of Secure Multiparty Computation Open
In this work, we initiate the study of bottleneck complexity as a new communication efficiency measure for secure multiparty computation (MPC). Roughly, the bottleneck complexity of an MPC protocol is defined as the maximum communication c…
View article: Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC
Brief Announcement: On Secure m-Party Computation, Commuting Permutation Systems and Unassisted Non-Interactive MPC Open
A fundamental problem in the theory of secure multi-party computation (MPC) is to characterize functions with more than 2 parties which admit MPC protocols with information-theoretic security against passive corruption. This question has s…
View article: Communication and Randomness Lower Bounds for Secure Computation
Communication and Randomness Lower Bounds for Secure Computation Open
In secure multiparty computation (MPC), mutually distrusting users\ncollaborate to compute a function of their private data without revealing any\nadditional information about their data to other users. While it is known that\ninformation …
View article: Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound Open
In this work we introduce a new information-theoretic complexity measure for 2-party functions, called Rényi information complexity. It is a lower-bound on communication complexity, and has the two leading lower-bounds on communication com…
View article: Optimal Computational Split-state Non-malleable Codes
Optimal Computational Split-state Non-malleable Codes Open
View article: Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound
Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound Open
We introduce a new information-theoretic complexity measure $IC_\infty$ for 2-party functions which is a lower-bound on communication complexity, and has the two leading lower-bounds on communication complexity as its natural relaxations: …
View article: A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations
A Rate-Optimizing Compiler for Non-malleable Codes Against Bit-Wise Tampering and Permutations Open