Secure Multiparty Computation Goes Live

  • Peter Bogetoft
  • Dan Lund Christensen
  • Ivan Damgård
  • Martin Geisler
  • Thomas Jakobsen
  • Mikkel Krøigaard
  • Janus Dam Nielsen
  • Jesper Buus Nielsen
  • Kurt Nielsen
  • Jakob Pagter
  • Michael Schwartzbach
  • Tomas Toft
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5628)

Abstract

In this note, we report on the first large-scale and practical application of secure multiparty computation, which took place in January 2008. We also report on the novel cryptographic protocols that were used.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., Toft, T.: A Practical Implementation of Secure Auctions based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142–147. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Bogetoft, P., Boye, K., Neergaard-Petersen, H., Nielsen, K.: Reallocating sugar beet contracts: Can sugar production survive in Denmark? European Review of Agricultural Economics (34), 1–20 (2007)Google Scholar
  3. 3.
    Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. ACM STOC 1988, pp, pp. 1–10 (1988)Google Scholar
  4. 4.
    Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103–118. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  5. 5.
    Canetti, R.: Universally Composable Security, The ePrint archive, www.iacr.org
  6. 6.
    Cramer, R., Damgård, I.: Multiparty Computation, an Introduction. In: Contemporary Cryptology, Advanced courses in Mathematics CRM Barcelona. Birkhäuser, BaselGoogle Scholar
  7. 7.
    Chaum, D., Crépeau, C., Damgård, I.: Multi-Party Unconditionally Secure Protocols. In: Proc. of ACM STOC 1998, pp. 11–19 (1988)Google Scholar
  8. 8.
    Cramer, R., Damgård, I., Maurer, U.: Multiparty Computations from Any Linear Secret Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316–334. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Cramer, R., Damgård, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations With Dishonest Minority. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 311. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  10. 10.
    Dasgupta, P., Hammond, P., Maskin, E.: The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility. Review of Economic Studies 46, 27–42 (1979)Google Scholar
  11. 11.
    Damgård, I.B., Nielsen, J.B.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 247–264. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Damgård, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier’s Probabilistic Public-Key System. In: Public Key Cryptography 2001, pp. 119–136 (2001)Google Scholar
  13. 13.
    Damgård, I.B., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285–304. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  14. 14.
    Damgård, I., Thorbek, R.: Non-Interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412–429. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Gibbard, A.: Manipulation of Voting Schemes: A General Result. Econometrica 41, 587–601 (1973)Google Scholar
  16. 16.
    Goldreich, O., Micali, S., Wigderson, A.: How to Play Any Mental Game or a Completeness Theorem for Protocols with Honest Majority. In: Proc. of ACM STOC 1987, pp. 218–229 (1987)Google Scholar
  17. 17.
    Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and Fast-Track Multiparty Computations with Applications to Threshold Cryptography. In: Proc of ACM PODC 1998 (1998)Google Scholar
  18. 18.
    Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in General Multiparty Computations. In: Proc. ACM PODC 1997, pp. 25–34 (1997)Google Scholar
  19. 19.
    Myerson, R.B.: Incentives Compatibility and the Bargaining Problem. Econometrica 47, 61–73 (1979)Google Scholar
  20. 20.
    Nielsen, J.D., Schwartzbach, M.I.: A domain-specific programming language for secure multipartycomputation. In: Proceedings of Programming Languages and Security (PLAS). ACM Press, New York (2007)Google Scholar
  21. 21.
    Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest majority. In: Proc. ACM STOC 1989, pp. 73–85 (1989)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Peter Bogetoft
    • 3
  • Dan Lund Christensen
    • 4
  • Ivan Damgård
    • 2
  • Martin Geisler
    • 2
  • Thomas Jakobsen
    • 4
  • Mikkel Krøigaard
    • 2
  • Janus Dam Nielsen
    • 2
  • Jesper Buus Nielsen
    • 2
  • Kurt Nielsen
    • 1
  • Jakob Pagter
    • 4
  • Michael Schwartzbach
    • 2
  • Tomas Toft
    • 5
  1. 1.Inst. of Food and Resource EconomicsUniversity of CopenhagenDenmark
  2. 2.Department of Computer ScienceUniversity of AarhusDenmark
  3. 3.Dept. of EconomicsCopenhagen Business SchoolDenmark
  4. 4.The Alexandra InstituteDenmark
  5. 5.CWI Amsterdam and TU/eNetherlands

Personalised recommendations