Decentralised Random Number Generation
Peter Robinson

TL;DR
This paper introduces a new encrypted share threshold scheme to prevent the Last Actor Problem in decentralised random number generation, enhancing security by ensuring no single participant can manipulate the outcome.
Contribution
The paper presents a novel encrypted share threshold scheme that mitigates the Last Actor Problem in decentralised random number generation.
Findings
The scheme effectively prevents manipulation by the last revealing participant.
It enhances security in decentralised systems.
The approach is practical for real-world deployment.
Abstract
Decentralised random number generation algorithms suffer from the Last Actor Problem, in which the last participant to reveal their share can manipulate the generated random value by withholding their share. This paper proposes an encrypted share threshold scheme which prevents this attack.
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
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Advanced Steganography and Watermarking Techniques
