Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (1) , 1-28
- https://doi.org/10.1137/s0097539792230010
Abstract
In this paper we show how to construct noninteractive zero knowledge proofs for any NP statement under general (rather than number theoretic) assumptions, and how to enable polynomially many provers to give polynomially many such proofs based on a single random string. Our constructions can be used in cryptographic applications in which the prover is restricted to polynomial time.Keywords
This publication has 10 references indexed in Scilit:
- An Efficient Noninteractive Zero-Knowledge Proof System for NP with General AssumptionsJournal of Cryptology, 1998
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor PermutationJournal of Cryptology, 1996
- A uniform-complexity treatment of encryption and zero-knowledgeJournal of Cryptology, 1993
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Bit commitment using pseudorandomnessJournal of Cryptology, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984