Author of the publication

Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function.

, , and . IACR Cryptology ePrint Archive, (1997)

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

Friendly Observers Ease Off-Line E-Cash., , and . CARDIS, volume 180 of IFIP Conference Proceedings, page 3-18. Kluwer, (2000)The TrustedFlow (TM) Protocol-Idiosyncratic Signatures for Authenticated Execution., , and . IAW, page 288-291. IEEE, (2003)Robust Verifiable non-Interactive Zero-Sharing - A Plug-in Utility for Enhanced Voters' Privacy., and . Secure Electronic Voting, volume 7 of Advances in Information Security, Springer, (2003)Secure Computation Protocol: A Technology for Our Time.. ICETE (1), page 19. ScitePress, (2020)Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract)., , and . EUROCRYPT, volume 434 of Lecture Notes in Computer Science, page 192-195. Springer, (1989)Characterization of Security Notions for Probabilistic Private-Key Encryption., and . J. Cryptol., 19 (1): 67-95 (2006)Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation., and . J. Cryptol., 9 (3): 149-166 (1996)From Mental Poker to Core Business: Why and How to Deploy Secure Computation Protocols?. ACM Conference on Computer and Communications Security, page 1-2. ACM, (2015)Breaking and Repairing Asymmetric Public-Key Traitor Tracing., and . Digital Rights Management Workshop, volume 2696 of Lecture Notes in Computer Science, page 32-50. Springer, (2002)Forward-secure signatures in untrusted update environments: efficient and generic constructions., , and . ACM Conference on Computer and Communications Security, page 266-275. ACM, (2007)