| A. De Santis, G. Persiano, M. Yung: Formulae over Random Self-Reducible Languages: The Extended Power of Perfect Zero-Knowledge, manuscript. |
....however: 11] considers non interactive proofs of membership, while we consider interactive proofs of knowledge. Also, 11] considers variants of the quadratic residuosity problem, while we consider any problem that affords a protocol of the right form. In some independent work, De Santis et al. [12] apply techniques similar to ours to proofs of membership in random self reducible languages. This leads to perfect ZK proofs for monotone Boolean operations over such languages. In [4] Feige and Shamir introduce the concepts of witness indistinguishable (WI) and witness hiding (WH) protocols and ....
A. De Santis, G. Persiano, M. Yung: Formulae over Random Self-Reducible Languages: The Extended Power of Perfect Zero-Knowledge, manuscript.
....non interactive zero knowledge proofs of membership, while we consider interactive proofs of knowledge. Also, 10] considers variants of the quadratic residuosity problem, while we consider any problem that affords a protocol of the right form. In some recent independent work, De Santis et al. [11] apply techniques similar to ours to proofs of membership in random self reducible languages. This leads to perfect zero knowledge proofs for monotone Boolean operations over such languages. In [4] Feige and Shamir introduce the concepts of witness indistinguishable and witness hiding protocols ....
A. De Santis, G. Persiano, M. Yung: Formulae over Random Self-Reducible Languages: The Extended Power of Perfect Zero-Knowledge, manuscript.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC