{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T16:43:57Z","timestamp":1783788237081,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"JST CREST","award":["JPMJCR19F6"],"award-info":[{"award-number":["JPMJCR19F6"]}]},{"name":"JSPS KAKENHI","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484584","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"630-650","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Oblivious Linear Group Actions and Applications"],"prefix":"10.1145","author":[{"given":"Nuttapong","family":"Attrapadung","sequence":"first","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Goichiro","family":"Hanaoaka","sequence":"additional","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takahiro","family":"Matsuda","sequence":"additional","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiraku","family":"Morita","sequence":"additional","affiliation":[{"name":"University of St. Gallen, St. Gallen, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazuma","family":"Ohara","sequence":"additional","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacob C. N.","family":"Schuldt","sequence":"additional","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tadanori","family":"Teruya","sequence":"additional","affiliation":[{"name":"AIST, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kazunari","family":"Tozawa","sequence":"additional","affiliation":[{"name":"University of Tokyo, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--46766--1_34"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_3_1","unstructured":"Dan Bogdanov Sven Laur and Riivo Talviste. 2013. Oblivious Sorting of Secret-Shared Data. Technical Report T-4--19. Cybernetica. http:\/\/research.cyber.ee\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11599-3_4"},{"key":"e_1_3_2_1_5_1","unstructured":"Elette Boyle Nishanth Chandran Niv Gilboa Divya Gupta Yuval Ishai Nishant Kumar and Mayank Rathee. 2020. Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. Cryptology ePrint Archive Report 2020\/1392. https:\/\/eprint.iacr.org\/2020\/1392 ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--662--46803--6_12"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--15317--4_13"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--64840--4_12"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375708.3380316"},{"key":"e_1_3_2_1_11_1","unstructured":"Koji Chida Koki Hamada Dai Ikarashi Ryo Kikuchi Naoto Kiribuchi and Benny Pinkas. 2019. An Efficient Secure Three-Party Sorting Protocol with an Honest Majority. Cryptology ePrint Archive Report 2019\/695. https:\/\/eprint.iacr.org\/2019\/695 ."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--98113-0_25"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_15"},{"key":"e_1_3_2_1_14_1","volume-title":"ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS","author":"Demmler Daniel","year":"2015","unstructured":"Daniel Demmler, Thomas Schneider, and Michael Zohner. 2015. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In NDSS 2015. The Internet Society."},{"key":"e_1_3_2_1_15_1","volume-title":"Foote","author":"Dummit David S.","year":"2004","unstructured":"David S. Dummit and Richard M. Foote. 2004. Abstract algebra 3rd ed.). Wiley.","edition":"3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_1_17_1","unstructured":"Koki Hamada Dai Ikarashi Koji Chida and Katsumi Takahashi. 2014. Oblivious Radix Sort: An Efficient Sorting Algorithm for Practical Secure Multi-party Computation. Cryptology ePrint Archive Report 2014\/121. https:\/\/eprint.iacr.org\/2014\/121 ."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"e_1_3_2_1_21_1","volume-title":"NDSS","author":"Huang Yan","year":"2012","unstructured":"Yan Huang, David Evans, and Jonathan Katz. 2012. Private Set Intersection: Are Garbled Circuits Better than Custom Protocols?. In NDSS 2012. The Internet Society."},{"key":"e_1_3_2_1_22_1","unstructured":"Kristj\u00e1n Valur J\u00f3nsson Gunnar Kreitz and Misbah Uddin. 2011. Secure Multi-Party Sorting and Applications. Cryptology ePrint Archive Report 2011\/122. https:\/\/eprint.iacr.org\/2011\/122 ."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382280"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--93638--3_5"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--21966-0_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47560-8_14"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--38980--1_6"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--24861-0_18"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243760"},{"key":"e_1_3_2_1_30_1","unstructured":"Payman Mohassel Peter Rindal and Mike Rosulek. 2019. Fast Database Joins for Secret Shared Data. Cryptology ePrint Archive Report 2019\/518. https:\/\/eprint.iacr.org\/2019\/518 ."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_33"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--98989--1_20"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--25258--2_32"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704383633"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--51280--4_20"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--17659--4_5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358918"},{"key":"e_1_3_2_1_42_1","unstructured":"Vishnu Subramanian. 2018. Deep Learning with PyTorch .Packt."},{"key":"e_1_3_2_1_43_1","unstructured":"Riivo Talviste. 2016. Applying Secure Multi-Party Computation in Practice. Ph. D. Dissertation. Univ. of Tartu."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755716"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--642--33167--1_30"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24316-5_17"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516752"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484584","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:44:49Z","timestamp":1763498689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":48,"alternative-id":["10.1145\/3460120.3484584","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484584","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}