On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions

ePrint Report: On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions

Damiano Abram, Maciej Obremski, Peter Scholl

Distributed samplers, introduced by Abram, Scholl and Yakoubov (Eurocrypt ’22), are a one-round, multi-party protocol for securely sampling from any distribution. We give new lower and upper bounds for constructing distributed samplers in challenging scenarios. First, we consider the feasibility of distributed samplers with a malicious adversary in the standard model; the only previous construction in this setting relies on a …

distributed distribution dynamic eprint report eurocrypt party peter protocol report