{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:21:41Z","timestamp":1783009301497,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,5,24]],"date-time":"2021-05-24T00:00:00Z","timestamp":1621814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,5,24]]},"DOI":"10.1145\/3433210.3457535","type":"proceedings-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T15:26:39Z","timestamp":1622820399000},"page":"242-251","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Pipa: Privacy-preserving Password Checkup via Homomorphic Encryption"],"prefix":"10.1145","author":[{"given":"Jie","family":"Li","sequence":"first","affiliation":[{"name":"Huawei Technologies, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yamin","family":"Liu","sequence":"additional","affiliation":[{"name":"Huawei International, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuang","family":"Wu","sequence":"additional","affiliation":[{"name":"Huawei International, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Conference on Selected Areas in Cryptography. Springer, 423--442","author":"Bajard Jean-Claude","year":"2016","unstructured":"Jean-Claude Bajard , Julien Eynard , M Anwar Hasan , and Vincent Zucca . 2016 . A full RNS variant of FV like somewhat homomorphic encryption schemes . In International Conference on Selected Areas in Cryptography. Springer, 423--442 . Jean-Claude Bajard, Julien Eynard, M Anwar Hasan, and Vincent Zucca. 2016. A full RNS variant of FV like somewhat homomorphic encryption schemes. In International Conference on Selected Areas in Cryptography. Springer, 423--442."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"William Barker W. Polk and Murugiah Souppaya. 2020. Getting Ready for Post-Quantum Cryptography: Explore Challenges Associated with Adoption and Use of Post-Quantum Cryptographic Algorithms. https:\/\/csrc.nist.gov\/publications\/detail\/white-paper\/2020\/05\/26\/getting-ready-for-post-quantum-cryptography\/draft. NIST USA.  William Barker W. Polk and Murugiah Souppaya. 2020. Getting Ready for Post-Quantum Cryptography: Explore Challenges Associated with Adoption and Use of Post-Quantum Cryptographic Algorithms. https:\/\/csrc.nist.gov\/publications\/detail\/white-paper\/2020\/05\/26\/getting-ready-for-post-quantum-cryptography\/draft. NIST USA.","DOI":"10.6028\/NIST.CSWP.15.ipd"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2633600"},{"key":"e_1_3_2_1_5_1","volume-title":"Private queries on encrypted genomic data. BMC medical genomics","author":"Gizem S","year":"2017","unstructured":"Gizem S cC etin, Hao Chen , Kim Laine , Kristin Lauter , Peter Rindal , and Yuhou Xia . 2017. Private queries on encrypted genomic data. BMC medical genomics , Vol. 10 , 2 ( 2017 ), 45. Gizem S cC etin, Hao Chen, Kim Laine, Kristin Lauter, Peter Rindal, and Yuhou Xia. 2017. Private queries on encrypted genomic data. BMC medical genomics, Vol. 10, 2 (2017), 45."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3363207"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security ccs '17 proceedings of the 2017 acm sigsac conference on computer and communications security ed.). ACM New York NY USA 2017 1243--1255. https:\/\/www.microsoft.com\/en-us\/research\/publication\/fast-private-set-intersection-homomorphic-encryption\/  Hao Chen Kim Laine and Peter Rindal. 2017. Fast Private Set Intersection from Homomorphic Encryption. In CCS '17 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security ccs '17 proceedings of the 2017 acm sigsac conference on computer and communications security ed.). ACM New York NY USA 2017 1243--1255. https:\/\/www.microsoft.com\/en-us\/research\/publication\/fast-private-set-intersection-homomorphic-encryption\/","DOI":"10.1145\/3133956.3134061"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"e_1_3_2_1_10_1","volume-title":"Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. Journal of Cryptology","author":"Chillotti Ilaria","year":"2020","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . 2020. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. Journal of Cryptology ( 2020 ), 34--91. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. 2020. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds. Journal of Cryptology (2020), 34--91."},{"key":"e_1_3_2_1_11_1","volume-title":"TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/.","author":"Chillotti Ilaria","year":"2016","unstructured":"Ilaria Chillotti , Nicolas Gama , Mariya Georgieva , and Malika Izabach\u00e8ne . August 2016 b. TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabach\u00e8ne. August 2016 b. TFHE: Fast Fully Homomorphic Encryption Library. https:\/\/tfhe.github.io\/tfhe\/."},{"key":"e_1_3_2_1_12_1","first-page":"144","article-title":"Somewhat Practical Fully Homomorphic Encryption","volume":"2012","author":"Fan Junfeng","year":"2012","unstructured":"Junfeng Fan and Frederik Vercauteren . 2012 . Somewhat Practical Fully Homomorphic Encryption . IACR Cryptol. ePrint Arch. , Vol. 2012 (2012), 144 . Junfeng Fan and Frederik Vercauteren. 2012. Somewhat Practical Fully Homomorphic Encryption. IACR Cryptol. ePrint Arch., Vol. 2012 (2012), 144.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_16_1","volume-title":"Cryptographers' Track at the RSA Conference","author":"Halevi Shai","unstructured":"Shai Halevi , Yuriy Polyakov , and Victor Shoup . 2019. An improved RNS variant of the BFV homomorphic encryption scheme . In Cryptographers' Track at the RSA Conference . Springer , 83--105. Shai Halevi, Yuriy Polyakov, and Victor Shoup. 2019. An improved RNS variant of the BFV homomorphic encryption scheme. In Cryptographers' Track at the RSA Conference. Springer, 83--105."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_31"},{"key":"e_1_3_2_1_18_1","unstructured":"Troy Hunt. 2016. Have I been pwned. https:\/\/haveibeenpwned.com\/.  Troy Hunt. 2016. Have I been pwned. https:\/\/haveibeenpwned.com\/."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS '16 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security ccs '16 proceedings of the 2016 acm sigsac conference on computer and communications security ed.). ACM New York NY USA 2016 818--829. https:\/\/www.microsoft.com\/en-us\/research\/publication\/efficient-batched-oblivious-prf-applications-private-set-intersection\/  Vladimir Kolesnikov Ranjit Kumaresan Mike Rosulek and Ni Trieu. 2016. Efficient Batched Oblivious PRF with Applications to Private Set Intersection. In CCS '16 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security ccs '16 proceedings of the 2016 acm sigsac conference on computer and communications security ed.). ACM New York NY USA 2016 818--829. https:\/\/www.microsoft.com\/en-us\/research\/publication\/efficient-batched-oblivious-prf-applications-private-set-intersection\/","DOI":"10.1145\/2976749.2978381"},{"key":"e_1_3_2_1_20_1","unstructured":"Kim Laine. 2017. Simple encrypted arithmetic library 2.3.1. https:\/\/www. microsoft. com\/en-us\/research\/uploads\/prod\/2017\/11\/sealmanual-2--3--1.pdf .  Kim Laine. 2017. Simple encrypted arithmetic library 2.3.1. https:\/\/www. microsoft. com\/en-us\/research\/uploads\/prod\/2017\/11\/sealmanual-2--3--1.pdf ."},{"key":"e_1_3_2_1_21_1","volume-title":"Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/.","author":"Lauter Kristin","year":"2021","unstructured":"Kristin Lauter , Sreekanth Kannepalli , Kim Laine , and Radames Cruz Moreno . 2021 . Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/. Kristin Lauter, Sreekanth Kannepalli, Kim Laine, and Radames Cruz Moreno. 2021. Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354229"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_1"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1986.10022"},{"key":"e_1_3_2_1_25_1","volume-title":"Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14)","author":"Pinkas Benny","year":"2014","unstructured":"Benny Pinkas , Thomas Schneider , and Michael Zohner . 2014 . Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14) . USENIX Association, San Diego, CA, 797--812. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas Benny Pinkas, Thomas Schneider, and Michael Zohner. 2014. Faster Private Set Intersection Based on OT Extension. In 23rd USENIX Security Symposium (USENIX Security 14). USENIX Association, San Diego, CA, 797--812. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/pinkas"},{"key":"e_1_3_2_1_26_1","unstructured":"Jennifer Pullman Kurt Thomas and Elie Bursztein. 2019. Protect your accounts from data breaches with Password Checkup. https:\/\/security.googleblog.com\/2019\/02\/protect-your-accounts-from-data.html.  Jennifer Pullman Kurt Thomas and Elie Bursztein. 2019. Protect your accounts from data breaches with Password Checkup. https:\/\/security.googleblog.com\/2019\/02\/protect-your-accounts-from-data.html."},{"key":"e_1_3_2_1_27_1","volume-title":"On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation","author":"Rivest R L","year":"1978","unstructured":"R L Rivest , L Adleman , and M L Dertouzos . 1978. On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation , Academia Press ( 1978 ), 169--179. R L Rivest, L Adleman, and M L Dertouzos. 1978. On Data Banks and Privacy Homomorphisms. Foundations of Secure Computation, Academia Press (1978), 169--179."},{"key":"e_1_3_2_1_28_1","volume-title":"28th USENIX Security Symposium (USENIX Security 19)","author":"Thomas Kurt","year":"2019","unstructured":"Kurt Thomas , Jennifer Pullman , Kevin Yeo , Ananth Raghunathan , Patrick Gage Kelley , Luca Invernizzi , Borbala Benko , Tadek Pietraszek , Sarvar Patel , Dan Boneh , 2019 . Protecting accounts from credential stuffing with password breach alerting . In 28th USENIX Security Symposium (USENIX Security 19) . 1556--1571. Kurt Thomas, Jennifer Pullman, Kevin Yeo, Ananth Raghunathan, Patrick Gage Kelley, Luca Invernizzi, Borbala Benko, Tadek Pietraszek, Sarvar Patel, Dan Boneh, et al. 2019. Protecting accounts from credential stuffing with password breach alerting. In 28th USENIX Security Symposium (USENIX Security 19). 1556--1571."}],"event":{"name":"ASIA CCS '21: ACM Asia Conference on Computer and Communications Security","location":"Virtual Event Hong Kong","acronym":"ASIA CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3433210.3457535","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3433210.3457535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:12Z","timestamp":1750193292000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3433210.3457535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,24]]},"references-count":28,"alternative-id":["10.1145\/3433210.3457535","10.1145\/3433210"],"URL":"https:\/\/doi.org\/10.1145\/3433210.3457535","relation":{},"subject":[],"published":{"date-parts":[[2021,5,24]]},"assertion":[{"value":"2021-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}