Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

G. Asharov, Y. Lindell, and T. Rabin. IACR Cryptology ePrint Archive, (2013)

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.

Yehuda Avniel

Other publications of authors with the same name

Complete fairness in secure two-party computation.S. Gordon, C. Hazay, J. Katz, and Y. Lindell. STOC, page 413-422. ACM, (2008)An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries.Y. Lindell, and B. Pinkas. IACR Cryptology ePrint Archive, (2008)On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation.Y. Ishai, E. Kushilevitz, Y. Lindell, and E. Petrank. CRYPTO, volume 4117 of Lecture Notes in Computer Science, page 483-500. Springer, (2006)Text Mining at the Term Level.R. Feldman, M. Fresko, Y. Kinar, Y. Lindell, O. Liphstat, M. Rajman, Y. Schler, and O. Zamir. PKDD, volume 1510 of Lecture Notes in Computer Science, page 65-73. Springer, (1998)Secure Computation without Agreement.S. Goldwasser, and Y. Lindell. DISC, volume 2508 of Lecture Notes in Computer Science, page 17-32. Springer, (2002)Adaptive Zero-Knowledge Proofs and Adaptively Secure Oblivious Transfer.Y. Lindell, and H. Zarosim. TCC, volume 5444 of Lecture Notes in Computer Science, page 183-201. Springer, (2009)Efficient Constant Round Multi-party Computation Combining BMR and SPDZ.Y. Lindell, B. Pinkas, N. Smart, and A. Yanai. CRYPTO (2), volume 9216 of Lecture Notes in Computer Science, page 319-338. Springer, (2015)Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries.C. Hazay, and Y. Lindell. J. Cryptol., 23 (3): 422-456 (2010)A Proof of Security of Yao's Protocol for Two-Party Computation.Y. Lindell, and B. Pinkas. J. Cryptol., 22 (2): 161-188 (2009)Attribute-based Key Exchange with General Policies.V. Kolesnikov, H. Krawczyk, Y. Lindell, A. Malozemoff, and T. Rabin. ACM Conference on Computer and Communications Security, page 1451-1463. ACM, (2016)

BibSonomy

Disambiguation of "Lindell, Yehuda"

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

Please choose a person to relate this publication to

Yehuda Avniel

Other publications of authors with the same name

Disambiguation

BibSonomy

Disambiguation of "Lindell, Yehuda"

copydeleteadd this publication to your clipboardcommunity posthistory of this postURLDOIBibTeXEndNoteAPAChicagoDIN 1505HarvardMSOffice XML Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.

Please choose a person to relate this publication to

Yehuda Avniel

Other publications of authors with the same name

Disambiguation

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness.