An Efficient Proxy Raffle Protocol with Anonymity-Preserving

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/6331

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/6331

Title:	An Efficient Proxy Raffle Protocol with Anonymity-Preserving
Authors:	Chang, C. C.;Cheng, T. F.
Keywords:	Fairness;Raffle;Anonymity;Diffie-Hellman;DoS attack
Date:	2009-06
Issue Date:	2009-12-17 06:57:22 (UTC+0)
Publisher:	Asia University
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.
Relation:	Computer Standards & Interfaces 31(4):772-778
Appears in Collections:	[Department of Computer Science and Information Engineering] Journal Artical

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	646	View/Open
310904400-6331.doc		31Kb	Microsoft Word	234	View/Open