16 papers · 1 filter
Computationally Differentially Private Inner Product Protocols Imply Oblivious Transfer
Iftach Haitner, Noam Mazor, Jad Silbak +2
In distributed differential privacy, multiple parties collaborate to analyze their combined data while each party protects the confidentiality of its data from the others. Interest…
On the Communication Complexity of Key-Agreement Protocols
Iftach Haitner, Noam Mazor, Rotem Oshman +2
Key-agreement protocols whose security is proven in the random oracle model are an important alternative to protocols based on public-key cryptography. In the random oracle model,…
From Fairness to Full Security in Multiparty Computation
Ran Cohen, Iftach Haitner, Eran Omri +1
In the setting of secure multiparty computation (MPC), a set of mutually distrusting parties wish to jointly compute a function, while guaranteeing the privacy of their inputs and…
Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols
Iftach Haitner, Kobbi Nissim, Eran Omri +2
Let be an efficient two-party protocol that given security parameter , both parties output single bits and , respectively. We are interested in how "a…
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing
Iftach Haitner, Thomas Holenstein, Omer Reingold +2
This paper uses a variant of the notion of \emph{inaccessible entropy} (Haitner, Reingold, Vadhan and Wee, STOC 2009), to give an alternative construction and proof for the fundame…
Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Iftach Haitner, Jonathan J. Hoch, Omer Reingold +1
We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box…