An improved <i>t</i>‐out‐of‐<i>n</i> e‐lottery protocol

Liu, Yining; Lin, DeShu; Chen, H.; Jiang, Tao

doi:10.1002/dac.2536

Cited by 3 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, the computation of A ( x ), W can executed by any participant with the published information. The bottleneck relying on TTP is eliminated, which guarantees the proposed lottery protocol is more robust. PracticabilityWe analyze the proposed is more practical from two aspects.First, there exist the assumption that n should not be a large number in , which has been pointed out in , since

D MathClass-rel= {MathClass-op\prod}_{i MathClass-rel= 1}^{n} d_{i} MathClass-rel< N

is necessary. Assume that 100 non‐cryptographic d i with 20 bits length, this assumption maybe not be satisfied.…”

Section: Discussionmentioning

confidence: 99%

“…Recently, an improved version is presented without hash chain , which assures Alice to verify the result independently without a TTP or a delaying function. Nonetheless, there still exists a flaw unsolved.…”

Section: Introductionmentioning

confidence: 99%

“…Nonetheless, there still exists a flaw unsolved. In detail, Liu's protocol inherits the assumption on n of Lee‐Chang's protocol , the assumption that n should be small is analyzed in . Specifically, LI publishes n numbers { a 1 , … , a n }on the bulletin board, selects n relatively prime numbers { d 1 , … , d n }where d i > a i for i = 1, … , n , and computes the following congruence system

({, \begin{matrix} falsenonefalsearray \\ arrayaxis C = a_{1} MathClass-open(mod d_{1} MathClass-close) \\ arrayaxis ⋮ ⋮ \\ arrayaxis C = a_{n} MathClass-open(mod d_{n} MathClass-close) \end{matrix})

to obtain

C MathClass-rel= {MathClass-op\sum}_{i MathClass-rel= 1}^{n} (D MathClass-bin∕ d_{i}) y_{i} a_{i} mod D

, where

D MathClass-rel= {MathClass-op\prod}_{i MathClass-rel= 1}^{n} d_{i}

.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A practical lottery using oblivious transfer

Liu

Jiang

Chang

2014

Int J Communication

View full text Add to dashboard Cite

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.

show abstract

D MathClass-rel= {MathClass-op\prod}_{i MathClass-rel= 1}^{n} d_{i} MathClass-rel< N

is necessary. Assume that 100 non‐cryptographic d i with 20 bits length, this assumption maybe not be satisfied.…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

({, \begin{matrix} falsenonefalsearray \\ arrayaxis C = a_{1} MathClass-open(mod d_{1} MathClass-close) \\ arrayaxis ⋮ ⋮ \\ arrayaxis C = a_{n} MathClass-open(mod d_{n} MathClass-close) \end{matrix})

to obtain

C MathClass-rel= {MathClass-op\sum}_{i MathClass-rel= 1}^{n} (D MathClass-bin∕ d_{i}) y_{i} a_{i} mod D

, where

D MathClass-rel= {MathClass-op\prod}_{i MathClass-rel= 1}^{n} d_{i}

.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A practical lottery using oblivious transfer

Liu

Jiang

Chang

2014

Int J Communication

View full text Add to dashboard Cite

show abstract

“…Liu improved on this by changing the random seed to a result based on Lagrange interpolation, derived from all participants' random values, which are initially committed [27]. Despite this enhancement, Liu's scheme still needs to solve the problem of dishonestly concealing random values, a common issue in commitment schemes.…”

Section: Online Lottery Protocolsmentioning

confidence: 99%

“…In this scheme, the last participant can collude with the lottery dealer to tamper the random seed by decrypting other participants' values. Liu [34] improved this protocol by changing the random seed to a Lagrange interpolation result that depends on random values of all participants. The random values are committed in the first phase.…”

Section: Online Lottery Protocolsmentioning

confidence: 99%

PureLottery: Fair Leader Election without Decentralized Random Number Generation

Ballweg,

Cai,

Goharshady

2023

2023 IEEE International Conference on Blockchain (Blockchain)

View full text Add to dashboard Cite

Leader Election (LE) is an important process in distributed systems and blockchain technology, where one of the participants is designated as the leader or coordinator. LE is a part of many distributed systems and blockchain protocols, smart contract applications, and lotteries. Traditional randomized LE methods usually involve distributed random number generation (RNG) to select the leader. These approaches can be vulnerable to manipulation, fail to ensure fairness, or require inefficient and costly procedures, e.g., verifiable delay functions (VDFs) and publicly-verifiable secret sharing (PVSS). This Bachelor's thesis in Informatics introduces a new approach to randomized LE. The key insight is that fair leader election can be achieved without relying on explicit decentralized RNG. This is based on the game-theoretic assumption that every participant prefers to be chosen as the leader and would avoid actions that decrease their chances. This game-theoretic incentive can simplify LE protocols compared to RNG. PureLottery, inspired by single-elimination knockout tournaments in sports, offers a fair, bias-resistant, and practical solution for LE in blockchain environments. The underlying principle is that only two participants play against each other in each match, making collaboration efforts to manipulate the result useless.PureLottery is also efficient with its computational resources and communication complexity, making it practical for implementation as a smart contract. The protocol provides strong game-theoretic guarantees, incentivizing honest behavior, and is robust against adversaries, ensuring that dishonest behavior does not increase their chances of election. PureLottery is designed to be highly resistant to bias, ensuring that each honest player has a minimum winning probability of at least 1/n, regardless of any potential manipulation by an adversary overseeing the remaining n − 1 participants. This means that engaging in dishonest practices does not boost an adversary's likelihood of success, even if they have influence over all participants except one.Problems similar to the leader election problem can be solved with a modified PureLottery protocol. These problems include a ranking of all participants, electing multiple leaders simultaneously, and leader aversion. The PureLottery protocol has multiple applications in different fields. It can be easily implemented in smart contract applications like lotteries. Moreover, it can be utilized in blockchain and distributed systems protocols. An open-source implementation of PureLottery is provided, dedicated to the public domain.

show abstract