{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:30:48Z","timestamp":1743129048003,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642279539"},{"type":"electronic","value":"9783642279546"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27954-6_18","type":"book-chapter","created":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T14:23:15Z","timestamp":1329920595000},"page":"278-295","source":"Crossref","is-referenced-by-count":1,"title":["Secure Computation, I\/O-Efficient Algorithms and Distributed Signatures"],"prefix":"10.1007","author":[{"given":"Ivan","family":"Damg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonas","family":"K\u00f6lker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Toft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, S., Jeffrey: The input\/output complexity of sorting and related problems. Commun. ACM\u00a031, 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"18_CR2","first-page":"307","volume-title":"Proceedings of the Spring Joint Computer Conference, AFIPS 1968","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the Spring Joint Computer Conference, AFIPS 1968, April 30-May 2, pp. 307\u2013314. ACM, New York (1968)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z. Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-Secure MPC with Linear Communication Complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 213\u2013230. Springer, Heidelberg (2008)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/62212.62213","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"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, STOC 1988, pp. 1\u201310. ACM, New York (1988)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"G.R. Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of Ramp Schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000\/067, (2000), http:\/\/eprint.iacr.org\/","DOI":"10.1109\/SFCS.2001.959888"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-72540-4_19","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Cramer","year":"2007","unstructured":"Cramer, R., Damg\u00e5rd, I.B., de Haan, R.: Atomic Secure Multi-Party Multiplication with Low Communication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 329\u2013346. Springer, Heidelberg (2007)"},{"key":"18_CR8","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":"18_CR9","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., K\u00f6lker, J., Toft, T.: Secure computation, i\/o-efficient algorithms and distributed signatures. Cryptology ePrint Archive (2011), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-27954-6_18"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427\u2013437 (1987)","DOI":"10.1109\/SFCS.1987.4"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/1146381.1146407","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006","author":"M. Fitzi","year":"2006","unstructured":"Fitzi, M., Hirt, M.: Optimally efficient multi-valued byzantine agreement. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 163\u2013168. ACM, New York (2006)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1145\/129712.129780","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992","author":"M. Franklin","year":"1992","unstructured":"Franklin, M., Yung, M.: Communication complexity of secure computation (extended abstract). In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, STOC 1992, pp. 699\u2013710. ACM, New York (1992)"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S. Goldwasser","year":"2005","unstructured":"Goldwasser, S., Lindell, Y.: Secure multi-party computation without agreement. J. Cryptology\u00a018(3), 247\u2013287 (2005)","journal-title":"J. Cryptology"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Randomized shellsort: A simple oblivious sorting algorithm. In: SODA, pp. 1262\u20131277 (2010)","DOI":"10.1137\/1.9781611973075.101"},{"key":"18_CR15","unstructured":"Goodrich, M.T., Mitzenmacher, M.: Mapreduce parallel cuckoo hashing and oblivious ram simulations. CoRR, abs\/1007.1259 (2010)"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1145\/1081870.1081942","volume-title":"Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005","author":"G. Jagannathan","year":"2005","unstructured":"Jagannathan, G., Wright, R.N.: Privacy-preserving distributed k-means clustering over arbitrarily partitioned data. In: Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD 2005, pp. 593\u2013599. ACM, New York (2005)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"Y. Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy Preserving Data Mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 36\u201354. Springer, Heidelberg (2000)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"18_CR19","volume-title":"Shellsort and Sorting Networks. Outstanding Dissertations in the Computer Sciences","author":"V.R. Pratt","year":"1972","unstructured":"Pratt, V.R.: Shellsort and Sorting Networks. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York (1972), http:\/\/www.inf.fh-flensburg.de\/lang\/algorithmen\/sortieren\/shell\/shellen.htm"},{"issue":"3","key":"18_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.-P. Schnorr","year":"1991","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"18_CR22","unstructured":"Toft, T.: Secure datastructures based on multiparty computation. Cryptology ePrint Archive, Report 2011\/081 (2011), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27954-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T10:50:53Z","timestamp":1640861453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27954-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642279539","9783642279546"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27954-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}