PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Lindell, Yehuda"

Author of the publication

copydeleteadd this publication to your clipboard
Generalizing the SPDZ Compiler For Other Protocols.

, , , , , , and . ACM Conference on Computer and Communications Security, page 880-895. ACM, (2018)

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 Lindell, Yehuda
add a person with the name Lindell, Yehuda
 

Other publications of authors with the same name

Hiding the Input-Size in Secure Two-Party Computation., , and . ASIACRYPT (2), volume 8270 of Lecture Notes in Computer Science, page 421-440. Springer, (2013)Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption.. EUROCRYPT, volume 6632 of Lecture Notes in Computer Science, page 446-466. Springer, (2011)On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions., , and . EUROCRYPT, volume 2656 of Lecture Notes in Computer Science, page 68-86. Springer, (2003)Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries., , , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 331-361. Springer, (2018)Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries., , and . SCN, volume 5229 of Lecture Notes in Computer Science, page 2-20. Springer, (2008)Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings., and . CRYPTO (2), volume 8617 of Lecture Notes in Computer Science, page 476-494. Springer, (2014)Session-Key Generation Using Human Passwords Only., and . CRYPTO, volume 2139 of Lecture Notes in Computer Science, page 408-432. Springer, (2001)Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.. CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 1-17. Springer, (2013)Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs., and . IACR Cryptology ePrint Archive, (2007)Privacy-Preserving Search of Similar Patients in Genomic Data., , , and . IACR Cryptology ePrint Archive, (2017)