Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
DEFINITIONS AND PROPERTIES OF ZERO-KNOWLEDGE PROOF SYSTEMS
Autore:
GOLDREICH O; OREN Y;
Indirizzi:
TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI IL-32000 HAIFA ISRAEL
Titolo Testata:
Journal of cryptology
fascicolo: 1, volume: 7, anno: 1994,
pagine: 1 - 32
SICI:
0933-2790(1994)7:1<1:DAPOZP>2.0.ZU;2-8
Fonte:
ISI
Lingua:
ENG
Keywords:
ZERO-KNOWLEDGE; 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 ZERO-KNOWLEDGE PROOF SYSTEMS", Journal of cryptology, 7(1), 1994, pp. 1-32

Abstract

In this paper we investigate some properties of zero-knowledge proofs, a notion introduced by Goldwasser, Micali, and Rackoff. We introduceand classify two definitions of zero-knowledge: auxiliary-input zero-knowledge and blackbox-simulation zero-knowledge. We explain why auxiliary-input zero-knowledge 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 auxiliary-input zero-knowledge is itself auxiliary-input zero-knowledge. We show that blackbox-simulation zero-knowledge implies auxiliary-input zero-knowledge (which in tum implies the [GMR1] definition). We argue that all known zero-knowledge proofs are in fact blackbox-simulationzero-knowledge (i.e., we proved zero-knowledge using blackbox-simulation of the verifier). As a result, all known zero-knowledge proof systems are shown to be auxiliary-input zero-knowledge and can be used forcryptographic applications such as those in [GMW2]. We demonstrate the triviality of certain classes of zero-knowledge proof systems, in the sense that only languages in BPP have zero-knowledge proofs of theseclasses. In particular, we show that any language having a Las Vegas zero-knowledge 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) auxiliary-input zero-knowledge 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