( en | de | ru )

 

Disambiguation of "Haitner, Iftach"

Author of the publication

copydeleteadd this publication to your clipboard
Coin Flipping with Constant Bias Implies One-Way Functions.

, and . SIAM J. Comput., 43 (2): 389-409 (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Haitner, Iftach
add a person with the name Haitner, Iftach
 

Other publications of authors with the same name

Incompressiblity and Next-Block Pseudoentropy., , and . Electron. Colloquium Comput. Complex., (2022)Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales and Differentially Private Sampling., , , and . CoRR, (2021)Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation., , , and . CoRR, (2021)Inaccessible Entropy II: IE Functions and Universal One-Way Hashing., , , , and . CoRR, (2021)A Parallel Repetition Theorem for Any Interactive Argument.. SIAM J. Comput., 42 (6): 2487-2501 (2013)Characterization of Secure Multiparty Computation Without Broadcast., , , and . IACR Cryptology ePrint Archive, (2015)On the Power of the Randomized Iterate., , and . CRYPTO, volume 4117 of Lecture Notes in Computer Science, page 22-40. Springer, (2006)On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols., , and . TCC, volume 5444 of Lecture Notes in Computer Science, page 220-237. Springer, (2009)From Fairness to Full Security in Multiparty Computation., , , and . SCN, volume 11035 of Lecture Notes in Computer Science, page 216-234. Springer, (2018)A New Interactive Hashing Theorem., and . CCC, page 319-332. IEEE Computer Society, (2007)