{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:15:00Z","timestamp":1763507700342},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319475592"},{"type":"electronic","value":"9783319475608"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-47560-8_14","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T00:59:42Z","timestamp":1475888382000},"page":"216-231","source":"Crossref","is-referenced-by-count":6,"title":["Secure Multiparty Sorting Protocols with Covert Privacy"],"prefix":"10.1007","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Pettai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptology 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptology"},{"key":"14_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-662-47854-7_14","volume-title":"Financial Cryptography and Data Security","author":"D Bogdanov","year":"2015","unstructured":"Bogdanov, D., J\u00f5emets, M., Siim, S., Vaht, M.: How the estonian tax and customs board evaluated a tax fraud detection system based on secure multi-party computation. In: B\u00f6hme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 227\u2013234. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47854-7_14"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Kamm, L., Kubo, B., Rebane, R., Sokk, V., Talviste, R.: Students and taxes: a privacy-preserving social study using secure computation. In: Proceedings of Privacy Enhancing Technologies (PoPETS) (2016)","DOI":"10.1515\/popets-2016-0019"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., Laud, P., Laur, S., Pullonen, P.: From input private to universally composable secure multi-party computation primitives. In: CSF 2014, pp. 184\u2013198","DOI":"10.1109\/CSF.2014.21"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-11599-3_4","volume-title":"Secure IT Systems","author":"D Bogdanov","year":"2014","unstructured":"Bogdanov, D., Laur, S., Talviste, R.: A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Bernsmed, K., Fischer-H\u00fcbner, S. (eds.) NordSec 2014. LNCS, vol. 8788, pp. 59\u201374. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-11599-3_4"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88313-5_13"},{"issue":"6","key":"14_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Sec."},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-03549-4_20","volume-title":"Financial Cryptography and Data Security","author":"P Bogetoft","year":"2009","unstructured":"Bogetoft, P., et al.: Secure multiparty computation goes live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 325\u2013343. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03549-4_20"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494\u2013503","DOI":"10.1145\/509907.509980"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30576-7_19"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 Or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40203-6_1"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32009-5_38"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-31517-1_14","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"S Hoogh","year":"2016","unstructured":"Hoogh, S., Schoenmakers, B., Veeningen, M.: Certificate validation in secure computation and its use in verifiable linear programming. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 265\u2013284. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-31517-1_14"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"R Gennaro","year":"2010","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465\u2013482. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14623-7_25"},{"key":"14_CR16","series-title":"Basic Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol. 2. Cambridge University Press, New York (2004)"},{"key":"14_CR17","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: STOC 1987, pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"14_CR18","unstructured":"Hamada, K., Ikarashi, D., Chida, K., Takahashi, K.: Oblivious radix sort: an efficient sorting algorithm for practical secure multi-party computation. Cryptology ePrint Archive, Report 2014\/121 (2014)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-37682-5_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"K Hamada","year":"2013","unstructured":"Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 202\u2013216. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-37682-5_15"},{"key":"14_CR20","unstructured":"J\u00f3nsson, K.V., Kreitz, G., Uddin, M.: Secure multi-party sorting and applications. Cryptology ePrint Archive, Report 2011\/122 (2011)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P., Mascot: faster malicious arithmetic secure computation with oblivious transfer. Cryptology ePrint Archive, Report 2016\/505 (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Keller, M., Scholl, P., Smart, N.P.: An architecture for practical actively secure MPC with dishonest majority. In: CCS 2013, pp. 549\u2013560","DOI":"10.1145\/2508859.2516744"},{"issue":"2","key":"14_CR23","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1515\/popets-2015-0011","volume":"2015","author":"P Laud","year":"2015","unstructured":"Laud, P.: Parallel oblivious array access for secure multiparty computation and privacy-preserving minimum spanning trees. Proc. Priv. Enhancing Technol. 2015(2), 188\u2013205 (2015)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"14_CR24","series-title":"Cryptology and Information Security","first-page":"26","volume-title":"Applications of Secure Multiparty Computation","author":"P Laud","year":"2015","unstructured":"Laud, P.: Stateful abstractions of secure multiparty computation. In: Laud, P., Kamm, L. (eds.) Applications of Secure Multiparty Computation. Cryptology and Information Security, vol. 13, pp. 26\u201342. IOS Press, Amsterdam (2015)"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-12475-9_11","volume-title":"Provable Security","author":"P Laud","year":"2014","unstructured":"Laud, P., Pankova, A.: Verifiable computation in multiparty protocols with honest majority. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 146\u2013161. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-12475-9_11"},{"key":"14_CR26","unstructured":"Laud, P., Pankova, A.: Preprocessing-based verification of multiparty protocols with honest majority. Cryptology ePrint Archive, Report 2015\/674 (2015)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24861-0_18","volume-title":"Information Security","author":"S Laur","year":"2011","unstructured":"Laur, S., Willemson, J., Zhang, B.: Round-efficient oblivious database manipulation. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 262\u2013277. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24861-0_18"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Pettai, M., Laud, P.: Automatic proofs of privacy of secure multi-party computation protocols against active adversaries. In: CSF 2015, pp. 75\u201389","DOI":"10.1109\/CSF.2015.13"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Wang, G., Luo, T., Goodrich, M.T., Du, W., Zhu, Z.: Bureaucratic protocols for secure two-party sorting, selection, and permuting. In: ASIACCS 2010, pp. 226\u2013237","DOI":"10.1145\/1755688.1755716"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: FOCS 1982, pp. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-24316-5_17","volume-title":"Provable Security","author":"B Zhang","year":"2011","unstructured":"Zhang, B.: Generic constant-round oblivious sorting algorithm for MPC. In: Boyen, X., Chen, X. (eds.) ProvSec 2011. LNCS, vol. 6980, pp. 240\u2013256. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24316-5_17"}],"container-title":["Lecture Notes in Computer Science","Secure IT Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47560-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T11:03:12Z","timestamp":1568458992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47560-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319475592","9783319475608"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47560-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}