Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles

Damiano Abram*, Brent Waters, Mark Zhandry

*Corresponding author for this work

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


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.
Original languageEnglish
Title of host publicationAdvances in Cryptology : CRYPTO 2023, Proceedings
EditorsHelena Handschuh, Anna Lysyanskaya
Number of pages26
VolumePart I
Place of publicationCham
Publication dateAug 2023
ISBN (Print)978-3-031-38556-8
ISBN (Electronic)978-3-031-38557-5
Publication statusPublished - Aug 2023
Event43rd Annual International Cryptology Conference - University of California, Santa Barbara, United States
Duration: 20 Aug 202324 Aug 2023
Conference number: 43


Conference43rd Annual International Cryptology Conference
LocationUniversity of California
Country/TerritoryUnited States
CitySanta Barbara
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles'. Together they form a unique fingerprint.

Cite this