
On the Complexity of TwoParty Differential Privacy
In distributed differential privacy, the parties perform analysis over t...
read it

On the Communication Complexity of KeyAgreement Protocols
Keyagreement protocols whose security is proven in the random oracle mo...
read it

Inaccessible Entropy II: IE Functions and Universal OneWay Hashing
This paper uses a variant of the notion of inaccessible entropy (Haitner...
read it

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...
read it

HardnessPreserving Reductions via Cuckoo Hashing
The focus of this work is hardnesspreserving transformations of somewha...
read it

Coin Flipping of Any Constant Bias Implies OneWay Functions
We show that the existence of a coinflipping protocol safe against any ...
read it

From Fairness to Full Security in Multiparty Computation
In the setting of secure multiparty computation (MPC), a set of mutually...
read it

An AlmostOptimally Fair ThreeParty CoinFlipping Protocol
In a multiparty fair coinflipping protocol, the parties output a common...
read it

A Tight Parallel Repetition Theorem for Partially Simulatable Interactive Arguments via Smooth KLDivergence
Hardness amplification is a central problem in the study of interactive ...
read it

On the Complexity of Fair Coin Flipping
A twoparty coinflipping protocol is ϵfair if no efficient adversary c...
read it

Channels of Small LogRatio Leakage and Characterization of TwoParty Differentially Private Computation
Consider a PPT twoparty protocol π=(A,B) in which the parties get no pr...
read it

Computational TwoParty Correlation: A Dichotomy for KeyAgreement Protocols
Let π be an efficient twoparty protocol that given security parameter κ...
read it

Lower Bounds on the Time/Memory Tradeoff of Function Inversion
We study time/memory tradeoffs of function inversion: an algorithm, i.e....
read it

Tighter Bounds on MultiParty Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling
In his seminal work, Cleve [STOC '86] has proved that any rround coinf...
read it

Characterization of Secure Multiparty Computation Without Broadcast
A major challenge in the study of cryptography is characterizing the nec...
read it

Distributional Collision Resistance Beyond OneWay Functions
Distributional collision resistance is a relaxation of collision resista...
read it

Fair Coin Flipping: Tighter Analysis and the ManyParty Case
In a multiparty fair coinflipping protocol, the parties output a commo...
read it

Inaccessible Entropy I: Inaccessible Entropy Generators and Statistically Hiding Commitments from OneWay Functions
We put forth a new computational notion of entropy, measuring the (in)fe...
read it

On the Round Complexity of the Shuffle Model
The shuffle model of differential privacy was proposed as a viable model...
read it

A Tight Lower Bound on Adaptively Secure FullInformation Coin Flip
In a distributed coinflipping protocol, Blum [ACM Transactions on Compu...
read it

On the Round Complexity of Randomized Byzantine Agreement
We prove lower bounds on the round complexity of randomized Byzantine ag...
read it
Iftach Haitner
is this you? claim profile