Advertisement

Efficient Implementation and Computational Analysis of Privacy-Preserving Auction Protocols

  • Ramiro Alvarez
  • Mehrdad NojoumianEmail author
Conference paper
  • 84 Downloads
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 1129)

Abstract

Auctions are a key economic mechanism for establishing the value of goods that have an uncertain price. Nowadays, as a consequence of the ubiquitous emergence of technology, auctions can reach consumers, and as a result, drive market prices on a global scale. Collection of private information such as losing bids exposes more information than desired. In fact, the leaked information can be analyzed to provide auctioneers or competitors with advantages on future transactions. Therefore, the need to preserve privacy has become a critical concern to reach an accepted level of fairness and to provide market participants with an environment in which they can bid true valuations. This paper focuses on constructions of sealed-bid auctions based on cryptographic protocols. Instead of solely focusing on theoretical aspects of sealed-bid auctions, this paper dives into implementation details and demonstrates communication and computational analysis and how different settings affect performance.

Keywords

Sealed-bid auctions Privacy-preserving protocols Complexity 

Notes

Acknowledgments

We gratefully acknowledge our research sponsors, College of Engineering and Computer Science (COECS) and Institute for Sensing and Embedded Network Systems Engineering (I-SENSE) at FAU, for making this research work possible.

References

  1. 1.
    Abe, M., Suzuki, K.: M+ 1-st price auction using homomorphic encryption. In: International Workshop on Public Key Cryptography, pp. 115–124. Springer (2002)Google Scholar
  2. 2.
    Alvarez, R., Nojoumian, M.: Comprehensive survey on privacy-preserving protocols for sealed-bid auctions. Comput. Secur. (C&S) 88, 101502–101515 (2020)CrossRefGoogle Scholar
  3. 3.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing. pp. 1–10. ACM (1988)Google Scholar
  4. 4.
    Boyar, J., Chaum, D., Damgård, I., Pedersen, T.: Convertible undeniable signatures. In: Conference on the Theory and Application of Cryptography, pp. 189–205. Springer (1990)Google Scholar
  5. 5.
    Brandt, F.: A verifiable, bidder-resolved auction protocol. In: Proceedings of the 5th International Workshop on Deception, Fraud and Trust in Agent Societies, SI on Privacy and Protection with Multi-Agent Systems, pp. 18–25 (2002)Google Scholar
  6. 6.
    Cachin, C.: Efficient private bidding and auctions with an oblivious third party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 120–127. ACM (1999)Google Scholar
  7. 7.
    Franklin, M.K., Reiter, M.K.: Verifiable signature sharing. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 50–63. Springer (1995)Google Scholar
  8. 8.
    Franklin, M.K., Reiter, M.K.: The design and implementation of a secure auction service. IEEE Trans. Softw. Eng. 22(5), 302–312 (1996)CrossRefGoogle Scholar
  9. 9.
    Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: IJCAI, vol. 99, pp. 548–553. DTIC Document (1999)Google Scholar
  10. 10.
    Juels, A., Szydlo, M.: A two-server, sealed-bid auction protocol. In: International Conference on Financial Cryptography, pp. 72–86. Springer (2002)Google Scholar
  11. 11.
    Kikuchi, H.: (m+1) st-price auction protocol. IEICE Trans. Fundam. Electron. Commun. Comput. 85(3), 676–683 (2002)zbMATHGoogle Scholar
  12. 12.
    Kikuchi, H., Hakavy, M., Tygar, D.: Multi-round anonymous auction protocols. IEICE Trans. Inf. Syst. 82(4), 769–777 (1999)Google Scholar
  13. 13.
    Kikuchi, H., Hotta, S., Abe, K., Nakanishi, S.: Distributed auction servers resolving winner and winning bid without revealing privacy of bids. In: 7th International Conference on Parallel and Distributed Systems, pp. 307–312. IEEE (2000)Google Scholar
  14. 14.
    Krishnamachari, S., Nojoumian, M., Akkaya, K.: Implementation and analysis of Dutch-style sealed-bid auctions: computational vs unconditional security. In: 1st International Conference on Information Systems Security and Privacy, pp. 106–113 (2015)Google Scholar
  15. 15.
    Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: International Conference on Financial Cryptography, pp. 87–101. Springer (2002)Google Scholar
  16. 16.
    Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: Proceedings of the 1st ACM Conference on Electronic Commerce, pp. 129–139. ACM (1999)Google Scholar
  17. 17.
    Nojoumian, M.: Novel secret sharing and commitment schemes for cryptographic applications. Ph.D. thesis, Department of Computer Science, University of Waterloo, Canada (2012)Google Scholar
  18. 18.
    Nojoumian, M., Stinson, D.R.: Unconditionally secure first-price auction protocols using a multicomponent commitment scheme. In: 12th International Conference on Information and Communications Security. LNCS, vol. 6476, pp. 266–280. Springer (2010)Google Scholar
  19. 19.
    Nojoumian, M., Stinson, D.R.: Efficient sealed-bid auction protocols using verifiable secret sharing. In: 10th International Conference on Information Security Practice and Experience. LNCS, vol. 8434, pp. 302–317. Springer (2014)Google Scholar
  20. 20.
    Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing (1998)Google Scholar
  21. 21.
    Peng, K., Boyd, C., Dawson, E., Viswanathan, K.: Robust, privacy protecting and publicly verifiable sealed-bid auction. In: International Conference on Information and Communications Security, pp. 147–159. Springer (2002)Google Scholar
  22. 22.
    Rothkopf, M.H., Pekeč, A., Harstad, R.M.: Computationally manageable combinational auctions. Manag. Sci. 44(8), 1131–1147 (1998)CrossRefGoogle Scholar
  23. 23.
    Sako, K.: An auction protocol which hides bids of losers. In: International Workshop on Public Key Cryptography, pp. 422–432. Springer (2000)Google Scholar
  24. 24.
    Sakurai, K., Miyazaki, S.: A bulletin-board based digital auction scheme with bidding down strategy-towards anonymous electronic bidding without anonymous channels nor trusted centers. In: Proceedings of International Workshop on Cryptographic Techniques and E-Commerce, pp. 180–187 (1999)Google Scholar
  25. 25.
    Sakurai, Y., Yokoo, M., Kamei, K.: An efficient approximate algorithm for winner determination in combinatorial auctions. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 30–37. ACM (2000)Google Scholar
  26. 26.
    Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135(1–2), 1–54 (2002)MathSciNetCrossRefGoogle Scholar
  27. 27.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefGoogle Scholar
  28. 28.
    Suzuki, K., Yokoo, M.: Secure multi-attribute procurement auction. In: International Workshop on Information Security Applications, pp. 306–317. Springer (2005)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Computer and Electrical Engineering and Computer ScienceFlorida Atlantic UniversityBoca RatonUSA

Personalised recommendations