{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:28:14Z","timestamp":1766449694439,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,4,13]],"date-time":"2010-04-13T00:00:00Z","timestamp":1271116800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["4.30E+12"],"award-info":[{"award-number":["4.30E+12"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,4,13]]},"DOI":"10.1145\/1755688.1755716","type":"proceedings-article","created":{"date-parts":[[2010,4,16]],"date-time":"2010-04-16T14:28:35Z","timestamp":1271428115000},"page":"226-237","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Bureaucratic protocols for secure two-party sorting, selection, and permuting"],"prefix":"10.1145","author":[{"given":"Guan","family":"Wang","sequence":"first","affiliation":[{"name":"Syracuse University, Syracuse, NY"}]},{"given":"Tongbo","family":"Luo","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY"}]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[{"name":"University of California, Irvine, CA"}]},{"given":"Wenliang","family":"Du","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY"}]},{"given":"Zutao","family":"Zhu","sequence":"additional","affiliation":[{"name":"Syracuse University, Syracuse, NY"}]}],"member":"320","published-online":{"date-parts":[[2010,4,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"40","volume-title":"In Advances in Cryptology-Proc. of Eurocrypt'04","author":"Aggarwal G.","year":"2004"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579338"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645933.756665"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"M. Blum R. W. Floyd V. Pratt R. Rivest and R. Tarjan. Time bounds for selection 1973.  M. Blum R. W. Floyd V. Pratt R. Rivest and R. Tarjan. Time bounds for selection 1973.","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384047"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02943113"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796270"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/647900.741268"},{"volume-title":"Second Edition. The MIT Press","year":"2001","author":"Cormen T. H.","key":"e_1_3_2_1_10_1"},{"volume-title":"Twenty Eighth International Colloquium on Automata","year":"2001","author":"Feigenbaum J.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","first-page":"285","volume-title":"In Proc. 40th Annual Symposium on Foundations of Computer Science","author":"Frigo M.","year":"1999"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"O. Goldreich. The Foundations of Cryptography volume 2. 2004.   O. Goldreich. The Foundations of Cryptography volume 2. 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"L. J. Goldstein and S. W. Leibholz. On the synthesis of signal switching networks with transient blocking 1967.  L. J. Goldstein and S. W. Leibholz. On the synthesis of signal switching networks with transient blocking 1967.","DOI":"10.1109\/PGEC.1967.264771"},{"volume-title":"Wiley","year":"2001","author":"Goodrich M. T.","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873702"},{"volume-title":"Dept. of Computer Science","year":"1994","author":"Incerpi J.","key":"e_1_3_2_1_18_1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00223-4"},{"key":"e_1_3_2_1_20_1","unstructured":"D. E. Knuth. Seminumerical algorithms. The Art of Computer Programming 2.  D. E. Knuth. Seminumerical algorithms. The Art of Computer Programming 2."},{"key":"e_1_3_2_1_21_1","unstructured":"D. E. Knuth. Sorting and searching. The Art of Computer Programming 3.  D. E. Knuth. Sorting and searching. The Art of Computer Programming 3."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/215399.215429"},{"volume-title":"SCAMP working paper","year":"1994","author":"Lemke P.","key":"e_1_3_2_1_23_1"},{"key":"e_1_3_2_1_24_1","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - Crypto2000","author":"Lindell Y.","year":"2000"},{"key":"e_1_3_2_1_25_1","first-page":"287","volume-title":"In USENIX Security Symposium","author":"Malkhi D.","year":"2004"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840378"},{"key":"e_1_3_2_1_27_1","unstructured":"H. Prokop. Cache-oblivious algorithms. Technical report M.I.T 1999.  H. Prokop. Cache-oblivious algorithms. Technical report M.I.T 1999."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/647906.739656"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/368370.368387"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"}],"event":{"name":"ASIA CCS '10: 5th ACM Symposium on Information, Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Beijing China","acronym":"ASIA CCS '10"},"container-title":["Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1755688.1755716","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1755688.1755716","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:30Z","timestamp":1750250730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1755688.1755716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,13]]},"references-count":30,"alternative-id":["10.1145\/1755688.1755716","10.1145\/1755688"],"URL":"https:\/\/doi.org\/10.1145\/1755688.1755716","relation":{},"subject":[],"published":{"date-parts":[[2010,4,13]]},"assertion":[{"value":"2010-04-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}