{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T14:32:00Z","timestamp":1791037920171,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327318","type":"print"},{"value":"9783540327325","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11681878_15","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T02:41:35Z","timestamp":1141094495000},"page":"285-304","source":"Crossref","is-referenced-by-count":285,"title":["Unconditionally Secure Constant-Rounds Multi-party Computation for Equality, Comparison, Bits and Exponentiation"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Fitzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eike","family":"Kiltz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper Buus","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomas","family":"Toft","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"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.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: Proc. ACM PODC 1989, pp. 201\u2013209 (1989)","DOI":"10.1145\/72981.72995"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45539-6_23","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"D. Beaver","year":"2000","unstructured":"Beaver, D.: Minimal latency secure function evaluation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 335\u2013350. Springer, Heidelberg (2000)"},{"key":"15_CR4","first-page":"136","volume-title":"42nd Annual Symposium on Foundations of Computer Science","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, October 14\u201317, pp. 136\u2013145. IEEE, Los Alamitos (2001)"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secure distributed linear algebra in a constant number of rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"15_CR6","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.: General secure multiparty computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BFb0036901","volume-title":"Proceedings of ICALP 1983","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Fortune, S., Lipton, R.J.: Lower bounds for constant depth circuits for prefix problems. In: Proceedings of ICALP 1983. LNCS, vol.\u00a0154, pp. 109\u2013117. Springer-Verlag, Heidelberg (1983)"},{"key":"15_CR8","first-page":"52","volume-title":"15th Annual ACM Symposium on Theory of Computing","author":"A.K. Chandra","year":"1983","unstructured":"Chandra, A.K., Fortune, S., Lipton, R.J.: Unbounded fanin circuits and associative functions. In: 15th Annual ACM Symposium on Theory of Computing, Boston, Massachusetts, USA, April 25\u2013 27, pp. 52\u201360. ACM Press, New York (1983)"},{"key":"15_CR9","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. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., 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":"15_CR10","doi-asserted-by":"crossref","unstructured":"Feige, U., Kilian, J., Naor, M.: A minimal model for secure computation. In: Proc. ACM STOC, pp. 554\u2013563 (1994)","DOI":"10.1145\/195058.195408"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E.: Private simultaneous messages protocols with applications. In: Proc. 5th Israel Symposium on Theoretical Comp. Sc. ISTCS, pp. 174\u2013183 (1997)","DOI":"10.1109\/ISTCS.1997.595170"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1109\/SFCS.2000.892118","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"Y. Ishai","year":"2000","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: A new representation with applications to round-efficient secure computation. In: 41st Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, USA, November 12\u201314, pp. 294\u2013304. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-45465-9_22","volume-title":"Automata, Languages and Programming","author":"Y. Ishai","year":"2002","unstructured":"Ishai, Y., Kushilevitz, E.: Perfect constant-round secure computation via perfect randomizing polynomials. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 244\u2013256. Springer, Heidelberg (2002)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","volume-title":"Theory of Cryptography","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Leander, G., Malone-Lee, J.: Secure computation of the mean and related statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 283\u2013302. Springer, Heidelberg (2005)"},{"key":"15_CR15","unstructured":"Nowak, M., Woltman, G., Kurowski, S., et al.: Mersenne.org project discovers new largest known prime number 225,964,951 \u2212 1 (press release)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11681878_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:16:43Z","timestamp":1619493403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11681878_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327318","9783540327325"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11681878_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}