An anonymous and secure continuous double auction scheme
Trevathan, Jarrod, Ghodosi, Hossien, and Read, Wayne (2006) An anonymous and secure continuous double auction scheme. Proceedings of the 39th Annual Hawaii International Conference on System Sciences. 39th Annual Hawaii International Conference on System Sciences , 4-7 January 2006, Kauai, Hawaii .
|PDF (Published Version) - Repository staff only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
View at Publisher Website: http://dx.doi.org/10.1109/HICSS.2006.45
A Continuous Double Auction (CDA) allows many buyers and sellers to continuously submit bids for the purchase and sale of a commodity (e.g., online share trading). Protocols protecting privacy in this type of powerful market mechanism are essential. However, until recently the security of CDAs has been given limited coverage. This paper describes a new scheme for conducting an anonymous and secure CDA. We show that any existing secure group signature scheme can be used to implement a CDA which has the following characteristics: unforgeability, anonymity, unlinkability, exculpability, coalition-resistance, verifiability, robustness and traceability. Furthermore, bidders can be added to and removed from the auction without affecting the process of the auction. Our scheme is more flexible than the only existing secure CDA scheme, which in contrast provides only a limited subset of these characteristics.
|Item Type:||Conference Item (Refereed Research Paper - E1)|
|Keywords:||security in electronic auction; double action|
|SEO Codes:||89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%|
|Deposited On:||11 Sep 2009 16:49|
|Last Modified:||02 Nov 2012 09:14|
Last 12 Months: 0
|Citation Counts with External Providers:|
Repository Staff Only: item control page