The paper proposes a new DDH-based technique that significantly reduces the key size of multi-party Distributed Point Function (DPF) secret sharing schemes, achieving an $O( oot{3}{N})$ key size for h…

The paper proposes a novel ring-based information-theoretic Private Information Retrieval (itED-PIR) scheme that overcomes the key size and communication overhead limitations of existing field-based A…

This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.

The paper addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

The paper proposes a novel, unconditionally secure information-theoretic Authenticated Private Information Retrieval (itAPIR) scheme that upgrades existing, less secure itPIR-RV schemes without overhe…

The paper introduces local private information retrieval (local PIR), redefining user privacy in graph-replicated systems to focus on hiding the message index from servers, and demonstrates that local…

TAPAS introduces an efficient, asymmetric two-server private aggregation scheme that significantly reduces computational and communication costs for large-scale federated learning compared to existing…

The paper develops a unified theoretical framework to systematically characterize the optimal privacy-utility trade-off (PUT) and optimal Local Differential Privacy (LDP) channels for general statisti…

The paper introduces the PML envelope, a novel definition that provides a robust and operationally meaningful measure of information leakage about a secret, satisfying both post-processing robustness…

The paper introduces PolyVeil, a protocol for private Boolean summation that uses permutation matrices in the Birkhoff polytope, achieving strong security guarantees while highlighting a fundamental t…

The paper demonstrates that by introducing carefully designed correlations among locally added noise variables, local differential privacy mechanisms can achieve an estimation cost matching the optima…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

Pepper is a novel, high-bandwidth anonymous broadcast protocol that achieves cryptographic sender anonymity and significantly improves messaging throughput compared to existing state-of-the-art system…

The paper introduces a novel, asymptotically ideal Conjunctive Hierarchical Secret Sharing (CHSS) scheme using the Chinese Remainder Theorem (CRT) for polynomial rings, achieving high security and an…

The paper proposes two new asymptotically ideal and secure Hierarchical Secret Sharing (HSS) schemes, disjunctive and conjunctive, utilizing the Chinese Remainder Theorem (CRT) over an integer ring an…

The paper introduces novel, efficient differentially private algorithms for estimating monotone statistics, significantly improving sample complexity compared to existing methods.

The paper proposes efficient Fuzzy Private Set Intersection (FPSI) protocols for various $L_p$ distance metrics by leveraging symmetric-key operations, achieving linear complexity and significantly ou…

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper develops a general framework to exactly characterize the composition of mechanisms satisfying multiple differential privacy constraints, extending known results to arbitrary numbers of const…

This paper demonstrates that the classical discrete Laplace mechanism can be post-processed to create versatile, unbiased estimators for various subexponential functions, making it a preferred choice…