Strong Batching for Non-interactive Statistical Zero-Knowledge

Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A zero-knowledge proof enables a prover to convince a verifier that x∈S, without revealing anything beyond this fact. By running a zero-knowledge proof k times, it is possible to prove (still in zero-knowledge) that k separate instances x1,⋯,xk are all in S. However, this increases the communication by a factor of k. Can one do better? In other words, is (non-trivial) zero-knowledge batch verification for S possible? Recent works by Kaslasi et al. (TCC 2020, Eurocrypt 2021) show that any problem possessing a non-interactive statistical zero-knowledge proof (NISZK) has a non-trivial statistical zero-knowledge batch verification protocol. Their results had two major limitations: (1) to batch verify k inputs of size n each, the communication in their batch protocol is roughly poly(n,logk)+O(k), which is better than the naive cost of k·poly(n) but still scales linearly with k, and, (2) the batch protocol requires Ω(k) rounds of interaction. In this work we remove both of these limitations by showing that any problem in NISZK has a non-interactive statistical zero-knowledge batch verification protocol with communication poly(n,logk).

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 2024 - 43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2024, Proceedings
EditorsMarc Joye, Gregor Leander
PublisherSpringer Science and Business Media Deutschland GmbH
Pages241-270
Number of pages30
ISBN (Print)9783031587504
DOIs
StatePublished - 2024
Event43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024 - Zurich, Switzerland
Duration: 26 May 202430 May 2024

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14656 LNCS

Conference

Conference43rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2024
Country/TerritorySwitzerland
CityZurich
Period26/05/2430/05/24

Keywords

  • Batch Verification
  • SZK
  • Zero-knowledge Proofs

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Strong Batching for Non-interactive Statistical Zero-Knowledge'. Together they form a unique fingerprint.

Cite this