Skip to main content
SpringerLink
Log in

An Equitably Fair On-line Auction Scheme

  • Conference paper
  • First Online:
Electronic Commerce and Web Technologies (EC-Web 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1875))

Included in the following conference series:

  • 824 Accesses

Abstract

We present a sealed-bid electronic auction scheme that is equitably fair for the bidders and the seller. In this scheme, the interests of both the bidders and the seller are safeguarded: the identity of the non-winning bidders and their bidding behavior are protected (anonymity), and the bidders cannot withdraw their bids without being detected (non-repudiation). The scheme fulfills the requirements of a secure auction scheme and is verifiable. It extends the Stubblebine & Syverson auction scheme that is not equitably fair (it does not prevent bid withdrawals). Our scheme employs a Registrar and an Auctioneer for which no special trust assumptions are made.

Research Supported by the Secreatariat of Research and Technology of Greece

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asokan, N., Shoup, V., Waidner, M.: Asynchronous Protocols for Optimistic Fair Exchange. In: Proceedings of 1998 IEEE Symposium on Security and Privacy. IEEE CS Press (1998) 86–99

    Google Scholar 

  2. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computing. In: 20th Annual ACM Symposium on Theory of Computing. ACM (1988) 1–10

    Google Scholar 

  3. Boneh, D., Franklin, M.: Efficient Generation of RSA keys. In: Advances in Cryptology-CRYPTO 97, Lecture Notes in Computer Science, Vol. 1233. Springer-Verlag (1997) 425–439

    Chapter  Google Scholar 

  4. Burmester, M., Desmedt, Y., Seberry, J.: Equitable Key Escrow with Limited Time Span (or How to Enforce Time Expiration Cryptographically). In: Advances in Cryptology-ASIACRYPT’ 98, Lecture Notes in Computer Science, Vol. 1514. Springer-Verlag (1998) 380–391

    Chapter  Google Scholar 

  5. Camp, J., Harkavy, M., Tygar, K., Yee, B.:Anonymous Atomic Transactions. In: 2nd USENIX Workshop on Electronic Commerce. USENIX Press (1996) 123–133

    Google Scholar 

  6. Certmail: The Certified Electronic Mail System, http://www.certmail.com/

  7. Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Advances in Cryptology — CRYPTO 88, Lecture Notes in Computer Science, Vol. 1440. Springer-Verlag (1988) 319–327

    Google Scholar 

  8. Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, Vol. 1(1), (1988) 65–75

    Article  MATH  MathSciNet  Google Scholar 

  9. Chaum, D.: Security Without Identification: Transaction Systems to Make Big Brother Obsolete. Communications of the ACM, Vol. 28(10), (1985) 1030–1044

    Article  Google Scholar 

  10. Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, Vol. 24(2), (1981) 84–88

    Article  Google Scholar 

  11. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults. In: 26th IEEE Symposium on the Foundations of Computer Science. IEEE Press (1985) 383–395

    Google Scholar 

  12. Cocks, K.: Split Knowledge Generation of RSA Parameters. In: 6th IMA Conference on Cryptography and Coding. Springer-Verlag (1997) 89–95

    Google Scholar 

  13. Community Connexion, Inc., http://www.anonymizer.com

  14. Cottrell, L.: Mixmaster and Remailer Attacks. Available from http://obscura.obscura.com/~loki/remailer/remailer-essay.html

  15. Crampton, P.: Ascending Auctions. European Economic Review, Vol. 42, (1998) 745–756

    Article  Google Scholar 

  16. Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory, Vol. 22(6), (1976) 644–654

    Article  MATH  MathSciNet  Google Scholar 

  17. Franklin, M., Reiter, M.: The Design and Implementation of a Secure Auction Service. IEEE Transactions on Software Engineering, Vol. 22(5), (1996) 302–311

    Article  Google Scholar 

  18. Franklin, M., Reiter, M.: Verifiable Signature Sharing. In: Advances in Cryptology-EUROCRYPT 95, Lecture Notes in Computer Science, Vol. 921. Springer-Verlag (1995) 50–63

    Google Scholar 

  19. Friedman, D., Rust, J.: The Double Auction Market: Institutions, Theories and Evidence. Addison-Wesley, MA (1993)

    Google Scholar 

  20. Goldschlag, D., Reed, M., Syverson, P.: Onion Routing for Anonymous and Private Communications. Communications of the ACM, Vol. 42(2), (1999) 39–41

    Article  Google Scholar 

  21. Harkavy, M., Kikuchi, H., Tygar, J.: Electronic Auctions with Private Bids. In: 3rd USENIX Workshop on Electronic Commerce. USENIX Press (1998) 61–74

    Google Scholar 

  22. Harkavy, M., Kikuchi, H., Tygar, J.: Multi-Round Anonymous Auction Protocols. In: 1st IEEE Workshop on Dependable and Real-Time E-Commerce Systems (DARE 99). IEEE Press (1999) 62–69

    Google Scholar 

  23. Kilian, J., Petrank, E.: Identity Escrow. In:Advances in Cryptology-CRYPTO 98, Lecture Notes in Computer Science, Vol. 1462. Springer-Verlag (1998) 169–185

    Chapter  Google Scholar 

  24. Klemperer, P.: Auction Theory: A Guide to the Literature. Journal of Economic Surveys, Vol. 13, (1999) at http://econwpa.wustl.edu:8089/eps/mic/papers/9903/9903002.pdf

  25. Kumar, M., Feldman, S.: Internet Auctions. In: 3rd USENIX Workshop on Electronic Commerce. USENIX Press (1998) 49–60

    Google Scholar 

  26. The Lucent Personalized Web Assistant. Available from http://lpwa.com

  27. McCabe, K., Rassenti, S., Smith, V.: Auction Institutional Design: Theory and Behavior of Simultaneous Multiple-Unit Generalizations of the Dutch and English Auctions. American Economic Review, Vol. 80(5), (1990) 1276–1283

    Google Scholar 

  28. Reiter, M., Rubin, A.: Crowds, Anonymity for Web Transactions. DIMACS Technical Report 97-15, (1997) available from http://www.research.att.com/projects/crowds/

  29. Rivest, R., Shamir, A., Wagner, D.: Time-Lock Puzzles and Timed-Release Crypto. LCS Tech. Memo MIT/LCS/TR-684, (1996) available from http://theory.lcs.mit.edu/~rivest/RivestShamirWagner-timelock.ps

  30. Schneier, B.: Applied Cryptography, Second Edition: Protocols, Algorithm and Source Code in C. John Wiley and Sons (1996)

    Google Scholar 

  31. Shamir, A.: How to Share a Secret. Communications of the ACM, Vol. 22(11), (1979) 612–613

    Article  MATH  MathSciNet  Google Scholar 

  32. Stajano, F., Anderson, R.: The Cocaine Auction Protocol: On the Power of Anonymous Broadcast. In: 3rd International Workshop on Information Hiding. Lecture Notes in Computer Science, Vol. 1768. Springer-Verlag (1999) 434–448

    Chapter  Google Scholar 

  33. Stubblebine, S., Syverson, P.: Fair On-line Auctions Without Special Trusted Parties. In: Financial Cryptography 99, Lecture Notes in Computer Science, Vol. 1468. Springer-Verlag (1999) 231–241

    Google Scholar 

  34. Surety Technologies, Inc., http://www.e-timestamp.com/

  35. Ungar, L., Parkes, D., Foster, D.: Cost and Trust Issues in On-line Auctions. In: Agents-98 Workshop on Agent-Mediated Electronic Trading, Minneapolis. MN (1998) 161–172

    Google Scholar 

  36. Vickrey, W.: Counterspeculation, Auctions, and Competitive Sealed Tenders. Journal of Finance, Vol. 16(8), (1961) 8–37

    Article  Google Scholar 

  37. Wellman, M., Wurman, P.: Real time Issues for Internet Auctions. In: 1st IEEE Workshop DARE 98, (1998) available from http://ftp.eecs.umich.edu/people/wellman/dare98.ps

  38. You, C., Zhou, J., Lam, K.: On the Efficient Implementation of Fair Non-Repudiation. In: Proceedings of the 1997 IEEE Computer Security Foundations Workshop. IEEE CS Press (1997) 126–132

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Pireaus, Greece

    Emmanouil Magkos, Mike Burmester & Vassilios Chrissikopoulos

  2. Information Security Group, Royal Holloway, University of London, UK

    Mike Burmester

Authors
  1. Emmanouil Magkos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mike Burmester
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vassilios Chrissikopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IFI, University of Zürich, Winterthurer Str. 190, 8057, Zürich, Switzerland

    Kurt Bauknecht

  2. Department of Computer Science, Purdue University, West Lafayette, IN, 47907, USA

    Sanjay Kumar Madria

  3. Department of Information Systems, University of Essen, Universitätsstr. 9, 45141, Essen, Germany

    Günther Pernul

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Magkos, E., Burmester, M., Chrissikopoulos, V. (2000). An Equitably Fair On-line Auction Scheme. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds) Electronic Commerce and Web Technologies. EC-Web 2000. Lecture Notes in Computer Science, vol 1875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44463-7_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44463-7_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67981-3

  • Online ISBN: 978-3-540-44463-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation