Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 99 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 23 tok/s
GPT-5 High 19 tok/s Pro
GPT-4o 108 tok/s
GPT OSS 120B 465 tok/s Pro
Kimi K2 179 tok/s Pro
2000 character limit reached

RANDGENER: Distributed Randomness Beacon from Verifiable Delay Function (2310.12693v1)

Published 19 Oct 2023 in cs.CR

Abstract: Buoyed by the excitement around secure decentralized applications, the last few decades have seen numerous constructions of distributed randomness beacons (DRB) along with use cases; however, a secure DRB (in many variations) remains an open problem. We further note that it is natural to want some kind of reward for participants who spend time and energy evaluating the randomness beacon value -- this is already common in distributed protocols. In this work, we present RandGener, a novel $n$-party commit-reveal-recover (or collaborative) DRB protocol with a novel reward and penalty mechanism along with a set of realistic guarantees. We design our protocol using trapdoor watermarkable verifiable delay functions in the RSA group setting (without requiring a trusted dealer or distributed key generation).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (7)
  1. M. Blum, “Coin flipping by telephone a protocol for solving impossible problems,” SIGACT News, vol. 15, no. 1, pp. 23–27, 1983. [Online]. Available: https://doi.org/10.1145/1008908.1008911
  2. P. Schindler, A. Judmayer, M. Hittmeir, N. Stifter, and E. R. Weippl, “Randrunner: Distributed randomness from trapdoor vdfs with strong uniqueness,” 2020, p. 942. [Online]. Available: https://eprint.iacr.org/2020/942
  3. K. Choi, A. Arun, N. Tyagi, and J. Bonneau, “Bicorn: An optimistically efficient distributed randomness beacon,” IACR Cryptol. ePrint Arch., p. 221, 2023. [Online]. Available: https://eprint.iacr.org/2023/221
  4. A. K. Lenstra and B. Wesolowski, “A random zoo: sloth, unicorn, and trx,” IACR Cryptol. ePrint Arch., p. 366, 2015. [Online]. Available: http://eprint.iacr.org/2015/366
  5. B. Wesolowski, “Efficient verifiable delay functions,” 2018, p. 623. [Online]. Available: https://eprint.iacr.org/2018/623
  6. K. Pietrzak, “Simple verifiable delay functions,” IACR Cryptol. ePrint Arch., 2018. [Online]. Available: https://eprint.iacr.org/2018/627
  7. D. Boneh, J. Bonneau, B. Bünz, and B. Fisch, “Verifiable delay functions,” IACR Cryptol. ePrint Arch., vol. 2018, p. 601, 2018. [Online]. Available: https://eprint.iacr.org/2018/601
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.