A characterization of non-interactive instance-dependent commitment-schemes (NIC)
B Kapron, L Malka, V Srinivasan - … , ICALP 2007, Wrocław, Poland, July 9 …, 2007 - Springer
B Kapron, L Malka, V Srinivasan
Automata, Languages and Programming: 34th International Colloquium, ICALP 2007 …, 2007•SpringerWe provide a new characterization of certain zero-knowledge protocols as non-interactive
instance-dependent commitment-schemes (NIC). To obtain this result we consider the
notion of V-bit protocols, which are very common, and found many applications in zero-
knowledge. Our characterization result states that a protocol has a V-bit zero-knowledge
protocol if and only if it has a NIC. The NIC inherits its hiding property from the zero-
knowledge property of the protocol, and vice versa. Our characterization result yields a …
instance-dependent commitment-schemes (NIC). To obtain this result we consider the
notion of V-bit protocols, which are very common, and found many applications in zero-
knowledge. Our characterization result states that a protocol has a V-bit zero-knowledge
protocol if and only if it has a NIC. The NIC inherits its hiding property from the zero-
knowledge property of the protocol, and vice versa. Our characterization result yields a …
Abstract
We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider the notion of V-bit protocols, which are very common, and found many applications in zero-knowledge. Our characterization result states that a protocol has a V-bit zero-knowledge protocol if and only if it has a NIC. The NIC inherits its hiding property from the zero-knowledge property of the protocol, and vice versa.
Our characterization result yields a framework that strengthens and simplifies many zero-knowledge protocols in various settings. For example, applying this framework to the result of Micciancio et al. [18] (who showed that some problems, including Graph-Nonisomorphism and Quadratic-Residuousity, unconditionally have a concurrent zero-knowledge proof) we easily get that arbitrary, monotone boolean formulae over a large class of problems (which contains, e.g., the complement of any random self-reducible problem) unconditionally have a concurrent zero-knowledge proof.
Springer
Showing the best result for this search. See all results