Paper 2023/221 Original: eprint.iacr.org/2023/221 ↗

Bicorn: An optimistically efficient distributed randomness beacon

Kevin Choi
Arasu Arun
Nirvan Tyagi
Joseph Bonneau
Abstract

We introduce Bicorn, an optimistically efficient distributed randomness protocol with strong robustness under a dishonest majority. Bicorn is a "commit-reveal-recover" protocol. Each participant commits to a random value, which are combined to produce a random output. If any participants fail to open their commitment, recovery is possible via a single time-lock puzzle which can be solved by any party. In the optimistic case, Bicorn is a simple and efficient two-round protocol with no time-lock puzzle. In either case, Bicorn supports open, flexible participation, requires only a public bulletin board and no group-specific setup or PKI, and is guaranteed to produce random output assuming any single participant is honest. All communication and computation costs are (at most) linear in the number of participants with low concrete overhead.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2023-02-17: last updated
2023-02-17: published
Short URL
https://ia.cr/2023/221
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2023/221,
      author = {Kevin Choi and Arasu Arun and Nirvan Tyagi and Joseph Bonneau},
      title = {Bicorn: An optimistically efficient distributed randomness beacon},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/221},
      year = {2023},
      url = {https://eprint.iacr.org/2023/221}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.