A practical lottery using oblivious transfer

Abstract

SUMMARYIn this letter, a practice-oriented lottery protocol that allows a player to select t from the pre-defined n elements is proposed using the method of oblivious transfer and Lagrange interpolation polynomial. Each player can verify if its contribution is really involved in generating the final result without other's collaboration. Next, neither the delaying function nor the trusted third party is necessary in the proposed protocol, which guarantees the protocol more robust and efficient. Furthermore, the proposed protocol is more practical without the assumption that n should be small.

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

“…However, some TTP needs to be involved in the drawing phase to generate the winning number. In [15], Liu et al extended Lee's schemes in two aspects. First, players' privacy is protected using an efficient oblivious transfer rather than blind signatures.…”

“…In Step 5, the communication cost is 1024 bit. To achieve the same security level, Liu's scheme [15] needs to use a subgroup with order q, where q is a 256-bit prime, and the modular p needs to be set as a 3072-bit prime according to the NIST recommendations. Each drawing center needs to perform nine full modular exponentiations in Z p .…”