RANDAO-based RNG: Last Revealer Attacks in Ethereum 2.0 Randomness and a Potential Solution

• URL: http://arxiv.org/abs/2403.09541v1
• Date: Thu, 14 Mar 2024 16:28:33 GMT
• Title: RANDAO-based RNG: Last Revealer Attacks in Ethereum 2.0 Randomness and a Potential Solution
• Authors: Do Hai Son, Tran Thi Thuy Quynh, Le Quang Minh,
• Abstract summary: RANDAO 2.0 is a major upgrade to improve its scalability, throughput, and security. A vulnerability, referred to as the Last Revealer Attack' (LRA), compromises the randomness of this scheme. We propose a Shamir's Secret Sharing (SSS)-based RANDAO scheme to mitigate the LRA.
• Score: 0.5917100081691199
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ethereum 2.0 is a major upgrade to improve its scalability, throughput, and security. In this version, RANDAO is the scheme to randomly select the users who propose, confirm blocks, and get rewards. However, a vulnerability, referred to as the `Last Revealer Attack' (LRA), compromises the randomness of this scheme by introducing bias to the Random Number Generator (RNG) process. This vulnerability is first clarified again in this study. After that, we propose a Shamir's Secret Sharing (SSS)-based RANDAO scheme to mitigate the LRA. Through our analysis, the proposed method can prevent the LRA under favorable network conditions.

Related papers

• P2S: Probabilistic Process Supervision for General-Domain Reasoning Question Answering [51.04492568024515]
  We introduce Probabilistic Process Supervision (P2S), a novel framework for fine-grained process rewards.<n>P2S provides fine-grained process rewards without requiring a separate reward model or human-annotated reasoning steps.
  arXiv  Detail & Related papers  (2026-01-28T14:35:20Z)
• Adding All Flavors: A Hybrid Random Number Generator for dApps and Web3 [4.0679510897095295]
  We propose a hybrid random number generation solution that leverages IoT devices equipped with trusted execution environment (TEE) as the randomness sources.<n>The new approach only needs one honest random source to guarantee the unbiasedness of the final random number.<n>We evaluate the computation and gas costs to demonstrate the effectiveness of the improvement.
  arXiv  Detail & Related papers  (2025-10-14T01:59:12Z)
• One Token Embedding Is Enough to Deadlock Your Large Reasoning Model [91.48868589442837]
  We present the Deadlock Attack, a resource exhaustion method that hijacks an LRM's generative control flow.<n>Our method achieves a 100% attack success rate across four advanced LRMs.
  arXiv  Detail & Related papers  (2025-10-12T07:42:57Z)
• Pseudo-MDPs: A Novel Framework for Efficiently Optimizing Last Revealer Seed Manipulations in Blockchains [0.0]
  This study tackles the computational challenges of solving Markov Decision Processes (MDPs) for a restricted class of problems.<n>It is motivated by the Last Revealer Attack (LRA), which undermines fairness in some Proof-of-Stake (PoS) blockchains such as capitalization (B market)<n>We introduce pseudo-MDPs (pMDPs) a framework that naturally models such problems and propose two distinct problem reductions to standard MDPs.
  arXiv  Detail & Related papers  (2025-10-08T14:39:20Z)
• Post-Quantum Secure Decentralized Random Number Generation Protocol with Two Rounds of Communication in the Standard Model [0.0]
  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.
  arXiv  Detail & Related papers  (2025-05-12T13:17:55Z)
• Commit-Reveal$^2$: Randomized Reveal Order Mitigates Last-Revealer Attacks in Commit-Reveal [0.0]
  Commit-Reveal$2$ protocol employs a two-layer Commit-Reveal process to randomize the reveal order and mitigate the risk of such attacks. We implement a prototype of the proposed mechanism and publicly release the code to facilitate practical adoption and further research.
  arXiv  Detail & Related papers  (2025-04-04T21:05:51Z)
• Game-Theoretically Secure Distributed Protocols for Fair Allocation in Coalitional Games [2.1779479916071067]
  We consider game-theoretically secure protocols for coalition games that approximate the Shapley value with small multiplicative error. The game-theoretic notion of maximin security has been proposed to offer guarantees to an honest player's reward even if all other players are susceptible to an adversary.
  arXiv  Detail & Related papers  (2024-12-26T12:13:21Z)
• PureLottery: Fair and Bias-Resistant Leader Election with a Novel Single-Elimination Tournament Algorithm [0.0]
  Leader Election (LE) is crucial in distributed systems and blockchain technology, ensuring one participant acts as the leader. Traditional LE methods often depend on distributed random number generation (RNG), facing issues like vulnerability to manipulation, lack of fairness, and the need for complex procedures such as verifiable delay functions (VDFs) and publicly-verifiable secret sharing (PVSS) This Bachelor's thesis presents a novel approach to randomized LE, leveraging a game-theoretic assumption that participants, aiming to be chosen as leaders, will naturally avoid actions that diminish their chances. This perspective simplifies LE by eliminating the need for decentralized
  arXiv  Detail & Related papers  (2024-02-27T12:30:17Z)
• Private and Secure Post-Quantum Verifiable Random Function with NIZK Proof and Ring-LWE Encryption in Blockchain [1.4792750204228]
  We present a blockchain-based Verifiable Random Function (VRF) scheme addressing some limitations of classical VRF constructions. To enhance our VRF's secure randomness, we adopt post-quantum Ring-LWE encryption for pseudo-random sequences. Our results exhibit a 98.86% pass rate over 11 test cases, with an average p-value of 0.5459 from 176 total tests.
  arXiv  Detail & Related papers  (2023-11-20T12:56:50Z)
• 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)
• Random Boxes Are Open-world Object Detectors [71.86454597677387]
  We show that classifiers trained with random region proposals achieve state-of-the-art Open-world Object Detection (OWOD) We propose RandBox, a Fast R-CNN based architecture trained on random proposals at each training. RandBox significantly outperforms the previous state-of-the-art in all metrics.
  arXiv  Detail & Related papers  (2023-07-17T05:08:32Z)
• Secure Deep Learning-based Distributed Intelligence on Pocket-sized Drones [75.80952211739185]
  Palm-sized nano-drones are an appealing class of edge nodes, but their limited computational resources prevent running large deep-learning models onboard. Adopting an edge-fog computational paradigm, we can offload part of the computation to the fog; however, this poses security concerns if the fog node, or the communication link, can not be trusted. We propose a novel distributed edge-fog execution scheme that validates fog computation by redundantly executing a random subnetwork aboard our nano-drone.
  arXiv  Detail & Related papers  (2023-07-04T08:29:41Z)
• Best Arm Identification for Stochastic Rising Bandits [84.55453174601826]
  Rising Bandits (SRBs) model sequential decision-making problems in which the expected reward of the available options increases every time they are selected. This paper focuses on the fixed-budget Best Arm Identification (BAI) problem for SRBs. We propose two algorithms to tackle the above-mentioned setting, namely R-UCBE and R-SR.
  arXiv  Detail & Related papers  (2023-02-15T08:01:37Z)
• Dual Lottery Ticket Hypothesis [71.95937879869334]
  Lottery Ticket Hypothesis (LTH) provides a novel view to investigate sparse network training and maintain its capacity. In this work, we regard the winning ticket from LTH as the subnetwork which is in trainable condition and its performance as our benchmark. We propose a simple sparse network training strategy, Random Sparse Network Transformation (RST), to substantiate our DLTH.
  arXiv  Detail & Related papers  (2022-03-08T18:06:26Z)
• A Double-Linked Blockchain Approach Based on Proof-of-Refundable-Tax Consensus Algorithm [0.0]
  We propose a double-linked blockchain data structure that greatly improves blockchain performance and guarantees single chain with no forks. With the proposed proof-of-refundable-tax (PoRT) consensus algorithm, our approach can construct highly reliable, efficient, fair and stable blockchain operations.
  arXiv  Detail & Related papers  (2021-09-14T08:30:32Z)
• Security and Privacy Enhanced Gait Authentication with Random Representation Learning and Digital Lockers [3.3549957463189095]
  Gait data captured by inertial sensors have demonstrated promising results on user authentication. Most existing approaches stored the enrolled gait pattern insecurely for matching with the pattern, thus, posed critical security and privacy issues. We present a gait cryptosystem that generates from gait data the random key for user authentication, meanwhile, secures the gait pattern.
  arXiv  Detail & Related papers  (2021-08-05T06:34:42Z)
• 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)
• Optimistic Policy Optimization with Bandit Feedback [70.75568142146493]
  We propose an optimistic trust region policy optimization (TRPO) algorithm for which we establish $tilde O(sqrtS2 A H4 K)$ regret for previous rewards. To the best of our knowledge, the two results are the first sub-linear regret bounds obtained for policy optimization algorithms with unknown transitions and bandit feedback.
  arXiv  Detail & Related papers  (2020-02-19T15:41:18Z)

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.