Electronic National Lotteries

Konstantinou, Elisavet; Liagkou, Vasiliki; Spirakis, Paul G.; Stamatiou, Yannis C.; Yung, Moti

doi:10.1007/978-3-540-27809-2_18

Cited by 13 publications

(9 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In contrast, the BBS and RSA (see 3.2.1 for a discussion of BBS) are polynomially unpredictable. For this reason, such generators are the generators of choice in applications where unpredictability is a major requirement, such as in the implementation of Electronic Lotteries (see [14,15] and Section 5), key generation and network security protocols.…”

Section: Pseudorandom Number Generationmentioning

confidence: 99%

“…More specifically (see [12]) let us fix, for concreteness, the number of bins or categories m to be 2 20 and the number of balls or observations n to be equal to 2 14 . In our experiment, we throw at random these n balls into the m bins.…”

Section: Collision Testmentioning

confidence: 99%

“…One such lottery design has been proposed in [14,15]. A high-level description of the system components as well as their roles is shown in Figure 3.…”

Section: Online Electronic Lotteriesmentioning

confidence: 99%

“…In the specific implementation in [14,15], the sizes of P and Q were 1000 bits and 200 bits respectively. Note that, in general, a pseudorandom function is applied both for randomizing, further, the input value and serving as a commitment for the generation of the next winning number sequence, in the case of the lottery.…”

Section: Seed Commitment and Reproduction Of Received Numbersmentioning

confidence: 99%

See 3 more Smart Citations

Random Number Generators: Principles and Applications

Bikos,

Nastou,

Petroudis

et al. 2023

Preprint

View full text Add to dashboard Cite

this paper we present approaches for generating random numbers along with potential applications. Rather than trying to provide extensive coverage of several techniques or algorithms that have appeared in the scientific literature, we focus on some representative approaches presenting their workings and properties in detail. Our goal is to delineate their strengths and weaknesses as well as their potential application domains so as the reader can judge what would be the best approach for the application in hand, possibly a combination of the available approaches. For instance, a physical source of randomness can be used for the initial seed, then suitable preprocessing can enhance its randomness and then the output of the preprocessing can feed different types of generators, e.g. a linear congruential generator, a cryptographically secure one and one based on the combination of one way hash functions and shared key cryptoalgorithms in various modes of operation. Then, if desired, the outputs of the different generators can be combined giving the final random sequence. Moreover, we present a set of practical randomness tests which can be applied on the outputs of random number generators in order to assess their randomness characteristics. In order to demonstrate the importance of unpredictable random sequences, we present an application of cryptographically secure generators in domains where unpredictability is one of the major requirements, i.e. eLotteries and cryptographic key generation.

show abstract

Section: Pseudorandom Number Generationmentioning

confidence: 99%

Section: Collision Testmentioning

confidence: 99%

“…One such lottery design has been proposed in [14,15]. A high-level description of the system components as well as their roles is shown in Figure 3.…”

Section: Online Electronic Lotteriesmentioning

confidence: 99%

Section: Seed Commitment and Reproduction Of Received Numbersmentioning

confidence: 99%

See 2 more Smart Citations

Random Number Generators: Principles and Applications

Bikos,

Nastou,

Petroudis

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Some other e-lottery schemes based on delay functions can be found in [6][7][8]. The design and implementation of large-scale lottery systems have been described in [9,10].…”

Section: Related Workmentioning

confidence: 99%

An Information Theoretically Secure E-Lottery Scheme Based on Symmetric Bivariate Polynomials

et al. 2019

View full text Add to dashboard Cite

E-lottery schemes have attracted much interest from both industry and academia recently, because they are not only useful to raise funds for charity institutions, but also can be used as the major building blocks to design micro-payment systems. In the literature, a number of e-lottery schemes have been introduced over the last two decades. However, most of these schemes rely on some computational assumptions. In this paper, we introduce a novel e-lottery scheme that achieves information theoretical security. Our proposed scheme is designed using symmetric bivariate polynomials, and it satisfies the required security properties, such as correctness, unpredictability, verifiability, and robustness. Moreover, the winning number is generated in a distributed fashion, so that no trusted third party needs to be involved and the danger of a single point of failure is minimized.

show abstract