Author of the publication

Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor.

, and . IACR Cryptology ePrint Archive, (2001)

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.

 

Other publications of authors with the same name

Superposition Attacks on Cryptographic Protocols, , , and . CoRR, (2011)OT-Combiners via Secure Computation., , , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 393-411. Springer, (2008)Afgjort - A Semi-Synchronous Finality Layer for Blockchains., , , and . IACR Cryptology ePrint Archive, (2019)Universally Composable Zero-Knowledge Proof of Membership.. IACR Cryptology ePrint Archive, (2017)On the Communication required for Unconditionally Secure Multiplication., , and . IACR Cryptology ePrint Archive, (2015)Cross&Clean: Amortized Garbled Circuits with Constant Overhead., and . IACR Cryptology ePrint Archive, (2016)Non-Malleable Codes with Split-State Refresh., and . IACR Cryptology ePrint Archive, (2016)Cryptographic Asynchronous Multi-Party Computation with Optimal Resilience., , and . IACR Cryptology ePrint Archive, (2004)TinyLEGO: An Interactive Garbling Scheme for Maliciously Secure Two-party Computation., , , and . IACR Cryptology ePrint Archive, (2015)TinyOLE: Efficient Actively Secure Two-Party Computation from Oblivious Linear Function Evaluation., , , , and . ACM Conference on Computer and Communications Security, page 2263-2276. ACM, (2017)