Noninteractive Zero-Knowledge
- 1 December 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (6) , 1084-1118
- https://doi.org/10.1137/0220068
Abstract
We investigate the possibility of disposing of interaction between Prover and Verifier in a zeroknowledgeproof if they share beforehand a short random string.Without any assumption, we prove that non-interactive zero-knowledge proofs exist for some numbertheoretic languages for which no efficient algorithm is known.If deciding quadratic residuosity (modulo composite integers whose factorization is not known) iscomputationally hard, we show that the NP-complete language of satisfiability...Keywords
This publication has 16 references indexed in Scilit:
- Non-Interactive Oblivious Transfer and ApplicationsPublished by Springer Nature ,2001
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge ProofsPublished by Springer Nature ,2001
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Non-Interactive Zero-Knowledge Proof SystemsPublished by Springer Nature ,1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- How to construct random functionsJournal of the ACM, 1986
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979