Author of the publication

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs.

, , , , and . SCN, volume 9841 of Lecture Notes in Computer Science, page 237-253. Springer, (2016)

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

Optimal Probabilistic Synchronous Byzantine Agreement.. Encyclopedia of Algorithms, (2016)Efficient Agreement on Bounded-Degree Networks., and . ICPP (1), page 188-191. Pennsylvania State University Press, (1989)Efficient and Secure Multi-Party Computation with Faulty Majority and Complete Fairness., , and . IACR Cryptol. ePrint Arch., (2004)Resource Fairness and Composability of Cryptographic Protocols., , , and . IACR Cryptol. ePrint Arch., (2005)Secret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation., , , and . ICS, page 32-44. Tsinghua University Press, (2011)SoK: A Consensus Taxonomy in the Blockchain Era., and . IACR Cryptology ePrint Archive, (2018)MAC Precomputation with Applications to Secure Memory., , and . ACM Trans. Priv. Secur., 19 (2): 6:1-6:21 (2016)Proofs of Work for Blockchain Protocols., , and . IACR Cryptology ePrint Archive, (2017)Application-Independent End-to-End Security in Shared-Link Access Networks., and . NETWORKING, volume 1815 of Lecture Notes in Computer Science, page 608-619. Springer, (2000)Fast, Long-Lived Renaming Improved and Simplified., and . WDAG, volume 1151 of Lecture Notes in Computer Science, page 287-303. Springer, (1996)