Analysis of one round anonymous auction protocol

Author

Chuan Siong, Tham ; Yu Cheng, Chang ; Wei Shean, Ng

Author_Institution

Fac. of Inf. Commun. Technol., Univ. Tunku Abdul Rahman, Kampar

fYear

2008

fDate

13-15 May 2008

Firstpage

57

Lastpage

61

Abstract

Auctions have become a major phenomenon of electronic commerce. A lot of papers are published to enhance the security of auctions. But how do author handle tie-breaking in sealed-bid auctions? One round auction protocol [5] makes use of super increasing sequence algorithm to find out the tie bidders and compare among their time stamp to solve the tie. This paper analyzes the significance of one round anonymous auction in various desired properties of sealed bid auction. Author performs comparison over the multi-round [1] [3] and one round anonymous auction protocol in various desired properties and various possible attacks may happen.

Keywords

cryptography; electronic commerce; pricing; protocols; auction security; electronic commerce; one round anonymous auction protocol; price flexibility; sealed-bid auction; sequence algorithm; tie-breaking handling; Aggregates; Communications technology; Computer architecture; Cryptography; Electronic commerce; Information analysis; Information security; Privacy; Protocols; Robustness;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer and Communication Engineering, 2008. ICCCE 2008. International Conference on

Conference_Location

Kuala Lumpur

Print_ISBN

978-1-4244-1691-2

Electronic_ISBN

978-1-4244-1692-9

Type

conf

DOI

10.1109/ICCCE.2008.4580568

Filename

4580568