| Autor: |
Halevi, Shai, Rabin, Tal, Damgård, Ivan, Fazio, Nelly, Nicolosi, Antonio |
| Zdroj: |
Theory of Cryptography (9783540327318); 2006, p41-59, 19p |
| Abstrakt: |
We propose a method for compiling a class of Σ-protocols (3-move public-coin protocols) into non-interactive zero-knowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. The method applies to all known discrete-log based Σ-protocols. As applications, we obtain non-interactive threshold RSA without random oracles, and non-interactive zero-knowledge for NP more efficiently than by previous methods. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
