Post-Quantum Secure Decentralized Random Number Generation Protocol with Two Rounds of Communication in the Standard Model

• URL: http://arxiv.org/abs/2505.07536v1
• Date: Mon, 12 May 2025 13:17:55 GMT
• Title: Post-Quantum Secure Decentralized Random Number Generation Protocol with Two Rounds of Communication in the Standard Model
• Authors: Pham Nhat Minh, Khuong Nguyen-An,
• Abstract summary: Decentralized random number generator (DRNG) is a protocol that enables multiple participants to collaboratively generate random outputs that must be publicly verifiable.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 DRNG construction is the first to achieve all these properties.

Related papers

• Existential Unforgeability in Quantum Authentication From Quantum Physical Unclonable Functions Based on Random von Neumann Measurement [45.386403865847235]
  Physical Unclonable Functions (PUFs) leverage inherent, non-clonable physical randomness to generate unique input-output pairs.<n>Quantum PUFs (QPUFs) extend this concept by using quantum states as input-output pairs.<n>We show that random unitary QPUFs cannot achieve existential unforgeability against Quantum Polynomial Time adversaries.<n>We introduce a second model where the QPUF functions as a nonunitary quantum channel, which guarantees existential unforgeability.
  arXiv  Detail & Related papers  (2024-04-17T12:16:41Z)
• Data Analysis Methods Preliminaries for a Photon-based Hardware Random Number Generator [39.58317527488534]
  Minecraft is great for games, but not so great for cybersecurity encryption key generation. PRNGs generate random numbers by quantifying some unpredictable phenomena into a number or string and feeding it into an algorithm. By using a hardware random number generator (HRNG), random numbers that are not susceptible to the flaws found in PRNGs can be attained at a high rate.
  arXiv  Detail & Related papers  (2024-04-15T00:47:17Z)
• Pseudorandom unitaries with non-adaptive security [43.15464425520681]
  We present a PRU construction that is a concatenation of a random Clifford unitary, a pseudorandom binary phase operator, and a pseudorandom permutation operator. We prove that this PRU construction is secure against non-adaptive distinguishers assuming the existence of quantum-secure one-way functions.
  arXiv  Detail & Related papers  (2024-02-22T18:56:37Z)
• Improvements on Device Independent and Semi-Device Independent Protocols of Randomness Expansion [0.0]
  Device Independent (DI) and Semi-Device Independent (semi-DI) protocols of randomness expansion are discussed. We introduce enhanced DI and semi-DI protocols that surpass existing ones in terms of output randomness rate, security, or in some instances, both. A notable contribution is the introduction of randomness expansion protocols that recycle input randomness, significantly enhancing finite round randomness rates for DI protocols based on the CHSH inequality violation.
  arXiv  Detail & Related papers  (2023-11-22T17:03:04Z)
• A Game-theoretic Approach for Provably-Uniform Random Number Generation in Decentralized Networks [0.6216023343793144]
  We provide a protocol for distributed generation of randomness. It is trustless and generates unbiased random numbers. It is also tamper-proof and no party can change the output or affect its distribution.
  arXiv  Detail & Related papers  (2023-09-20T12:21:39Z)
• Certification of randomness without seed randomness [0.0]
  Device-independently certified random number generators provide maximum security. We propose a one-sided device-independent scheme to certify two bits of randomness without the initial seed randomness.
  arXiv  Detail & Related papers  (2023-07-21T10:52:44Z)
• Randomness Certification from Multipartite Quantum Steering for Arbitrary Dimensional Systems [18.328936600754016]
  We show that the distributed structure of several parties leads to additional protection against possible attacks by an eavesdropper. We prove that the necessary and sufficient resource for quantum randomness in this scenario is multipartite quantum steering.
  arXiv  Detail & Related papers  (2023-07-05T06:58:41Z)
• A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
  We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits. limitations on computing power can restrict an end-user's ability to perform such verification.
  arXiv  Detail & Related papers  (2023-05-18T12:13:48Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• A trustless decentralized protocol for distributed consensus of public quantum random numbers [0.0]
  Quantum random number (QRNG) beacons distinguish themselves from classical counterparts by providing intrinsic unpredictability. We introduce a proof-of-principle experiment of the first consensus protocol producing QRNs in a decentralized environment (dQRNG) Our method is thus suited for distribute systems that requires a bias-resistant, highly secure, and public-verifiable random beacon.
  arXiv  Detail & Related papers  (2021-08-26T21:17:58Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.