Sciweavers

SIAMCOMP
2008

On Monotone Formula Composition of Perfect Zero-Knowledge Languages

13 years 9 months ago
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean formula composition. This gives rise to new protocol techniques. We show that interactive PZK for random self-reducible languages (RSR) (and for co-RSR) is closed under monotone boolean formula composition. Namely, we present PZK proofs for monotone boolean formulae whose atoms are statements about membership in a PZK language which is RSR (or whose complement is RSR). We also discuss extensions, recent applications and generalizations of the techniques.
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2008
Where SIAMCOMP
Authors Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung
Comments (0)