Zero Knowledge Protocols from Succinct Constraint Detection.
TCC(2017)
摘要
We study the problem of constructing proof systems that achieve both soundness and zero knowledge unconditionally (without relying on intractability assumptions). Known techniques for this goal are primarily combinatorial, despite the fact that constructions of interactive proofs (IPs) and probabilistically checkable proofs (PCPs) heavily rely on algebraic techniques to achieve their properties.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络