Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols

DOI10.1007/BFB0028586MaRDI QIDQ4381399zbMATH OpenFDO

Authors Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Publication date 10 January 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028586

zbMATH Keywords

constant-round protocolsrandom self-reducible languagesresult-indistinguishable perfect zero-knowledge proof

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Zero-knowledge proofs of decision power: New protocols and optimal round- complexity
• How to construct constant-round zero-knowledge proof systems for NP
• The knowledge complexity of quadratic residuosity languages
• On the Composition of Zero-Knowledge Proof Systems

Cited in

(1)

• Zero-knowledge proofs of decision power: New protocols and optimal round- complexity

This page was built for publication: Result-indistinguishable zero-knowledge proofs: Increased power and constant-round protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381399)