How convincing is your protocol?
- 1 March 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 22 (1) , 5-12
- https://doi.org/10.1145/122413.122414
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- All-or-Nothing Disclosure of SecretsPublished by Springer Nature ,2000
- Zero-Knowledge Simulation of Boolean CircuitsPublished by Springer Nature ,2000
- Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About HowPublished by Springer Nature ,2000
- How convincing is your protocol?ACM SIGACT News, 1991
- Cryptology — column 3 hot news on interactive protocolsACM SIGACT News, 1990
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Multiparty Computations Ensuring Privacy of Each Party’s Input and Correctness of the ResultPublished by Springer Nature ,1988
- Direct Minimum-Knowledge Computations (Extended Abstract)Published by Springer Nature ,1988