Signature schemes based on the strong RSA assumption
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Fair e-Lotteries and e-Casinos
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Playing Lottery on the Internet
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Publicly Verifiable Lotteries: Applications of Delaying Functions
FC '98 Proceedings of the Second International Conference on Financial Cryptography
An Untraceable Electronic Cash System Using Fair Blind Signatures
ICEBE '06 Proceedings of the IEEE International Conference on e-Business Engineering
Practical electronic lotteries with offline TTP
Computer Communications
Blinding for unanticipated signatures
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
The research and design of an applied electronic lottery system
ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
| Hi-index | 0.00 |
The explosive development of network technology makes playing lotteries on the Internet become a billion-dollar industry now. This article presents an electronic t-out-of-n lottery game based on Chinese Remainder Theorem on the Internet. It is proved that this new method can achieve the general requirements of common electronic lottery mechanisms. Specifically, it allows lottery players to simultaneously select t out of n numbers in a ticket without iterative selection. And, this functionality makes the new method possible to be applied in practice. The security of the novel scheme is based on the secure one-way hash function and the factorization problem in RSA cryptosystems.