Enhanced anonymous auction protocols with freewheeling bids

In 2003, Chang and Chang proposed three efficient anonymous auction protocols. Later, Jiang et al., claimed that the initiation of their protocols would result in a security drawback and also presented an improvement. After taking this security drawback and computation efficiency into consideration, we propose the efficient anonymous auction protocols in this article.

[1]  Atsuko Miyaji,et al.  A Practical English Auction with One-Time Registration , 2001, ACISP.

[2]  Chin-Chen Chang,et al.  Efficient anonymous auction protocols with freewheeling bids , 2003, Comput. Secur..

[3]  Chris Xu,et al.  Deniable authentication protocol based on Deffie-Hellman algorithm , 2002 .

[4]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[5]  Michiharu Kudo,et al.  Secure Electronic Sealed-Bid Auction Protocol with Public Key Cryptography (Special Section on Cryptography and Information Security) , 1998 .

[6]  Jianhua Li,et al.  An improvement on efficient anonymous auction protocols , 2005, Comput. Secur..

[7]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[8]  Hiroaki Kikuchi,et al.  Multi-round Anonymous Auction Protocols , 1999 .

[9]  Matthew K. Franklin,et al.  The design and implementation of a secure auction service , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

[10]  Xiaotie Deng,et al.  Deniable authentication protocols , 2001 .

[11]  Koutarou Suzuki,et al.  Efficient Sealed-Bid Auction by Using One-Way Functions , 2001 .

[12]  Xu Chongxiang.  Deniable Authentication Protocol Based on Diffie-Hellman Algorithm , 2002 .

[13]  Kazue Sako,et al.  An Auction Protocol Which Hides Bids of Losers , 2000, Public Key Cryptography.

[14]  Atsuko Miyaji,et al.  An Anonymous Sealed-bid Auction with a Feature of Entertainment , 2001 .