International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles

Authors:
Damiano Abram , Aarhus University
Brent Waters , The University of Texas at Austin, NTT Research
Mark Zhandry , NTT Research
Download:
DOI: 10.1007/978-3-031-38557-5_16 (login may be required)
Search ePrint
Search Google
Presentation: Slides
Conference: CRYPTO 2023
Abstract: A distributed sampler is a way for several mutually distrusting parties to non-interactively generate a common reference string (CRS) that all parties trust. Previous work constructs distributed samplers in the random oracle model, or in the standard model with very limited security guarantees. This is no accident, as standard model distributed samplers with full security were shown impossible. In this work, we provide new definitions for distributed samplers which we show achieve meaningful security guarantees in the standard model. In particular, our notion implies that the hardness of a wide range of security games is preserved when the CRS is replaced with a distributed sampler. We also show how to realize our notion of distributed samplers. A core technical tool enabling our construction is a new notion of single-message zero knowledge.
BibTeX
@inproceedings{crypto-2023-33170,
  title={Security-Preserving Distributed Samplers: How to Generate any CRS in One Round without Random Oracles},
  publisher={Springer-Verlag},
  doi={10.1007/978-3-031-38557-5_16},
  author={Damiano Abram and Brent Waters and Mark Zhandry},
  year=2023
}