{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T17:58:02Z","timestamp":1773511082025,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319252575","type":"print"},{"value":"9783319252582","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_32","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T07:10:18Z","timestamp":1445238618000},"page":"459-473","source":"Crossref","is-referenced-by-count":11,"title":["Secure Multi-party Shuffling"],"prefix":"10.1007","author":[{"given":"Mahnush","family":"Movahedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahdi","family":"Zamani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"32_CR1","unstructured":"Extended version of this paper. http:\/\/cs.unm.edu\/~zamani\/papers\/sirocco15"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-70936-7_30","volume-title":"Theory of Cryptography","author":"B. Adida","year":"2007","unstructured":"Adida, B., Wikstr\u00f6m, D.: How to shuffle in public. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 555\u2013574. Springer, Heidelberg (2007)"},{"key":"32_CR3","first-page":"1","volume-title":"Proceedings of STOC 1983","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An 0(nlogn) sorting network. In: Proceedings of STOC 1983, pp. 1\u20139. ACM, New York (1983)"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: Sorting in clogn parallel steps. Combinatorica\u00a03(1), 1\u201319 (1983)","journal-title":"Combinatorica"},{"key":"32_CR5","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive, Report 2011\/136 (2011)"},{"key":"32_CR6","series-title":"AFIPS \u201968 (Spring)","first-page":"307","volume-title":"Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the April 30\u2013May 2, 1968, Spring Joint Computer Conference. AFIPS \u201968 (Spring), pp. 307\u2013314. ACM, New York (1968)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proceedings of the Twentieth ACM Symposium on the Theory of Computing (STOC), pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-27809-2_26","volume-title":"Financial Cryptography","author":"R. Berman","year":"2004","unstructured":"Berman, R., Fiat, A., Ta-Shma, A.: Provable unlinkability against traffic analysis. In: Juels, A. (ed.) FC 2004. LNCS, vol.\u00a03110, pp. 266\u2013280. Springer, Heidelberg (2004)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-36594-2_21","volume-title":"Theory of Cryptography","author":"E. Boyle","year":"2013","unstructured":"Boyle, E., Goldwasser, S., Tessaro, S.: Communication locality in secure multi-party computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 356\u2013376. Springer, Heidelberg (2013)"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/2484239.2484243","volume-title":"Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013","author":"N. Braud-Santoni","year":"2013","unstructured":"Braud-Santoni, N., Guerraoui, R., Huc, F.: Fast Byzantine agreement. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 57\u201364. ACM, New York (2013)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 136\u2013145, October 2001","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM\u00a024(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"32_CR14","unstructured":"Corrigan-Gibbs, H., Wolinsky, D.I., Ford, B.: Proactively accountable anonymous messaging in verdict. In: Proceedings of the 22nd USENIX Security Symposium, Berkeley, CA, USA, pp. 147\u2013162 (2013)"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Kanarek, P., Lorys, K., Kutylowski, M.: Switching networks for generating random permutations (2001)","DOI":"10.1007\/978-1-4613-0281-0_2"},{"key":"32_CR16","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":"32_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1145\/2332432.2332473","volume-title":"Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, PODC 2012","author":"V. Dani","year":"2012","unstructured":"Dani, V., King, V., Movahedi, M., Saia, J.: Brief announcement: breaking the o(nm) bit barrier, secure multiparty computation with a static adversary. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, PODC 2012, pp. 227\u2013228. ACM, New York (2012)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/10719724_30","volume-title":"Information Hiding","author":"S. Frank","year":"2000","unstructured":"Frank, S., Anderson, R.: The cocaine auction protocol: On the power of anonymous broadcast. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol.\u00a01768, pp. 434\u2013447. Springer, Heidelberg (2000)"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/277697.277716","volume-title":"Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998","author":"R. Gennaro","year":"1998","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, PODC 1998, pp. 101\u2013111. ACM, New York (1998)"},{"issue":"3","key":"32_CR20","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM\u00a043(3), 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. Golle","year":"2004","unstructured":"Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 456\u2013473. Springer, Heidelberg (2004)"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T.: Randomized shellsort: A simple data-oblivious sorting algorithm. J. ACM\u00a058(6), 27:1\u201327:26 (2011)","DOI":"10.1145\/2049697.2049701"},{"key":"32_CR23","first-page":"31","volume-title":"Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, MobiSys 2003","author":"M. Gruteser","year":"2003","unstructured":"Gruteser, M., Grunwald, D.: Anonymous usage of location-based services through spatial and temporal cloaking. In: Proceedings of the 1st International Conference on Mobile Systems, Applications and Services, MobiSys 2003, pp. 31\u201342. ACM, New York (2003)"},{"key":"32_CR24","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.\u00a07839, pp. 202\u2013216. Springer, Heidelberg (2013)"},{"key":"32_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-17679-1_18","volume-title":"Distributed Computing and Networking","author":"V. King","year":"2011","unstructured":"King, V., Lonargan, S., Saia, J., Trehan, A.: Load balanced scalable byzantine agreement through quorum building, with full information. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds.) ICDCN 2011. LNCS, vol.\u00a06522, pp. 203\u2013214. Springer, Heidelberg (2011)"},{"key":"32_CR26","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.\u00a07001, pp. 262\u2013277. Springer, Heidelberg (2011)"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Leighton, T., Plaxton, C.G.: A (fairly) simple circuit that (usually) sorts. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, FOCS 1990, pp. 264\u2013274, October 1990","DOI":"10.1109\/FSCS.1990.89545"},{"key":"32_CR28","first-page":"116","volume-title":"Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001","author":"C.A. Neff","year":"2001","unstructured":"Neff, C.A.: A verifiable secret shuffle and its application to e-voting. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, CCS 2001, pp. 116\u2013125. ACM, New York (2001)"},{"key":"32_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-39805-8_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201985","author":"A. Pfitzmann","year":"1986","unstructured":"Pfitzmann, A., Waidner, M.: Networks without user observability \u2013 design options. In: Pichler, F. (ed.) EUROCRYPT 1985. LNCS, vol.\u00a0219, pp. 245\u2013253. Springer, Heidelberg (1986)"},{"key":"32_CR30","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/167088.167260","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993","author":"C. Rackoff","year":"1993","unstructured":"Rackoff, C., Simon, D.R.: Cryptographic defense against traffic analysis. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, STOC 1993, pp. 672\u2013681. ACM, New York (1993)"},{"key":"32_CR31","first-page":"122","volume-title":"Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003","author":"L. Ahn von","year":"2003","unstructured":"von Ahn, L., Bortz, A., Hopper, N.J.: k-anonymous message transmission. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, CCS 2003, pp. 122\u2013130. ACM, New York (2003)"},{"issue":"1","key":"32_CR32","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1145\/321439.321449","volume":"15","author":"A. Waksman","year":"1968","unstructured":"Waksman, A.: A permutation network. J. ACM\u00a015(1), 159\u2013163 (1968)","journal-title":"J. ACM"},{"key":"32_CR33","unstructured":"Zamani, M., Movahedi, M., Saia, J.: Millions of millionaires: Multiparty computation in large networks. Cryptology ePrint Archive, Report 2014\/149 (2014)"},{"key":"32_CR34","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.\u00a06980, pp. 240\u2013256. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T02:17:37Z","timestamp":1748657857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}