On Monotone Formula Composition of Perfect Zero-Knowledge Languages

DOI10.1137/S0097539798346123MaRDI QIDQ3395032zbMATH OpenFDO

Authors Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung

Publication date 20 August 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539798346123

zbMATH Keywords

interactive proofsrandom self-reducible languageszero knowledge

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Mathematical Foundations of Computer Science 2004
• On the Composition of Zero-Knowledge Proof Systems
• On the Composition of Public-Coin Zero-Knowledge Protocols
• scientific article; zbMATH DE number 177820
• An Unconditional Study of Computational Zero Knowledge

Cited in

(5)

• Mathematical Foundations of Computer Science 2004
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• On server trust in private proxy auctions
• Instance-hiding interactive proofs (extended abstract)
• Instance-hiding interactive proofs

This page was built for publication: On Monotone Formula Composition of Perfect Zero-Knowledge Languages

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