 Similar reports available for purchase |  | |  |
|
 |
 |
 Math and Statistics Theoretical Mathematics |
 |
|
Non-Interactive Zero Knowledge
Authors: Manuel Blum; Alfredo De Santis; Silvio Micali; Giuseppe Persiano; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE |
| |
Abstract: We investigate the possibility of disposing of interaction between Prover and Verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, we prove that non-interactive zero- knowledge proofs exist for some number theoretic languages for which no efficient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorization is not known) is computationally hard, we show that the NP-complete language of satisfiability also possesses noninteractive zero-knowledge proofs. (kr)
| Description: |
Technical rept. |
| Pages: |
38 |
| Report Date: |
MAY 90 |
| Contract Number: |
N00039-88-C-0163, $NSF-DCR85-1 |
| Report Number: |
A896222 |
Report Unavailable |
| This title is unavailable from Storming Media. We do not know when it might be available, if at all. We list the report on our site for bibliographic completeness, to help our users know what other work has been performed in this field. Please note that as with all titles on this site, we do not have contact information for any of the authors. Nor can we give any suggestions on how one might obtain this report. |
|
|
|
|
|
|
| |
|
|
 |
|
 |
|
|
Keywords relating to this report:
Email This Abstract