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

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.

A. Beimel, Y. Lindell, E. Omri, and I. Orlov. CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 277-296. Springer, (2011)

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

Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries.T. Frederiksen, Y. Lindell, V. Osheter, and B. Pinkas. CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 331-361. Springer, (2018)Completeness for Symmetric Two-Party Functionalities - Revisited.Y. Lindell, E. Omri, and H. Zarosim. ASIACRYPT, volume 7658 of Lecture Notes in Computer Science, page 116-133. Springer, (2012)Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries.Y. Lindell, B. Pinkas, and N. Smart. SCN, volume 5229 of Lecture Notes in Computer Science, page 2-20. Springer, (2008)DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation.T. Araki, A. Barak, J. Furukawa, Y. Lindell, A. Nof, and K. Ohara. ACM Conference on Computer and Communications Security, page 1841-1843. ACM, (2016)Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries.Y. Lindell, and B. Riva. ACM Conference on Computer and Communications Security, page 579-590. ACM, (2015)Fast Garbling of Circuits Under Standard Assumptions.S. Gueron, Y. Lindell, A. Nof, and B. Pinkas. ACM Conference on Computer and Communications Security, page 567-578. ACM, (2015)On the Feasibility of Extending Oblivious Transfer.Y. Lindell, and H. Zarosim. J. Cryptol., 31 (3): 737-773 (2018)Secure Multi-Party Computation without Agreement.S. Goldwasser, and Y. Lindell. J. Cryptol., 18 (3): 247-287 (2005)On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions.R. Canetti, E. Kushilevitz, and Y. Lindell. J. Cryptol., 19 (2): 135-167 (2006)Feldman's Verifiable Secret Sharing for a Dishonest Majority.Y. Chen, and Y. Lindell. IACR Cryptol. ePrint Arch., (2024)

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

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.

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 1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.

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

1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds.