On Monotone Formula Composition of Perfect Zero-Knowledge Languages

DOI10.1137/S0097539798346123zbMATH Open1178.68272MaRDI QIDQ3395032FDOQ3395032

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)

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

zbMATH Keywords

zero knowledgeinteractive proofsrandom self-reducible languages

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)

Cited In (3)

• On server trust in private proxy auctions
• Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
• Mathematical Foundations of Computer Science 2004

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)