From post

Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries.

. CRYPTO (2), том 8043 из Lecture Notes in Computer Science, стр. 1-17. Springer, (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.

 

Другие публикации лиц с тем же именем

A Practical Application of Differential Privacy to Personalized Online Advertising., и . IACR Cryptology ePrint Archive, (2011)Impossibility Results for Universal Composability in Public-Key Models and with Fixed Inputs., и . IACR Cryptology ePrint Archive, (2007)Information-Theoretically Secure Protocols and Security Under Composition., , и . IACR Cryptology ePrint Archive, (2009)How To Simulate It - A Tutorial on the Simulation Proof Technique.. IACR Cryptology ePrint Archive, (2016)On the Feasibility of Extending Oblivious Transfer., и . J. Cryptol., 31 (3): 737-773 (2018)Secure Multi-Party Computation without Agreement., и . J. Cryptol., 18 (3): 247-287 (2005)On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions., , и . J. Cryptol., 19 (2): 135-167 (2006)Blazing Fast 2PC in the Offline/Online Setting with Security for Malicious Adversaries., и . ACM Conference on Computer and Communications Security, стр. 579-590. ACM, (2015)Fast Garbling of Circuits Under Standard Assumptions., , , и . ACM Conference on Computer and Communications Security, стр. 567-578. ACM, (2015)DEMO: High-Throughput Secure Three-Party Computation of Kerberos Ticket Generation., , , , , и . ACM Conference on Computer and Communications Security, стр. 1841-1843. ACM, (2016)