Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits
复制标题
高效自适应地保护乱码电路的零知识
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Pratik Sarkar
中科院分区：
文献类型：
--
作者：
C. Ganesh;Yashvanth Kondi;A. Patra;Pratik Sarkar
零知识(ZK)协议无疑是密码学中的核心原语之一，将它们的能力提供给许多应用程序，如安全计算、投票、拍卖和匿名凭据等等。近年来，基于安全计算技术的非代数语句高效ZK协议的研究取得了很大进展。这项工作的主要贡献在于从篡改的电路中构造高效的UC安全的恒定轮ZK协议，这些协议是针对自适应腐败的安全的，并且通信在语句的大小中线性。我们首先证明了Jawurek等人的实际有效的ZK协议。当底层不经意传输(OT)满足温和的自适应安全保证时，(CCS 2013)是自适应安全的。与静态情况相比，我们在几乎没有开销的情况下获得自适应安全。然后使用条件验证技术在不可编程随机预言模型(NPROM)中获得自适应安全的三轮零知识论证。我们的三轮协议在正确选择安全参数的情况下，在Short-CRS模型中产生了比已知的UC安全的实际有效的方案更短的证明长度。
Zero-knowledge (ZK) protocols are undoubtedly among the central primitives in cryptography, lending their power to numerous applications such as secure computation, voting, auctions, and anonymous credentials to name a few. The study of efficient ZK protocols for non-algebraic statements has seen rapid progress in recent times, relying on secure computation techniques. The primary contribution of this work lies in constructing efficient UC-secure constant round ZK protocols from garbled circuits that are secure against adaptive corruptions, with communication linear in the size of the statement. We begin by showing that the practically efficient ZK protocol of Jawurek et al. (CCS 2013) is adaptively secure when the underlying oblivious transfer (OT) satisfies a mild adaptive security guarantee. We gain adaptive security with little to no overhead over the static case. A conditional verification technique is then used to obtain a three-round adaptively secure zero-knowledge argument in the non-programmable random oracle model (NPROM). Our three-round protocol yields a proof size that is shorter than the known UC-secure practically-efficient schemes in the short-CRS model with the right choice of security parameters.