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

Damiano Abram, Brent Waters, Mark Zhandry

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publication Advances in Cryptology – CRYPTO 2023
EditorsHelena Handschuh, Anna Lysyanskaya
Place of PublicationCham
PublisherSpringer
Pages489–514
ISBN (Electronic)9783031385575
ISBN (Print)9783031385568
DOIs
Publication statusPublished - 9 Aug 2023
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume14081
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

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