arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0609057cs.CR
收藏

可认证公钥模型中并发不可扩展的零知识

Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model

Yi Deng, Giovanni Di Crescenzo, Dongdai Lin

摘要:

我们考虑一种类型的零知识协议,他们的实际应用中的网络,如互联网的兴趣:有效的零知识参数的知识,仍然是安全的并发中间人攻击。为了减少设置假设所需的有效零知识参数的知识,仍然是安全的并发人在中间攻击,我们考虑一个模型,我们称之为认证公钥(APK)模型。APK模型似乎大大减少了CRS模型所做的设置假设(因为不需要可信方或诚实执行集中式算法),并且可以被视为\cite{CGGM,MR}中的裸公钥(BPK)模型的稍强变体,以及\cite{BCNP}中使用的注册公钥模型的较弱变体。然后,我们定义和研究的APK模型中的中间人攻击。我们的主要结果是一个常数轮并发的非延展性零知识参数的知识为任何多项式时间关系(与语言在$\mathcal{NP}$),根据(最小)的假设存在一个单向函数家庭。此外,我们展示了我们的协议的时间有效的实例化的基础上已知的数论假设。我们还注意到一个负面的结果,进一步减少我们的协议的设置假设的(未经认证的)BPK模型,通过显示,同时非可塑性的零知识参数的BPK模型中的知识是唯一可能的平凡的语言。

英文摘要:

We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowledge that remain secure against concurrent man-in-the-middle attacks. In an effort to reduce the setup assumptions required for efficient zero-knowledge arguments of knowledge that remain secure against concurrent man-in-the-middle attacks, we consider a model, which we call the Authenticated Public-Key (APK) model. The APK model seems to significantly reduce the setup assumptions made by the CRS model (as no trusted party or honest execution of a centralized algorithm are required), and can be seen as a slightly stronger variation of the Bare Public-Key (BPK) model from \cite{CGGM,MR}, and a weaker variation of the registered public-key model used in \cite{BCNP}. We then define and study man-in-the-middle attacks in the APK model. Our main result is a constant-round concurrent non-malleable zero-knowledge argument of knowledge for any polynomial-time relation (associated to a language in $\mathcal{NP}$), under the (minimal) assumption of the existence of a one-way function family. Furthermore,We show time-efficient instantiations of our protocol based on known number-theoretic assumptions. We also note a negative result with respect to further reducing the setup assumptions of our protocol to those in the (unauthenticated) BPK model, by showing that concurrently non-malleable zero-knowledge arguments of knowledge in the BPK model are only possible for trivial languages.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑