{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:59:55Z","timestamp":1773331195843,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642035487","type":"print"},{"value":"9783642035494","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03549-4_20","type":"book-chapter","created":{"date-parts":[[2009,7,16]],"date-time":"2009-07-16T06:05:28Z","timestamp":1247724328000},"page":"325-343","source":"Crossref","is-referenced-by-count":317,"title":["Secure Multiparty Computation Goes Live"],"prefix":"10.1007","author":[{"given":"Peter","family":"Bogetoft","sequence":"first","affiliation":[]},{"given":"Dan Lund","family":"Christensen","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Geisler","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Jakobsen","sequence":"additional","affiliation":[]},{"given":"Mikkel","family":"Kr\u00f8igaard","sequence":"additional","affiliation":[]},{"given":"Janus Dam","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Kurt","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Pagter","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Schwartzbach","sequence":"additional","affiliation":[]},{"given":"Tomas","family":"Toft","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11889663_10","volume-title":"Financial Cryptography and Data Security","author":"P. Bogetoft","year":"2006","unstructured":"Bogetoft, P., Damg\u00e5rd, 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.\u00a04107, pp. 142\u2013147. Springer, Heidelberg (2006)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bogetoft, P., Boye, K., Neergaard-Petersen, H., Nielsen, K.: Reallocating sugar beet contracts: Can sugar production survive in Denmark? European Review of Agricultural Economics\u00a0(34), 1\u201320 (2007)","DOI":"10.1093\/erae\/jbm002"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: Proc. ACM STOC 1988, pp, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/3-540-69053-0_9","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A Secure and Optimally Efficient Multi-Authority Election Scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 103\u2013118. Springer, Heidelberg (1997)"},{"key":"20_CR5","unstructured":"Canetti, R.: Universally Composable Security, The ePrint archive, www.iacr.org"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.: Multiparty Computation, an Introduction. In: Contemporary Cryptology, Advanced courses in Mathematics CRM Barcelona. Birkh\u00e4user, Basel","DOI":"10.1007\/3-7643-7394-6_2"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multi-Party Unconditionally Secure Protocols. In: Proc. of ACM STOC 1998, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: Multiparty Computations from Any Linear Secret Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-48910-X_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Cramer","year":"1999","unstructured":"Cramer, R., Damg\u00e5rd, I., Dziembowski, S., Hirt, M., Rabin, T.: Efficient Multiparty Computations With Dishonest Minority. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 311. Springer, Heidelberg (1999)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Dasgupta, P., Hammond, P., Maskin, E.: The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility. Review of Economic Studies\u00a046, 27\u201342 (1979)","DOI":"10.2307\/2297045"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I.B. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I.B., Nielsen, J.B.: Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 247\u2013264. Springer, Heidelberg (2003)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A Generalisation, a Simplification and Some Applications of Paillier\u2019s Probabilistic Public-Key System. In: Public Key Cryptography 2001, pp. 119\u2013136 (2001)","DOI":"10.1007\/3-540-44586-2_9"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I.B. Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, 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.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-72540-4_24","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"I. Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Thorbek, R.: Non-Interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 412\u2013429. Springer, Heidelberg (2007)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Gibbard, A.: Manipulation of Voting Schemes: A General Result. Econometrica\u00a041, 587\u2013601 (1973)","DOI":"10.2307\/1914083"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/277697.277716"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in General Multiparty Computations. In: Proc. ACM PODC 1997, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Myerson, R.B.: Incentives Compatibility and the Bargaining Problem. Econometrica\u00a047, 61\u201373 (1979)","DOI":"10.2307\/1912346"},{"key":"20_CR20","volume-title":"Proceedings of Programming Languages and Security (PLAS)","author":"J.D. Nielsen","year":"2007","unstructured":"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)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multiparty Protocols with Honest majority. In: Proc. ACM STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03549-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:20:01Z","timestamp":1558434001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03549-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642035487","9783642035494"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03549-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}