DocumentCode
2779695
Title
Multiple non-interactive zero knowledge proofs based on a single random string
Author
Feige, Uriel ; Lapidot, Dror ; Shamir, Adi
Author_Institution
Dept. of Appl. Math., Weizmann Inst., Rehovot, Israel
fYear
1990
fDate
22-24 Oct 1990
Firstpage
308
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
cryptography; theorem proving; cryptographic applications; multiple noninteractive zero knowledge proofs; open problems; polynomially many provers; polynomially many theorems; single random string; Cryptographic protocols; Cryptography; Polynomials; Proposals; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-2082-X
Type
conf
DOI
10.1109/FSCS.1990.89549
Filename
89549
Link To Document