Decentralised Random Number Generation

07/06/2018
by   Peter Robinson, et al.
0

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.

READ FULL TEXT
research
05/23/2022

Linear random generation of Motzkin trees

Motzkin trees are also called unary-binary trees. This paper proposes a ...
research
11/05/2018

A Network Reliability Approach to the Analysis of Combinatorial Repairable Threshold Schemes

A repairable threshold scheme (which we abbreviate to RTS) is a (τ,n)-th...
research
10/08/2020

A Proxy-Based Encrypted Online Social Network With Fine-Grained Access

When using Online Social Networks, users often share information with di...
research
04/25/2019

Maximin share allocations on cycles

The problem of fair division of indivisible goods is a fundamental probl...
research
07/10/2019

An algorithmic framework for approximating maximin share allocation of chores

In this paper, we consider the problem of how to fairly dividing m indiv...
research
04/13/2023

Cryptanalysis of Random Affine Transformations for Encrypted Control

Cloud-based and distributed computations are of growing interest in mode...
research
04/19/2023

5G-SRNG: 5G Spectrogram-based Random Number Generation for Devices with Low Entropy Sources

Random number generation (RNG) is a crucial element in security protocol...

Please sign up or login with your details

Forgot password? Click here to reset