research
∙
08/17/2021
On the Complexity of Two-Party Differential Privacy
In distributed differential privacy, the parties perform analysis over t...
share
research
∙
05/05/2021
On the Communication Complexity of Key-Agreement Protocols
Key-agreement protocols whose security is proven in the random oracle mo...
research
∙
05/04/2021
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing
This paper uses a variant of the notion of inaccessible entropy (Haitner...
research
∙
05/04/2021
Finding Collisions in Interactive Protocols – Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
We study the round and communication complexities of various cryptograph...
research
∙
05/04/2021
Hardness-Preserving Reductions via Cuckoo Hashing
The focus of this work is hardness-preserving transformations of somewha...
research
∙
05/04/2021
Coin Flipping of Any Constant Bias Implies One-Way Functions
We show that the existence of a coin-flipping protocol safe against any ...
research
∙
05/03/2021
From Fairness to Full Security in Multiparty Computation
In the setting of secure multiparty computation (MPC), a set of mutually...
research
∙
05/03/2021
An Almost-Optimally Fair Three-Party Coin-Flipping Protocol
In a multiparty fair coin-flipping protocol, the parties output a common...
research
∙
05/03/2021
A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KL-Divergence
Hardness amplification is a central problem in the study of interactive ...
research
∙
05/03/2021
On the Complexity of Fair Coin Flipping
A two-party coin-flipping protocol is ϵ-fair if no efficient adversary c...
research
∙
05/03/2021
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
Consider a PPT two-party protocol π=(A,B) in which the parties get no pr...
research
∙
05/03/2021
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
Let π be an efficient two-party protocol that given security parameter κ...
research
∙
05/03/2021
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
We study time/memory tradeoffs of function inversion: an algorithm, i.e....
research
∙
05/03/2021
Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
In his seminal work, Cleve [STOC '86] has proved that any r-round coin-f...
research
∙
05/03/2021
Characterization of Secure Multiparty Computation Without Broadcast
A major challenge in the study of cryptography is characterizing the nec...
research
∙
05/03/2021
Distributional Collision Resistance Beyond One-Way Functions
Distributional collision resistance is a relaxation of collision resista...
research
∙
04/18/2021
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
In a multi-party fair coin-flipping protocol, the parties output a commo...
research
∙
10/12/2020
Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from One-Way Functions
We put forth a new computational notion of entropy, measuring the (in)fe...
research
∙
09/28/2020
On the Round Complexity of the Shuffle Model
The shuffle model of differential privacy was proposed as a viable model...
research
∙
05/04/2020
A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip
In a distributed coin-flipping protocol, Blum [ACM Transactions on Compu...
research
∙
07/25/2019
