An efficient proxy raffle protocol with anonymity-preserving

Authors:
Chin-Chen Chang;Ting-Fang Cheng
Affiliations:
Department of Information Engineering and Computer Science, Feng Chia University, Taichung, Taiwan, 40724, ROC;Department of Information Engineering and Computer Science, Feng Chia University, Taichung, Taiwan, 40724, ROC
Venue:
Computer Standards & Interfaces
Year:
2009

Citing 8
Cited 0

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C

Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
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
The Design of Rijndael

The Design of Rijndael
Playing Lottery on the Internet

ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Analysis of the SSL 3.0 protocol

WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Design of a fair proxy raffle protocol on the Internet

Computer Standards & Interfaces
New directions in cryptography

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 2005, Chen et al. implemented a proxy raffle scheme for the Internet. Unfortunately, their scheme is unable to withstand Denial of Service (DoS) and impersonation attacks. We consequently propose a novel version of this scheme, in this paper, which can resist these malicious attacks. The security of our scheme is based on symmetric and asymmetric cryptosystems. A timestamp mechanism is also applied to prevent suffering the replay attack. Specifically, the communication load of our scheme is less than that of Chen et al.'s scheme. Thus, we can implement our method for the Internet as well as mobile devices.