On Monotone Formula Composition of Perfect Zero-Knowledge Languages

DOI10.1137/S0097539798346123zbMath1178.68272MaRDI QIDQ3395032

Giovanni Di Crescenzo, Giuseppe Persiano, Alfredo De Santis, Mordechai M. Yung

Publication date: 20 August 2009

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

zbMATH Keywords

interactive proofszero knowledgerandom self-reducible languages

Mathematics Subject Classification ID

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

Related Items (2)

Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ On server trust in private proxy auctions

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