SECURE ONLINE ENGLISH AUCTIONS

Jarrod Trevathan, Wayne Read

Abstract

Security and privacy in online auctions is a major concern as auction participants have many opportunities to cheat (e.g., repudiate bids, not deliver items, etc.). Online auctions such as those used by eBay are based on a type of auction referred to as an English auction. Dispite the English auction being the most popular type of auction, it has received less security coverage than other types of auctions (e.g., sealed-bid auctions). An existing proposal for a “secure” English auction prevents the Auctioneer from closing the auction early and from blocking bids, but does not protect a bidder’s anonymity. Another proposal provides anonymity, but does not stop an Auctioneer from skewing its clock or blocking bids. This paper proposes a new scheme for conducting secure and anonymous online English auctions using a modified type of group signature. Trust is divided among three servers owned by separate companies to ensure anonymity and fairness. Our scheme solves the problems of the existing English auction schemes and has following characteristics: unforgeability, anonymity, unlinkability, exculpability, coalition-resistance, verifiability, robustness, traceability, revocation, one-off registration, unskewability and unblockability. Our scheme has comparable efficiency to the existing schemes for the enhanced security and privacy it provides.

References

  1. Ateniese, G., Camenisch, J., Joye, M. and Tsudik, G. (2000). A practical and provably secure coalition secure coalition-resistant group signature scheme in Advances in Cryptology - Proceedings of CRYPTO 2000, vol. 1880 of Lecture Notes in Computer Science, Springer-Verlag, 255-270.
  2. Ateniese, G., Song, D. and Tsudik, G. (2002). QuasiEfficient Revocation of Group Signatures, in Proceedings of Financial Cryptography, vol. 2357 of Lecture Notes in Computer Science, Springer-Verlag, 183- 197.
  3. Boyd, C. and Mao, W. (2000). Security Issues for Electronic Auctions, Technical Report, Hewlett Packard, TR-HPL-2000-90.
  4. Camenisch, J. and Lysyanskaya, A. (2002). Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials, in Advances in Cryptology - Proceedings of CRYPTO 2002, vol. 2442 of Lecture Notes in Computer Science, Springer-Verlag, 61-76.
  5. Camenisch, J. and Stadler, M. (1997). Efficient Group Signature Scheme for Large Groups, in Advances in Cryptology - Proceedings of CRYPTO 7897, vol. 1294 of Lecture Notes in Computer Science, SpringerVerlag, 410-424.
  6. Chaum, D. and van Heyst, E. (1991). Group Signatures, in Advances in Cryptology - Proceedings of EUROCRYPT'91, vol. 547 of Lecture Notes in Computer Science, Springer-Verlag, 257-265.
  7. Franklin, M. and Reiter, M. (1996). The Design and Implementation of a Secure Auction Service, IEEE Transactions on Software Engineering, vol. 22, 302-312.
  8. Kumar, M. and Feldman, S. (1998). Internet Auctions, in Proceedings of the Third USENIX Workshop on Electronic Commerce, 49-60.
  9. Lee, B., Kim, K. and Ma, J. (2001). Efficient Public Auction with One-time Registration and Public Verifiability, in International Conference on Cryptology in India - Proceedings of INDOCRYPT 2001, vol. 2247 of Lecture Notes in Computer Science, Springer-Verlag, 162-174.
  10. Naor, M., Pinkas, B. and Sumner, R. (1999). Privacy Preserving Auctions and Mechanism Design, in The 1st ACM Conference on Electronic Commerce, 129-139.
  11. Nguyen, K. and Traore, J. (2000). An On-line Public Auction Protocol Protecting Bidder Privacy, in Proceedings of ACSIP 2000 - Australasian Conference on Information Security and Privacy, vol. 1841 of Lecture Notes in Computer Science, Springer-Verlag, 427- 442.
  12. Omote, K. and Miyaji, A. (2001). A Practical English Auction with One-Time Registration, in Proceedings of ACSIP 2001 - Australasian Conference on Information Security and Privacy, vol. 2119 of Lecture Notes in Computer Science, Springer-Verlag, 221-234.
  13. Stubblebine, S. and Syverson, P. (1999). Fair On-line Auctions Without Special Trusted Parties, in Proceedings of Financial Cryptography 1999, vol. 1648 of Lecture Notes in Computer Science, Springer-Verlag, 230-240.
  14. Tsudik, G. and Xu, S. (2003). Accumulating Composites and Improved Group Signing, in Advances in Cryptology - Proceedings of ASIACRYPT 2003, vol. 2894 of Lecture Notes in Computer Science, Springer-Verlag, 269-286.
  15. Trevathan, J. (2005). Security, Anonymity and Trust in Electronic Auctions, Association for Computing Machinery Crossroads, Spring Edition, 3-9, vol. 11.3.
  16. Trevathan, J., Ghodosi, H. and Read, W. (2005). Design Issues for Electronic Auctions, in 2nd International Conference on E-Business and Telecommunication Networks, 340-347.
  17. Trevathan, J., Ghodosi, H. and Read, W. (2006). An Anonymous and Secure Continuous Double Auction Scheme, in 39th International Hawaii Conference on System Sciences, 125(1-12).
  18. Viswanathan, K., Boyd, C. and Dawson, E. (2000). A Three Phased Schema for Sealed Bid Auction System Design, Proceedings of ACSIP 2000 - Australasian Conference on Information Security and Privacy, vol. 1841 of Lecture Notes in Computer Science, SpringerVerlag, 412-426.
Download


Paper Citation


in Harvard Style

Trevathan J. and Read W. (2006). SECURE ONLINE ENGLISH AUCTIONS . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006) ISBN 978-972-8865-63-4, pages 387-396. DOI: 10.5220/0002096603870396


in Bibtex Style

@conference{secrypt06,
author={Jarrod Trevathan and Wayne Read},
title={SECURE ONLINE ENGLISH AUCTIONS},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)},
year={2006},
pages={387-396},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002096603870396},
isbn={978-972-8865-63-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2006)
TI - SECURE ONLINE ENGLISH AUCTIONS
SN - 978-972-8865-63-4
AU - Trevathan J.
AU - Read W.
PY - 2006
SP - 387
EP - 396
DO - 10.5220/0002096603870396