Catalogo Articoli (Spogli Riviste)
OPAC HELP
Titolo: DEFINITIONS AND PROPERTIES OF ZEROKNOWLEDGE PROOF SYSTEMS
Autore: GOLDREICH O; OREN Y;
 Indirizzi:
 TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI IL32000 HAIFA ISRAEL
 Titolo Testata:
 Journal of cryptology
fascicolo: 1,
volume: 7,
anno: 1994,
pagine: 1  32
 SICI:
 09332790(1994)7:1<1:DAPOZP>2.0.ZU;28
 Fonte:
 ISI
 Lingua:
 ENG
 Keywords:
 ZEROKNOWLEDGE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL INDISTINGUISHABILITY; CRYPTOGRAPHIC COMPOSITION OF PROTOCOLS;
 Tipo documento:
 Article
 Natura:
 Periodico
 Settore Disciplinare:
 CompuMath Citation Index
 Science Citation Index Expanded
 Citazioni:
 21
 Recensione:
 Indirizzi per estratti:



 Citazione:
 O. Goldreich e Y. Oren, "DEFINITIONS AND PROPERTIES OF ZEROKNOWLEDGE PROOF SYSTEMS", Journal of cryptology, 7(1), 1994, pp. 132
Abstract
In this paper we investigate some properties of zeroknowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff. We introduceand classify two definitions of zeroknowledge: auxiliaryinput zeroknowledge and blackboxsimulation zeroknowledge. We explain why auxiliaryinput zeroknowledge is a definition more suitable for cryptographic applications than the original [GMR1] definition. In particular, we show that any protocol solely composed of subprotocols which are auxiliaryinput zeroknowledge is itself auxiliaryinput zeroknowledge. We show that blackboxsimulation zeroknowledge implies auxiliaryinput zeroknowledge (which in tum implies the [GMR1] definition). We argue that all known zeroknowledge proofs are in fact blackboxsimulationzeroknowledge (i.e., we proved zeroknowledge using blackboxsimulation of the verifier). As a result, all known zeroknowledge proof systems are shown to be auxiliaryinput zeroknowledge and can be used forcryptographic applications such as those in [GMW2]. We demonstrate the triviality of certain classes of zeroknowledge proof systems, in the sense that only languages in BPP have zeroknowledge proofs of theseclasses. In particular, we show that any language having a Las Vegas zeroknowledge proof system necessarily belongs to RP. We show that randomness of both the verifier and the prover, and nontriviality of theinteraction are essential properties of (nontrivial) auxiliaryinput zeroknowledge proofs.
ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 28/11/20 alle ore 21:35:03