{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:40:54Z","timestamp":1772044854580,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Grants-in-Aid for Scientific Research","award":["16H02864"],"award-info":[{"award-number":["16H02864"]}]},{"name":"JST CREST","award":["JPMJCR1302"],"award-info":[{"award-number":["JPMJCR1302"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,29]]},"DOI":"10.1145\/3196494.3196503","type":"proceedings-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T13:18:28Z","timestamp":1527772708000},"page":"67-74","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["Non-interactive and Output Expressive Private Comparison from Homomorphic Encryption"],"prefix":"10.1145","author":[{"given":"Wen-jie","family":"Lu","sequence":"first","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Jun-jie","family":"Zhou","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]},{"given":"Jun","family":"Sakuma","sequence":"additional","affiliation":[{"name":"University of Tsukuba, Tsukuba, Japan"}]}],"member":"320","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Strong Conditional Oblivious Transfer and Computing on Intervals ASIACRYPT","author":"Ian","year":"2004","unstructured":"Ian F. Blake and Vladimir Kolesnikov. December 5-9, 2004 . Strong Conditional Oblivious Transfer and Computing on Intervals ASIACRYPT 2004 , Jeju Islan, Korea. 515--529. Ian F. Blake and Vladimir Kolesnikov. December 5-9, 2004. Strong Conditional Oblivious Transfer and Computing on Intervals ASIACRYPT 2004, Jeju Islan, Korea. 515--529."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23241"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"e_1_3_2_1_5_1","volume-title":"Improved Primitives for Secure Multiparty Integer Computation SCN","author":"Catrina Octavian","year":"2010","unstructured":"Octavian Catrina and Sebastiaan de Hoogh . September 13-15 , 2010 .. Improved Primitives for Secure Multiparty Integer Computation SCN 2010, Amalfi, Italy. 182--199. Octavian Catrina and Sebastiaan de Hoogh. September 13-15, 2010.. Improved Primitives for Secure Multiparty Integer Computation SCN 2010, Amalfi, Italy. 182--199."},{"key":"e_1_3_2_1_6_1","first-page":"224","article-title":"Simple Encrypted Arithmetic Library - SEAL v2.1","volume":"2017","author":"Chen Hao","year":"2017","unstructured":"Hao Chen , Kim Laine , and Rachel Player . 2017 . Simple Encrypted Arithmetic Library - SEAL v2.1 . IACR Cryptology ePrint Archive Vol. 2017 (2017), 224 . Hao Chen, Kim Laine, and Rachel Player. 2017. Simple Encrypted Arithmetic Library - SEAL v2.1. IACR Cryptology ePrint Archive Vol. 2017 (2017), 224.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Ilaria Chillotti Nicolas Gama Mariya Georgieva and Malika Izabach\u00e8ne. December 4-8 2016. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ASIACRYPT 2016 Hamoi Vietnam. 3--33.  Ilaria Chillotti Nicolas Gama Mariya Georgieva and Malika Izabach\u00e8ne. December 4-8 2016. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds ASIACRYPT 2016 Hamoi Vietnam. 3--33.","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_8_1","first-page":"544","article-title":"Efficient Secure Comparison Protocols","volume":"2016","author":"Couteau Geoffroy","year":"2016","unstructured":"Geoffroy Couteau . 2016 . Efficient Secure Comparison Protocols . IACR Cryptology ePrint Archive Vol. 2016 (2016), 544 . Geoffroy Couteau. 2016. Efficient Secure Comparison Protocols. IACR Cryptology ePrint Archive Vol. 2016 (2016), 544.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2009.028031"},{"key":"e_1_3_2_1_10_1","volume-title":"Efficient and Secure Comparison for On-Line Auctions ACISP","author":"Damg\u00e5rd Ivan","year":"2007","unstructured":"Ivan Damg\u00e5rd , Martin Geisler , and Mikkel Kr\u00f8igaard . July 2-4 , 2007 . Efficient and Secure Comparison for On-Line Auctions ACISP 2007, Townsville, Australia. 416--430. Ivan Damg\u00e5rd, Martin Geisler, and Mikkel Kr\u00f8igaard. July 2-4, 2007. Efficient and Secure Comparison for On-Line Auctions ACISP 2007, Townsville, Australia. 416--430."},{"key":"e_1_3_2_1_11_1","volume-title":"A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires CT-RSA","author":"Fischlin Marc","year":"2001","unstructured":"Marc Fischlin . April 8-12, 2001. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires CT-RSA 2001 , San Francisco, CA , USA. 457--472. Marc Fischlin. April 8-12, 2001. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires CT-RSA 2001, San Francisco, CA, USA. 457--472."},{"key":"e_1_3_2_1_12_1","volume-title":"Private Database Access with HE-over-ORAM Architecture ACNS","author":"Gentry Craig","year":"2015","unstructured":"Craig Gentry , Shai Halevi , Charanjit S. Jutla , and Mariana Raykova . Jun 2-5 , 2015 . Private Database Access with HE-over-ORAM Architecture ACNS 2015, New York, NY, USA. 172--191. Craig Gentry, Shai Halevi, Charanjit S. Jutla, and Mariana Raykova. Jun 2-5, 2015. Private Database Access with HE-over-ORAM Architecture ACNS 2015, New York, NY, USA. 172--191."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"e_1_3_2_1_15_1","volume-title":"Foundations of cryptography","author":"Goldreich Oded","unstructured":"Oded Goldreich . 2009. Foundations of cryptography : volume 2 , basic applications. Cambridge University Press . Oded Goldreich. 2009. Foundations of cryptography: volume 2, basic applications. Cambridge University Press."},{"key":"e_1_3_2_1_16_1","volume-title":"Algorithms in HElib. In CRYPTO","author":"Halevi Shai","year":"2014","unstructured":"Shai Halevi and Victor Shoup . August 17-21 , 2014 . Algorithms in HElib. In CRYPTO 2014, Santa Barbara, CA, USA. 554--571. Shai Halevi and Victor Shoup . August 17-21, 2014. Algorithms in HElib. In CRYPTO 2014, Santa Barbara, CA, USA. 554--571."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_1_19_1","unstructured":"M. Lichman. 2013. UCI Machine Learning Repository. (2013). http:\/\/archive.ics.uci.edu\/ml  M. Lichman. 2013. UCI Machine Learning Repository. (2013). http:\/\/archive.ics.uci.edu\/ml"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes International Conference on the Theory and Applications of Cryptographic Techniques. 223--238.   Pascal Paillier. 1999. Public-key cryptosystems based on composite degree residuosity classes International Conference on the Theory and Applications of Cryptographic Techniques. 223--238.","DOI":"10.1007\/3-540-48910-X_16"},{"key":"e_1_3_2_1_21_1","volume-title":"Efficient Privacy-Preserving Face Recognition. In ICISC","author":"Sadeghi Ahmad-Reza","year":"2009","unstructured":"Ahmad-Reza Sadeghi , Thomas Schneider , and Immo Wehrenberg . December 2-4 , 2009 . Efficient Privacy-Preserving Face Recognition. In ICISC 2009, Seoul, Korea. 229--244. Ahmad-Reza Sadeghi, Thomas Schneider, and Immo Wehrenberg. December 2-4, 2009. Efficient Privacy-Preserving Face Recognition. In ICISC 2009, Seoul, Korea. 229--244."},{"key":"e_1_3_2_1_22_1","volume-title":"FOCS '99","author":"Sander Tomas","year":"1999","unstructured":"Tomas Sander , Adam L. Young , and Moti Yung . 17-18 October , 1999 . Non-Interactive CryptoComputing For NC(1) 40th Annual Symposium on Foundations of Computer Science , FOCS '99 , New York, NY, USA. 554--567. Tomas Sander, Adam L. Young, and Moti Yung. 17-18 October, 1999. Non-Interactive CryptoComputing For NC(1) 40th Annual Symposium on Foundations of Computer Science, FOCS '99, New York, NY, USA. 554--567."},{"key":"e_1_3_2_1_23_1","unstructured":"Victor Shoup Shai Halevi. 2017. HELib. http:\/\/shaih.github.io\/HElib. (2017).  Victor Shoup Shai Halevi. 2017. HELib. http:\/\/shaih.github.io\/HElib. (2017)."},{"key":"e_1_3_2_1_24_1","unstructured":"Misunari Shigeo. 2017. mcl: a generic and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl. (2017). Accessed: 2017--11--10.  Misunari Shigeo. 2017. mcl: a generic and fast pairing-based cryptography library. https:\/\/github.com\/herumi\/mcl. (2017). Accessed: 2017--11--10."},{"key":"e_1_3_2_1_25_1","volume-title":"Chow","author":"Tai Raymond K. H.","year":"2017","unstructured":"Raymond K. H. Tai , Jack P. K. Ma , Yongjun Zhao , and Sherman S. M . Chow . September 11-15, 2017 . Privacy-Preserving Decision Trees Evaluation via Linear Functions ESORICS 2017, Oslo, Norway . 494--512. Raymond K. H. Tai, Jack P. K. Ma, Yongjun Zhao, and Sherman S. M. Chow. September 11-15, 2017. Privacy-Preserving Decision Trees Evaluation via Linear Functions ESORICS 2017, Oslo, Norway. 494--512."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2012.6412624"}],"event":{"name":"ASIA CCS '18: ACM Asia Conference on Computer and Communications Security","location":"Incheon Republic of Korea","acronym":"ASIA CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196494.3196503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:05Z","timestamp":1750210745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":26,"alternative-id":["10.1145\/3196494.3196503","10.1145\/3196494"],"URL":"https:\/\/doi.org\/10.1145\/3196494.3196503","relation":{},"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"2018-05-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}