Multiple non-interactive zero knowledge proofs based on a single random string
- 4 December 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 308-317vol.1
- https://doi.org/10.1109/fscs.1990.89549
Abstract
The authors solve the two major open problems associated with noninteractive zero-knowledge proofs: how to enable polynomially many provers to prove in writing polynomially many theorems based on the basis of a single random string, and how to construct such proofs under general (rather than number-theoretic) assumptions. The constructions can be used in cryptographic applications in which the prover is restricted to polynomial time, and they are much simpler than earlier (and less capable) proposals.Keywords
This publication has 15 references indexed in Scilit:
- Publicly Verifiable Non-Interactive Zero-Knowledge ProofsPublished by Springer Science and Business Media LLC ,2001
- Pseudo-random generators under uniform assumptionsPublished by Association for Computing Machinery (ACM) ,1990
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Pseudo-random generation from one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- Minimum resource zero knowledge proofsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- 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