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

Abstract

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.

PureLottery: Fair Leader Election without Decentralized Random Number Generation

“…Lastly, Xia proposed a lottery scheme using symmetric bivariate polynomials for sharing random secrets among various lottery centers [45]. This distributed randomness approach is akin to distributed RNG methods seen in publiclyverifiable secret sharing schemes.…”

“…The contribution is to use a Merkle tree structure to achieve fast probabilistic verification in large-scale lottery systems, which is orthogonal to our contribution. Xia [36] proposed a lottery scheme using symmetric bivariate polynomials to share random secrets among different lottery centers. This distributed randomness is similar to distributed RNG using PVSS schemes.…”