Post-Quantum Secure Decentralized Random Number Generation Protocol with Two Rounds of Communication in the Standard Model
Pham Nhat Minh, Khuong Nguyen-An

TL;DR
This paper introduces a novel post-quantum secure decentralized random number generator that operates in the standard model, requiring only two communication rounds and tolerating a majority of dishonest participants.
Contribution
It presents the first DRNG based on lattice-based PVSS that is secure in the standard model, efficient with only two rounds, and robust against quantum attacks.
Findings
Achieves post-quantum security in the standard model.
Requires only two rounds of communication.
Tolerates up to half of the participants being dishonest.
Abstract
Randomness plays a vital role in numerous applications, including simulation, cryptography, distributed systems, and gaming. Consequently, extensive research has been conducted to generate randomness. One such method is to design a decentralized random number generator (DRNG), a protocol that enables multiple participants to collaboratively generate random outputs that must be publicly verifiable. However, existing DRNGs are either not secure against quantum computers or depend on the random oracle model (ROM) to achieve security. In this paper, we design a DRNG based on lattice-based publicly verifiable secret sharing (PVSS) that is post-quantum secure and proven secure in the standard model. Additionally, our DRNG requires only two rounds of communication to generate a single (pseudo)random value and can tolerate up to any t < n/2 dishonest participants. To our knowledge, the proposed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Cryptography and Data Security · Cloud Data Security Solutions
