Blind Bernoulli Trials: A Noninteractive Protocol For Hidden-Weight Coin Flips

Authors: 

R. Joseph Connor and Max Schuchard, University of Tennessee

Abstract: 

We introduce the concept of a "Blind Bernoulli Trial," a noninteractive protocol that allows a set of remote, disconnected users to individually compute one random bit each with probability p defined by the sender, such that no receiver learns any more information about p than strictly necessary. We motivate the problem by discussing several possible applications in secure distributed systems. We then formally define the problem in terms of correctness and security definitions and explore possible solutions using existing cryptographic primitives. We prove the security of an efficient solution in the standard model. Finally, we implement the solution and give performance results that show it is practical with current hardware.

BibTeX
@inproceedings {236228,
title = {Blind Bernoulli Trials: A Noninteractive Protocol For Hidden-Weight Coin Flips},
booktitle = {28th {USENIX} Security Symposium ({USENIX} Security 19)},
year = {2019},
address = {Santa Clara, CA},
url = {https://www.usenix.org/conference/usenixsecurity19/presentation/connor},
publisher = {{USENIX} Association},
}