arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~

关于有效零知识证明的证明复杂性视角

A proof complexity perspective on effectively zero-knowledge proofs

Jan Krajicek

arXiv 2607.13540首次发表:更新:

AI 中文总结

研究从证明复杂性视角探讨有效零知识证明,通过逻辑语言重新阐述并给出相关性质证明,利用证明复杂性生成器理论,在一定假设下将其转化为真正的零知识证明。

AI 中文摘要

伊兰戈(FOCS 2025)发明了有效零知识证明,这是零知识的一种新变体。我们用逻辑语言重新阐述它,并(在与伊兰戈(FOCS 2025)相同的假设下)给出其存在性以及伊兰戈(FOCS 2025)中定义的关键属性“与真实不可区分”的简单证明。利用证明复杂性生成器理论,我们表明假设该理论中关于硬生成器存在的一个猜想,并允许各方共享一个公共随机字符串,这个概念可以转化为真正的零知识证明。

英文摘要

Ilango (FOCS 2025) invented effectively zero-knowledge proofs, a new variant of zero-knowledge. We reformulate it in the language of logic and give simple proofs (under the same assumptions as Ilango (FOCS 2025)) of its existence and of the key property defined in Ilango (FOCS 2025) that it is "indistinguishable from true" (that property is in Ilango (FOCS 2025) a part of the definition of the prover, not its consequence). Using the theory of proof complexity generators we show that the concept can be turned it into a genuinely zero-knowledge proofs, assuming a conjecture from the theory about the existence of a hard generator and allowing the parties to share a common random string.

Commentspreliminary version

论文原文

arXiv 摘要页 · PDF 原文 · HTML 原文

↑