{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:54Z","timestamp":1774946574873,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":63,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T00:00:00Z","timestamp":1508803200000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1111781"],"award-info":[{"award-number":["CNS-1111781"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Google"},{"name":"Air Force Office of Scientific Research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,10,24]]},"DOI":"10.1145\/2976749.2978373","type":"proceedings-article","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T08:46:35Z","timestamp":1477385195000},"page":"1602-1613","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Secure Stable Matching at Scale"],"prefix":"10.1145","author":[{"given":"Jack","family":"Doerner","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"David","family":"Evans","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"abhi","family":"shelat","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","author":"Atila","year":"2005","unstructured":"Atila Abdulkadiro\\uglu, Parag A Pathak, and Alvin E Roth. The New York City High School Match. American Economic Review, 2005.","journal-title":"The New York City High School Match. American Economic Review"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516698"},{"key":"e_1_3_2_1_3_1","volume-title":"Competitive Bidding and Auctions.","author":"Bandela Chaitanya","year":"2003","unstructured":"Chaitanya Bandela, Yu Chen, Andrew B. Kahng, Ion I. Mandoiu, and Alexander Zelikovsky. Multiple-object XOR Auctions with Buyer Preferences and Seller Priorities. In Competitive Bidding and Auctions. 2003."},{"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":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484341"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42045-0_23"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2831143.2831177"},{"key":"e_1_3_2_1_9_1","unstructured":"Canadian Resident Matching Service. The Match Algorithm. http:\/\/www.carms.ca\/en\/residency\/match-algorithm\/ 2016."},{"key":"e_1_3_2_1_10_1","volume-title":"CRYPTO.","author":"Damg\u00e5rd Ivan","year":"2012","unstructured":"Ivan Damg\u00e5rd, Valerio Pastro, Nigel Smart, and Sarah Zakarias. Multiparty Computation from Somewhat Homomorphic Encryption. In CRYPTO. 2012."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11967668_11"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10879-7_21"},{"key":"e_1_3_2_1_15_1","volume-title":"Shapley","author":"Gale David","unstructured":"David Gale and Lloyd S. Shapley. College Admissions and the Stability of Marriage. The American Mathematical Monthly, 69(1), 1962."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39077-7_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233553"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11889663_5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382251"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/68392"},{"key":"e_1_3_2_1_22_1","first-page":"2011","article-title":"Shen and abhi shelat. Two-output secure computation with malicious adversaries","author":"Chih","year":"2011","unstructured":"Chih hao Shen and abhi shelat. Two-output secure computation with malicious adversaries. In Eurocrypt 2011, 2011.","journal-title":"Eurocrypt"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2028067.2028102"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_2"},{"key":"e_1_3_2_1_27_1","volume-title":"ASIACRYPT","author":"Keller Marcel","year":"2014","unstructured":"Marcel Keller and Peter Scholl. Efficient, Oblivious Data Structures for MPC. In ASIACRYPT, 2014."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1051910"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2362793.2362807"},{"key":"e_1_3_2_1_31_1","volume-title":"National Resident Matching Program. Personal communication","author":"Liang Mei","year":"2016","unstructured":"Mei Liang. Director of Research, National Resident Matching Program. Personal communication, May 2016."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987260.1987287"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9177-x"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_2"},{"issue":"3","key":"e_1_3_2_1_37_1","article-title":"Sorority Rush as a Two-Sided Matching Mechanism","volume":"81","author":"Mongell Susan","year":"1991","unstructured":"Susan Mongell and Alvin E. Roth. Sorority Rush as a Two-Sided Matching Mechanism. American Economic Review, 81(3), 1991.","journal-title":"American Economic Review"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.20"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"key":"e_1_3_2_1_40_1","volume-title":"https:\/\/natmatch.com\/clients.html","author":"National Matching Service. Current Clients.","year":"2016","unstructured":"National Matching Service. Current Clients. https:\/\/natmatch.com\/clients.html, 2016."},{"key":"e_1_3_2_1_41_1","unstructured":"National Resident Matching Program. 2016 Main Residency Match. http:\/\/www.nrmp.org\/wp-content\/uploads\/2016\/04\/Main-Match-Results-and-Data-2016.pdf 2016."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.98.3.897"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90007-2"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1086\/261272"},{"key":"e_1_3_2_1_46_1","volume-title":"Interim Report#1: Evaluation of the Current NRMP Algorithm, and Preliminary Design of an Applicant-Processing Algorithm. https:\/\/web.stanford.edu\/ alroth\/interim1.html","author":"Roth Alvin E.","year":"1996","unstructured":"Alvin E. Roth. Interim Report#1: Evaluation of the Current NRMP Algorithm, and Preliminary Design of an Applicant-Processing Algorithm. https:\/\/web.stanford.edu\/ alroth\/interim1.html, 1996."},{"key":"e_1_3_2_1_47_1","volume-title":"Houghton Mifflin Harcourt","author":"Roth Alvin E.","year":"2015","unstructured":"Alvin E. Roth. Who Gets What--and Why: The New Economics of Matchmaking and Market Design. Houghton Mifflin Harcourt, 2015."},{"key":"e_1_3_2_1_48_1","volume-title":"The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. American Economic Review","author":"Alvin","year":"1999","unstructured":"Alvin E. Roth and Elliott Peranson. The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design. American Economic Review, 1999."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.2307\/2938326"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516660"},{"key":"e_1_3_2_1_51_1","volume-title":"U of Virginia","author":"Terner Ben","year":"2015","unstructured":"Ben Terner. Stable Matching with PCF Version 2, an E\\'tude in Secure Computation. Master's thesis, U of Virginia, 2015."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27659-5_5"},{"key":"e_1_3_2_1_53_1","unstructured":"The Royal Swedish Academy of Sciences. Stable Matching: Theory Evidence and Practical Design. http:\/\/www.nobelprize.org\/nobel_prizes\/economic-sciences\/laureates\/2012\/popular-economicsciences2012.pdf 2012."},{"key":"e_1_3_2_1_54_1","volume-title":"The New York Times","author":"Tullis Tracy","year":"2014","unstructured":"Tracy Tullis. How Game Theory Helped Improve New York City's High School Application Process. The New York Times, 5 December, 2014."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_3_2_1_57_1","volume-title":"ACM CCS","author":"Wang Xiao Shaun","year":"2014","unstructured":"Xiao Shaun Wang, Yan Huang, T.-H. Hubert Chan, Abhi Shelat, and Elaine Shi. SCORAM: Oblivious RAM for Secure Computation. In ACM CCS, 2014."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/1382436.1382751"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.40"},{"key":"e_1_3_2_1_61_1","unstructured":"Samee Zahur and David Evans. Obliv-C: A Lightweight Compiler for Data-Oblivious Computation. Cryptology ePrint Archive Report 2015\/1153. http:\/\/oblivc.org 2015."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"e_1_3_2_1_63_1","volume-title":"Jonathan Katz. Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation. In IEEE Symposium on Security and Privacy","author":"Zahur Samee","year":"2016","unstructured":"Samee Zahur, Xiaoern Wang, Marianaern Raykova, Adri\u00e0ern Gasc\u00f3n, Jack Doerner, David Evans, and Jonathan Katz. Revisiting Square Root ORAM: Efficient Random Access in Multi-Party Computation. In IEEE Symposium on Security and Privacy, 2016."}],"event":{"name":"CCS'16: 2016 ACM SIGSAC Conference on Computer and Communications Security","location":"Vienna Austria","acronym":"CCS'16","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978373","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2976749.2978373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:26:11Z","timestamp":1763457971000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2976749.2978373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,24]]},"references-count":63,"alternative-id":["10.1145\/2976749.2978373","10.1145\/2976749"],"URL":"https:\/\/doi.org\/10.1145\/2976749.2978373","relation":{},"subject":[],"published":{"date-parts":[[2016,10,24]]},"assertion":[{"value":"2016-10-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}