Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Chaya Ganesh
  • Yashvanth Kondi, Northeastern University
  • ,
  • Arpita Patra, Indian Institute of Science
  • ,
  • Pratik Sarkar, Indian Institute of Science

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. We draw motivation from state-of-the-art non-interactive secure computation protocols and leveraging specifics of ZK functionality show a two-round protocol that achieves static security. It is a proof, while most known efficient ZK protocols and our three round protocol are only arguments.

Original languageEnglish
Title of host publicationPublic-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings
EditorsMichel Abdalla, Ricardo Dahab
Number of pages31
PublisherSpringer
Publication year2018
Pages499-529
ISBN (print)9783319765778
DOIs
Publication statusPublished - 2018
Event21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018 - Rio de Janeiro, Brazil
Duration: 25 Mar 201829 Mar 2018

Conference

Conference21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018
LandBrazil
ByRio de Janeiro
Periode25/03/201829/03/2018
SeriesLecture Notes in Computer Science (LNCS)
Number10770
ISSN0302-9743

See relations at Aarhus University Citationformats

ID: 128400485