( en | de | ru )

 

Disambiguation of "Lindell, Yehuda"

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for Concurrent Self Composition.

. TCC, volume 2951 of Lecture Notes in Computer Science, page 203-222. Springer, (2004)

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

DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation., , , , , and . 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., and . ACM Conference on Computer and Communications Security, page 579-590. ACM, (2015)Fast Garbling of Circuits Under Standard Assumptions., , , and . ACM Conference on Computer and Communications Security, page 567-578. ACM, (2015)On the Feasibility of Extending Oblivious Transfer., and . J. Cryptol., 31 (3): 737-773 (2018)Secure Multi-Party Computation without Agreement., and . J. Cryptol., 18 (3): 247-287 (2005)On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions., , and . J. Cryptol., 19 (2): 135-167 (2006)Feldman's Verifiable Secret Sharing for a Dishonest Majority., and . IACR Cryptol. ePrint Arch., (2024)A Practical Application of Differential Privacy to Personalized Online Advertising., and . IACR Cryptology ePrint Archive, (2011)Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs., and . IACR Cryptology ePrint Archive, (2007)How To Simulate It - A Tutorial on the Simulation Proof Technique.. IACR Cryptology ePrint Archive, (2016)