{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T08:21:15Z","timestamp":1769502075102,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T00:00:00Z","timestamp":1601856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"H2020","award":["644579"],"award-info":[{"award-number":["644579"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,5]]},"DOI":"10.1145\/3320269.3384739","type":"proceedings-article","created":{"date-parts":[[2020,10,5]],"date-time":"2020-10-05T16:33:23Z","timestamp":1601915603000},"page":"193-207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Secure Computation of Order-Preserving Encryption"],"prefix":"10.1145","author":[{"given":"Anselme","family":"Tueno","sequence":"first","affiliation":[{"name":"SAP Security Research, Walldorf, Germany"}]},{"given":"Florian","family":"Kerschbaum","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}]}],"member":"320","published-online":{"date-parts":[[2020,10,5]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"SIGMOD","author":"Agrawal Rakesh"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2478\/popets-2019-0014","article-title":"Breach-Resistant Structured Encryption","volume":"2019","author":"Amjad Ghous","year":"2019","journal-title":"PoPETs"},{"key":"e_1_3_2_2_3_1","volume-title":"More Efficient Oblivious Transfer and Extensions for Faster Secure Computation. In CCS '13","author":"Asharov Gilad","year":"2013"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Mikhail J. Atallah Marina Bykova Jiangtao Li Keith B. Frikken and Mercan Topkara. 2004. Private collaborative forecasting and benchmarking. In WPES. 103--114.  Mikhail J. Atallah Marina Bykova Jiangtao Li Keith B. Frikken and Mercan Topkara. 2004. Private collaborative forecasting and benchmarking. In WPES. 103--114.","DOI":"10.1145\/1029179.1029204"},{"key":"e_1_3_2_2_5_1","volume-title":"Secure Supply-Chain Protocols. In CEC '03","author":"Atallah Mikhail J."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"e_1_3_2_2_7_1","volume-title":"EUROCRYPT '09","author":"Boldyreva Alexandra"},{"key":"e_1_3_2_2_8_1","volume-title":"CRYPTO'11","author":"Boldyreva Alexandra"},{"key":"e_1_3_2_2_9_1","volume-title":"Fostering the Uptake of Secure Multiparty Computation in E-Commerce. In ARES '08","author":"Catrina Octavian","year":"2008"},{"key":"e_1_3_2_2_10_1","volume-title":"Practical Order-Revealing Encryption with Limited Leakage. In FSE '16","author":"Chenette Nathan"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"Cramer Ronald","DOI":"10.1017\/CBO9781107337756"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180417"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd Martin Geisler and Mikkel Kr\u00f8igaard. 2007. Efficient and Secure Comparison for On-Line Auctions. In ACISP. 416--430.  Ivan Damg\u00e5rd Martin Geisler and Mikkel Kr\u00f8igaard. 2007. Efficient and Secure Comparison for On-Line Auctions. In ACISP. 416--430.","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"e_1_3_2_2_14_1","first-page":"221","article-title":"Efficient Conversion of Secret-shared Values Between Different Fields","volume":"2008","author":"Damg\u00e5rd Ivan","year":"2008","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_15_1","volume-title":"Atallah","author":"Du Wenliang","year":"2001"},{"key":"e_1_3_2_2_17_1","first-page":"629","article-title":"SCAPI: The Secure Computation Application Programming Interface","volume":"2012","author":"Ejgenberg Yael","year":"2012","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_18_1","volume-title":"Fully Homomorphic Encryption Using Ideal Lattices. In STOC '09","author":"Gentry Craig","year":"2009"},{"key":"e_1_3_2_2_19_1","volume-title":"Foundations of Cryptography","author":"Goldreich Oded"},{"key":"e_1_3_2_2_21_1","volume-title":"SP '17","author":"Grubbs P."},{"key":"e_1_3_2_2_22_1","volume-title":"Searchable Encryption with Secure and Efficient Updates. In CCS '14","author":"Hahn Florian","year":"2014"},{"key":"e_1_3_2_2_23_1","volume-title":"CT-RSA (Lecture Notes in Computer Science)","author":"Ishai Yuval"},{"key":"e_1_3_2_2_24_1","volume-title":"APF '12","author":"Kerschbaum Florian","year":"2012"},{"key":"e_1_3_2_2_25_1","volume-title":"Frequency-Hiding Order-Preserving Encryption. In CCS '15","author":"Kerschbaum Florian","year":"2015"},{"key":"e_1_3_2_2_26_1","volume-title":"Optimal Average-Complexity Ideal-Security Order-Preserving Encryption. In SIGSAC '14","author":"Kerschbaum Florian","year":"2014"},{"key":"e_1_3_2_2_27_1","volume-title":"An Efficiently Searchable Encrypted Data Structure for Range Queries. In ESORICS '19","author":"Kerschbaum Florian","year":"2019"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"e_1_3_2_2_29_1","volume-title":"Improved Garbled Circuit: Free XOR Gates and Applications. In ICALP '08","author":"Kolesnikov Vladimir","year":"2008"},{"key":"e_1_3_2_2_30_1","volume-title":"Wu","author":"Lewi Kevin","year":"2016"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-001-0019-2"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"},{"key":"e_1_3_2_2_33_1","first-page":"59","article-title":"Secure Multiparty Computation for Privacy-Preserving Data Mining","volume":"2009","author":"Lindell Yehuda","year":"2009","journal-title":"The Journal of Privacy and Confidentiality"},{"key":"e_1_3_2_2_34_1","volume-title":"Revisited. In SIGMOD '15","author":"Mavroforakis Charalampos","year":"2015"},{"key":"e_1_3_2_2_35_1","volume-title":"Inference Attacks on Property-Preserving Encrypted Databases. In CCS '15","author":"Naveed Muhammad"},{"key":"e_1_3_2_2_36_1","volume-title":"EUROCRYPT'99","author":"Paillier Pascal"},{"key":"e_1_3_2_2_37_1","volume-title":"Arx: A Strongly Encrypted Database System. IACR Cryptology ePrint Archive","author":"Poddar Rishabh","year":"2016"},{"key":"e_1_3_2_2_38_1","volume-title":"An Ideal-Security Protocol for Order-Preserving Encoding. In SP '13","author":"Popa Raluca Ada","year":"2013"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043556.2043566"},{"key":"e_1_3_2_2_41_1","volume-title":"POPE: Partial Order Preserving Encoding. In CCS '16","author":"Roche Daniel S.","year":"2016"},{"key":"e_1_3_2_2_42_1","article-title":"Privacy-preserving condition-based forecasting using machine learning","author":"Taigel Fabian","year":"2018","journal-title":"Journal of Business Economics (05"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_3"},{"key":"e_1_3_2_2_44_1","volume-title":"2019 a. Non-Interactive Private Decision Tree Evaluation. CoRR","author":"Tueno Anselme","year":"2019"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","first-page":"266","DOI":"10.2478\/popets-2019-0015","article-title":"b. Private Evaluation of Decision Trees using Sublinear Cost","volume":"2019","author":"Tueno Anselme","year":"2019","journal-title":"PoPETs"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"crossref","unstructured":"Anselme Tueno Florian Kerschbaum Stefan Katzenbeisser Yordan Boev and Mubashir Qureshi. 2020. Secure Computation of the kth-Ranked Element in a Star Network. In Financial Cryptography and Data Security (FC).  Anselme Tueno Florian Kerschbaum Stefan Katzenbeisser Yordan Boev and Mubashir Qureshi. 2020. Secure Computation of the kth-Ranked Element in a Star Network. In Financial Cryptography and Data Security (FC).","DOI":"10.1007\/978-3-030-51280-4_21"},{"key":"e_1_3_2_2_47_1","volume-title":"Protocols for Secure Computations. In SFCS '82","author":"Yao Andrew C.","year":"1982"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates (EUROCRYPT'15).  Samee Zahur Mike Rosulek and David Evans. 2015. Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half Gates (EUROCRYPT'15).","DOI":"10.1007\/978-3-662-46803-6_8"}],"event":{"name":"ASIA CCS '20: The 15th ACM Asia Conference on Computer and Communications Security","location":"Taipei Taiwan","acronym":"ASIA CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 15th ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3320269.3384739","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3320269.3384739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:27Z","timestamp":1750200087000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3320269.3384739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,5]]},"references-count":45,"alternative-id":["10.1145\/3320269.3384739","10.1145\/3320269"],"URL":"https:\/\/doi.org\/10.1145\/3320269.3384739","relation":{},"subject":[],"published":{"date-parts":[[2020,10,5]]},"assertion":[{"value":"2020-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}