On the complexity of bounded-interaction and noninteractive zero-knowledge proofs
- 17 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Multiple non-interactive zero knowledge proofs based on a single random stringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with PreprocessingPublished by Springer Nature ,2001
- Certifying Cryptographic Tools: The Case of Trapdoor PermutationsPublished by Springer Nature ,2001
- On-line algorithms for path selection in a nonblocking networkPublished by Association for Computing Machinery (ACM) ,1990
- Minimum resource zero knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987