How to Go Beyond the Black-Box Simulation Barrier
FOCS(2001)
摘要
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the in- teraction of the adversary with an honest party, without knowing the priv ate input of this honest party. Almost all known simulators use the adversary's algorithm as a black-box. We present the first constructions of non-black-box simulators. Using these new non-black-box techniques we obtain several results that were previously proven to be impossible to obtain using black-box simulators. Specifically, assuming the existence of collision resistent hash functions, we construct a new zero-knowledge argument system for NP that satisfies the following properties: 1. This system has a constant number of rounds with negligible soundness error. 2. It remains zero knowledge even when composed concurrently n times, where n is the security parameter. Simultaneously obtaining 1 and 2 has been recently proven to be impossible to achieve using black-box simu- lators. 3. It is an Arthur-Merlin (public coins) protocol. Simultaneously obtaining 1 and 3 was known to be impossible to achieve with a black-box simulator. 4. It has a simulator that runs in strict polynomial time, rather than in expected polynomial time. All previously known constant-round, negligible-error zero-knowled ge arguments utilized expected polynomial- time simulators.
更多查看译文
关键词
computational complexity,protocols,cryptography
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络