The Knowledge-of-Exponent Assumptions and 3-Round Zero-Knowledge Protocols.

ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS(2004)

引用 316|浏览60
暂无评分
摘要
Hada and Tanaka [11, 12] showed the existence of 3-round, negligible-error zero-knowledge arguments for NP based on a pair of non-standard assumptions, here called KEA1 and KEA2. In this paper we show that KEA2 is false. This renders vacuous the results of [11, 12]. We recover these results, however, under a suitably modified new assumption called KEA3. What we believe is most interesting is that we show that it is possible to "falsify" assumptions like KEA2 that, due to their nature and quantifier-structure, do not lend themselves easily to "efficient falsification" (Naor [15]).
更多
查看译文
关键词
zero knowledge
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要