Paper 2025/240

Robust Non-Interactive Zero-Knowledge Combiners

Michele Ciampi, The University of Edinburgh
Lorenzo Magliocco, Sapienza University of Rome
Daniele Venturi, Sapienza University of Rome
Yu Xia, The University of Edinburgh
Abstract

A t-out-of-n robust non-interactive zero-knowledge (NIZK) combiner is a construction that, given access to n candidate instantiations of a NIZK for some language, itself implements a NIZK for the same language. Moreover, the combiner is secure, assuming at least of the given candidates are secure. In this work, we provide the first definition of combiners for NIZK, and prove that no robust NIZK combiner exists assuming (unless the polynomial hierarchy collapses). On the positive side, we provide different constructions of robust NIZK combiners for . In particular, we show how to obtain: 1) A black-box combiner working for a special class of {\em homomorphic} languages where are polynomial and . 2) A non-black-box combiner working for any language, where are constant and . 3) A non-black-box combiner working for any language, where are polynomial and .

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
zero-knowledgecombinersproof systems
Contact author(s)
michele ciampi @ ed ac uk
magliocco @ di uniroma1 it
venturi @ di uniroma1 it
yu xia @ ed ac uk
History
2025-02-17: approved
2025-02-15: received
See all versions
Short URL
https://ia.cr/2025/240
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/240,
      author = {Michele Ciampi and Lorenzo Magliocco and Daniele Venturi and Yu Xia},
      title = {Robust Non-Interactive Zero-Knowledge Combiners},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/240},
      year = {2025},
      url = {https://eprint.iacr.org/2025/240}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.