On the Possibility of One-Message Weak Zero-Knowledge

On the Possibility of One-Message Weak Zero-Knowledge
复制标题

论单消息弱零知识的可能性

DOI:
10.1007/978-3-540-24638-1_7
复制
发表时间:
2004
影响因子:
3
通讯作者:
R. Pass
R. Pass
中科院分区:
计算机科学4区
文献类型:
--
作者:
B. Barak;R. Pass

文献摘要

被引文献

相似文献

我们研究是否有可能使用单消息(即,非交互式)证明系统。我们证明,在合理的(虽然不是标准的)假设下,NP中的每一种语言都存在一个单消息证明系统,满足以下零知识的放松形式:
We investigate whether it is possible to obtain any meaningful type of zero-knowledge proofs using a one-message (i.e., non-interactive) proof system. We show that, under reasonable (although not standard) assumptions, there exists a one-message proof system for every language in NP that satisfies the following relaxed form of zero knowledge: