Accession Number:

ADA222698

Title:

Non-Interactive Zero Knowledge

Descriptive Note:

Technical rept.

Corporate Author:

MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE

Report Date:

1990-05-01

Pagination or Media Count:

38.0

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.

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE