We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe...
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...