An improved t‐out‐of‐n e‐lottery protocol. (1st April 2013)

• Record Type: Journal Article
• Authors: Liu, Y.; Lin, D.; Cheng, C.; Chen, H.; Jiang, T.
• Is Part Of: International journal of communication systems. Volume 27:Number 11(2014:Nov.)
• Page Start: 3223
• Page End: 3231
• Publication Date: 2013-04-01
• Subjects: Telecommunication systems -- Periodicals; 621.382
• DOI: 10.1002/dac.2536
• Languages: English
• ISSNs: 1074-5351

Abstract

<abstract abstract-type="main" id="dac2536-abs-0001"> <title>SUMMARY</title> <p id="dac2536-para-0006">In 2009, Lee and Chang proposed an electronic <italic>t</italic>‐out‐of‐<italic>n</italic> lottery protocol over the Internet based on the Chinese remainder theorem and blind signature. However, a security flaw exists in Lee–Chang's protocol that the lottery agent and the malicious purchaser can collude to control the winning result, which is unfair for the honest participants. On the basis of a verifiable random number generated by using the Lagrange interpolation formula over a finite field, an improved <italic>t</italic>‐out‐of‐<italic>n</italic> e‐lottery protocol is proposed, which guarantees that each participant can generate the winning result equally. The improved protocol achieves public verifiability and fairness without a trusted third party and a delaying function, which makes it more robust and more efficient. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>