17 papers
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation
Iftach Haitner, Noam Mazor, Ronen Shaltiel +1
Consider a PPT two-party protocol in which the parties get no private inputs and obtain outputs , and let and denote the parties' individu…
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Dror Chawin, Iftach Haitner, Noam Mazor
We study time/memory tradeoffs of function inversion: an algorithm, i.e., an inverter, equipped with an s-bit advice on a randomly chosen function and using or…
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…