Advertisement

A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation

  • Peter Bogetoft
  • Ivan Damgård
  • Thomas Jakobsen
  • Kurt Nielsen
  • Jakob Pagter
  • Tomas Toft
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4107)

Abstract

In this paper we consider the problem of constructing secure auctions based on techniques from modern cryptography. We combine knowledge from economics, threshold cryptography and security engineering to implement secure auctions for practical real-world problems.

Keywords

Trusted Third Party Cryptographic Protocol Double Auction Supply Scheme Market Clearing Price 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417–432. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. 2.
    Bogetoft, P., Nielsen, K.: Work in progress (2005)Google Scholar
  3. 3.
    Brandt, F.: Cryptographic protocols for secure second-price auctions. In: Klusch, M., Zambonelli, F. (eds.) CIA 2001. LNCS (LNAI), vol. 2182, p. 154. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Brandt, F., Sandholm, T.: Efficient privacy-preserving protocols for multi-unit auctions. In: Patrick, A., Yung, M. (eds.) Proceedings of the 9th International Conference on Financial Cryptography and Data Security (FC). Lecture Notes in Computer Science (LNCS), Springer, Heidelberg (2005)Google Scholar
  5. 5.
    Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols (2005), http://eprint.iacr.org/2000/067
  6. 6.
    Cramer, R., Damgård, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Proceedings of the Second Theory of Cryptography Conference, pp. 342–362 (2005)Google Scholar
  7. 7.
    Damgård, I., Toft, T.: Work in progress (2005)Google Scholar
  8. 8.
    Damgård, I.B., Cramer, R., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280–300. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Feigenbaum, J., Pinkas, B., Ryger, R. S., Jain, F. S.: Secure Computation of Surveys. In: EU Workshop on Secure Multiparty Protocols (2004) Google Scholar
  10. 10.
    Franklin, M., Reiter, M.: The Design and Implementation of a Secure Auction Service. In: Proc. IEEE Symp. on Security and Privacy, Oakland, Ca, pp. 2–14. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
  11. 11.
    From, S.L., Jakobsen, T.: Secure Multi-Party Computation on Integers. Master’s thesis, Department of Computer Science, University of Aarhus. In preparation (2006)Google Scholar
  12. 12.
    Goldreich, O., Micali, S., Wigderson, A.: How to play any mental gamer or a completeness theorem for protocols with honest majority. In: 19th Symp. on Theory of Computing (STOC), pp. 218–229. ACM, New York (1987)Google Scholar
  13. 13.
    Damgård, I., Fitzi, N., Nielsen, J., Toft, T.: How to split a shared secret into shared bits in constant-round. The Eprint archive, nr. 2005/140 (2005), www.iacr.org
  14. 14.
    Klemperer, P.: Auction theory: A guide to the literature. Journal of Economic Survey 13(3), 227–286 (1999)CrossRefGoogle Scholar
  15. 15.
    Lipmaa, H., Asokan, N., Niemi, V.: Secure vickrey auctions without threshold trust. In: Blaze, M. (ed.) FC 2002. LNCS, vol. 2357, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  16. 16.
    Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - A Secure Two-Party Computation System. In: Proceedings of the 13th USENIX Security Symposium, pp. 287–302 (2004)Google Scholar
  17. 17.
    Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: 1st ACM Conf. on Electronic Commerce, pp. 129–139. ACM, New York (1999)CrossRefGoogle Scholar
  18. 18.
    Nautz, D.: Optimal bidding in multi-unit auctions with many bidders. Economics Letters 48, 301–306 (1995)MATHCrossRefGoogle Scholar
  19. 19.
    Shamir, A.: How to share a secret. Communications of the ACM 22(11), 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Toft, T.: Secure integer computation with application in economics. Progress Report, available from author (2005), tomas@daimi.au.dk Google Scholar
  21. 21.
    Wang, C., Leung, H.F., Wang, Y.: Secure double auction protocols with full privacy protection. In: Lim, J.-I., Lee, D.-H. (eds.) ICISC 2003. LNCS, vol. 2971, Springer, Heidelberg (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Peter Bogetoft
    • 1
  • Ivan Damgård
    • 2
  • Thomas Jakobsen
    • 2
  • Kurt Nielsen
    • 1
  • Jakob Pagter
    • 2
  • Tomas Toft
    • 2
  1. 1.Department of EconomicsAgricultural UniversityCopenhagen
  2. 2.Department of Computer ScienceUniversity of Aarhus 

Personalised recommendations