{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T16:11:32Z","timestamp":1783527092583,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":58,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609376","type":"print"},{"value":"9789819609383","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-0938-3_7","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:19:45Z","timestamp":1733941185000},"page":"200-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and\u00a0Worst-Case Complexity"],"prefix":"10.1007","author":[{"given":"Saikrishna","family":"Badrinarayanan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peihan","family":"Miao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinyi","family":"Shi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Max","family":"Tromanhauser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruida","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"7_CR1","unstructured":"Google Cloud. https:\/\/cloud.google.com."},{"key":"7_CR2","unstructured":"Google Remote Procedure Call (gPRC). https:\/\/grpc.io."},{"key":"7_CR3","unstructured":"Password Monitor: Safeguarding passwords in Microsoft Edge. https:\/\/www.microsoft.com\/en-us\/research\/blog\/password-monitor-safeguarding-passwords-in-microsoft-edge\/."},{"key":"7_CR4","unstructured":"Password Monitoring \u2013 Apple Platform Security. https:\/\/support.apple.com\/en-al\/guide\/security\/sec78e79fc3b\/web."},{"key":"7_CR5","unstructured":"Privacy-Preserving Contact Tracing. https:\/\/covid19.apple.com\/contacttracing."},{"key":"7_CR6","unstructured":"Private Intersection-Sum Protocols with Applications to Attributing Aggregate Ad Conversions. https:\/\/research.google\/pubs\/pub51026\/."},{"key":"7_CR7","unstructured":"Private Join and Compute. https:\/\/github.com\/google\/private-join-and-compute."},{"key":"7_CR8","unstructured":"Protect your accounts from data breaches with Password Checkup. https:\/\/security.googleblog.com\/2019\/02\/protect-your-accounts-from-data.html."},{"key":"7_CR9","unstructured":"Technology preview: Private contact discovery for Signal. https:\/\/signal.org\/blog\/private-contact-discovery\/."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Aydin Abadi, Changyu Dong, Steven\u00a0J. Murdoch, and Sotirios Terzis. Multi-party updatable delegated private set intersection. In Ittay Eyal and Juan\u00a0A. Garay, editors, FC 2022, volume 13411 of LNCS, pages 100\u2013119. Springer, Cham, May 2022.","DOI":"10.1007\/978-3-031-18283-9_6"},{"key":"7_CR11","unstructured":"Archita Agarwal, David Cash, Marilyn George, Seny Kamara, Tarik Moataz, and Jaspal Singh. Updatable private set intersection from structured encryption. Cryptology ePrint Archive, 2024. https:\/\/eprint.iacr.org\/2024\/1183."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. More efficient oblivious transfer and extensions for faster secure computation. In Ahmad-Reza Sadeghi, Virgil\u00a0D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 535\u2013548. ACM Press, November 2013.","DOI":"10.1145\/2508859.2516738"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Giuseppe Ateniese, Emiliano De Cristofaro, and Gene Tsudik. (If) size matters: Size-hiding private set intersection. In Dario Catalano, Nelly Fazio, Rosario Gennaro, and Antonio Nicolosi, editors, PKC\u00a02011, volume 6571 of LNCS, pages 156\u2013173. Springer, Berlin, Heidelberg, March 2011.","DOI":"10.1007\/978-3-642-19379-8_10"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Saikrishna Badrinarayanan, Ranjit Kumaresan, Mihai Christodorescu, Vinjith Nagaraja, Karan Patel, Srinivasan Raghuraman, Peter Rindal, Wei Sun, and Minghua Xu. A plug-n-play framework for scaling private set intersection to billion-sized sets. In Cryptology and Network Security - 22nd International Conference, CANS 2023, Augusta, GA, USA, October 31 - November 2, 2023, Proceedings, volume 14342 of Lecture Notes in Computer Science, pages 443\u2013467. Springer, 2023.","DOI":"10.1007\/978-981-99-7563-1_20"},{"key":"7_CR15","unstructured":"Saikrishna Badrinarayanan, Peihan Miao, Xinyi Shi, Max Tromanhauser, and Ruida Zeng. Updatable private set intersection revisited: Extended functionalities, deletion, and worst-case complexity. Cryptology ePrint Archive, 2024. https:\/\/eprint.iacr.org\/2024\/1446."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Saikrishna Badrinarayanan, Peihan Miao, and Tiancheng Xie. Updatable private set intersection. PoPETs, 2022(2):378\u2013406, April 2022.","DOI":"10.2478\/popets-2022-0051"},{"key":"7_CR17","unstructured":"Alex Berke, Michiel\u00a0A. Bakker, Praneeth Vepakomma, Ramesh Raskar, Kent Larson, and Alex\u00a0\u2019Sandy\u2019 Pentland. Assessing disease exposure risk with location histories and protecting privacy: A cryptographic approach in response to A global pandemic. CoRR, abs\/2003.14412, 2020."},{"key":"7_CR18","unstructured":"Alexander Bienstock, Sarvar Patel, Joon\u00a0Young Seo, and Kevin Yeo. Near-optimal oblivious key-value stores for efficient psi, PSU and volume-hiding multi-maps. In Joseph\u00a0A. Calandrino and Carmela Troncoso, editors, 32nd USENIX Security Symposium, USENIX Security 2023, Anaheim, CA, USA, August 9-11, 2023. USENIX Association, 2023."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, and Peter Scholl. Correlated pseudorandomness from expand-accumulate codes. In Yevgeniy Dodis and Thomas Shrimpton, editors, CRYPTO\u00a02022, Part\u00a0II, volume 13508 of LNCS, pages 603\u2013633. Springer, Cham, August 2022.","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Nishanth Chandran, Divya Gupta, and Akash Shah. Circuit-PSI with linear complexity via relaxed batch OPPRF. PoPETs, 2022(1):353\u2013372, January 2022.","DOI":"10.2478\/popets-2022-0018"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Melissa Chase and Peihan Miao. Private set intersection in the internet setting from lightweight oblivious PRF. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0III, volume 12172 of LNCS, pages 34\u201363. Springer, Cham, August 2020.","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Hao Chen, Zhicong Huang, Kim Laine, and Peter Rindal. Labeled PSI from fully homomorphic encryption with malicious security. In David Lie, Mohammad Mannan, Michael Backes, and XiaoFeng Wang, editors, ACM CCS 2018, pages 1223\u20131237. ACM Press, October 2018.","DOI":"10.1145\/3243734.3243836"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Hao Chen, Kim Laine, and Peter Rindal. Fast private set intersection from homomorphic encryption. In Bhavani\u00a0M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu, editors, ACM CCS 2017, pages 1243\u20131255. ACM Press, October\u00a0\/\u00a0November 2017.","DOI":"10.1145\/3133956.3134061"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Wutichai Chongchitmate, Yuval Ishai, Steve Lu, and Rafail Ostrovsky. PSI from ring-OLE. In Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi, editors, ACM CCS 2022, pages 531\u2013545. ACM Press, November 2022.","DOI":"10.1145\/3548606.3559378"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Kelong Cong, Radames\u00a0Cruz Moreno, Mariana\u00a0Botelho da\u00a0Gama, Wei Dai, Ilia Iliashenko, Kim Laine, and Michael Rosenberg. Labeled PSI from homomorphic encryption with reduced computation and communication. In Giovanni Vigna and Elaine Shi, editors, ACM CCS 2021, pages 1135\u20131150. ACM Press, November 2021.","DOI":"10.1145\/3460120.3484760"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Geoffroy Couteau, Peter Rindal, and Srinivasan Raghuraman. Silver: Silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes. In Tal Malkin and Chris Peikert, editors, CRYPTO\u00a02021, Part\u00a0III, volume 12827 of LNCS, pages 502\u2013534, Virtual Event, August 2021. Springer, Cham.","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Emiliano De Cristofaro and Gene Tsudik. Practical private set intersection protocols with linear complexity. In Radu Sion, editor, FC 2010, volume 6052 of LNCS, pages 143\u2013159. Springer, Berlin, Heidelberg, January 2010.","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Changyu Dong, Liqun Chen, and Zikai Wen. When private set intersection meets big data: an efficient and scalable protocol. In Ahmad-Reza Sadeghi, Virgil\u00a0D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 789\u2013800. ACM Press, November 2013.","DOI":"10.1145\/2508859.2516701"},{"issue":"4","key":"7_CR29","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"Taher ElGamal. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469\u2013472, 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella, Payman Mohassel, Mike Rosulek, Saeed Sadeghian, and Jaspal Singh. Private set operations from oblivious switching. In Juan Garay, editor, PKC\u00a02021, Part\u00a0II, volume 12711 of LNCS, pages 591\u2013617. Springer, Cham, May 2021.","DOI":"10.1007\/978-3-030-75248-4_21"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Gayathri Garimella, Benny Pinkas, Mike Rosulek, Ni\u00a0Trieu, and Avishay Yanai. Oblivious key-value stores and amplification for private set intersection. In Tal Malkin and Chris Peikert, editors, CRYPTO\u00a02021, Part\u00a0II, volume 12826 of LNCS, pages 395\u2013425, Virtual Event, August 2021. Springer, Cham.","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Oded Goldreich, Silvio Micali, and Avi Wigderson. How to play any mental game or A completeness theorem for protocols with honest majority. In Alfred Aho, editor, 19th ACM STOC, pages 218\u2013229. ACM Press, May 1987.","DOI":"10.1145\/28395.28420"},{"key":"7_CR33","unstructured":"Yan Huang, David Evans, and Jonathan Katz. Private set intersection: Are garbled circuits better than custom protocols? In NDSS\u00a02012. The Internet Society, February 2012."},{"key":"7_CR34","unstructured":"Bernardo\u00a0A. Huberman, Matthew\u00a0K. Franklin, and Tad Hogg. Enhancing privacy and trust in electronic communities. In Stuart\u00a0I. Feldman and Michael\u00a0P. Wellman, editors, Proceedings of the First ACM Conference on Electronic Commerce (EC-99), Denver, CO, USA, November 3-5, 1999, pages 78\u201386. ACM, 1999."},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Mihaela Ion, Ben Kreuter, Ahmet\u00a0Erhan Nergiz, Sarvar Patel, Shobhit Saxena, Karn Seth, Mariana Raykova, David Shanahan, and Moti Yung. On deploying secure computing: Private intersection-sum-with-cardinality. In IEEE European Symposium on Security and Privacy, EuroS &P 2020, Genoa, Italy, September 7-11, 2020, pages 370\u2013389. IEEE, 2020.","DOI":"10.1109\/EuroSP48549.2020.00031"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Joe Kilian, Kobbi Nissim, and Erez Petrank. Extending oblivious transfers efficiently. In Dan Boneh, editor, CRYPTO\u00a02003, volume 2729 of LNCS, pages 145\u2013161. Springer, Berlin, Heidelberg, August 2003.","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"7_CR37","unstructured":"Daniel Kales, Christian Rechberger, Thomas Schneider, Matthias Senker, and Christian Weinert. Mobile private contact discovery at scale. In Nadia Heninger and Patrick Traynor, editors, USENIX Security 2019, pages 1447\u20131464. USENIX Association, August 2019."},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Seny Kamara, Payman Mohassel, Mariana Raykova, and Saeed Sadeghian. Scaling private set intersection to billion-element sets. In Nicolas Christin and Reihaneh Safavi-Naini, editors, Financial Cryptography and Data Security, pages 195\u2013215, Berlin, Heidelberg, 2014. Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-662-45472-5_13"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Vladimir Kolesnikov, Ranjit Kumaresan, Mike Rosulek, and Ni\u00a0Trieu. Efficient batched oblivious PRF with applications to private set intersection. In Edgar\u00a0R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew\u00a0C. Myers, and Shai Halevi, editors, ACM CCS 2016, pages 818\u2013829. ACM Press, October 2016.","DOI":"10.1145\/2976749.2978381"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Catherine Meadows. A more efficient cryptographic matchmaking protocol for use in the absence of a continuously available third party. In Proceedings of the 1986 IEEE Symposium on Security and Privacy, Oakland, California, USA, April 7-9, 1986, pages 134\u2013137. IEEE Computer Society, 1986.","DOI":"10.1109\/SP.1986.10022"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Peihan Miao, Sarvar Patel, Mariana Raykova, Karn Seth, and Moti Yung. Two-sided malicious security for private intersection-sum with cardinality. In Daniele Micciancio and Thomas Ristenpart, editors, CRYPTO\u00a02020, Part\u00a0III, volume 12172 of LNCS, pages 3\u201333. Springer, Cham, August 2020.","DOI":"10.1007\/978-3-030-56877-1_1"},{"key":"7_CR42","series-title":"LNCS","first-page":"381","volume-title":"CT-RSA 2017","author":"M Orr\u00f9","year":"2017","unstructured":"Michele Orr\u00f9, Emmanuela Orsini, and Peter Scholl. Actively secure 1-out-of-N OT extension with application to private set intersection. In Helena Handschuh, editor, CT-RSA\u00a02017, volume 10159 of LNCS, pages 381\u2013396. Springer, Cham, February 2017."},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Pascal Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT \u201999, International Conference on the Theory and Application of Cryptographic Techniques, Prague, Czech Republic, May 2-6, 1999, Proceeding, volume 1592 of Lecture Notes in Computer Science, pages 223\u2013238. Springer, 1999."},{"key":"7_CR44","doi-asserted-by":"crossref","unstructured":"Michele Orr\u00f9, Emmanuela Orsini, and Peter Scholl. Actively secure 1-out-of-N OT extension with application to private set intersection. In Helena Handschuh, editor, CT-RSA\u00a02017, volume 10159 of LNCS, pages 381\u2013396. Springer, Cham, February 2017.","DOI":"10.1007\/978-3-319-52153-4_22"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Benny Pinkas, Mike Rosulek, Ni\u00a0Trieu, and Avishay Yanai. PSI from PaXoS: Fast, malicious private set intersection. In Anne Canteaut and Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0II, volume 12106 of LNCS, pages 739\u2013767. Springer, Cham, May 2020.","DOI":"10.1007\/978-3-030-45724-2_25"},{"key":"7_CR46","unstructured":"Benny Pinkas, Thomas Schneider, Gil Segev, and Michael Zohner. Phasing: Private set intersection using permutation-based hashing. In Jaeyeon Jung and Thorsten Holz, editors, USENIX Security 2015, pages 515\u2013530. USENIX Association, August 2015."},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Benny Pinkas, Thomas Schneider, Oleksandr Tkachenko, and Avishay Yanai. Efficient circuit-based PSI with linear communication. In Yuval Ishai and Vincent Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0III, volume 11478 of LNCS, pages 122\u2013153. Springer, Cham, May 2019.","DOI":"10.1007\/978-3-030-17659-4_5"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Benny Pinkas, Thomas Schneider, Christian Weinert, and Udi Wieder. Efficient circuit-based PSI via cuckoo hashing. In Jesper\u00a0Buus Nielsen and Vincent Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0III, volume 10822 of LNCS, pages 125\u2013157. Springer, Cham, April\u00a0\/\u00a0May 2018.","DOI":"10.1007\/978-3-319-78372-7_5"},{"key":"7_CR49","unstructured":"Benny Pinkas, Thomas Schneider, and Michael Zohner. Faster private set intersection based on OT extension. In Kevin Fu and Jaeyeon Jung, editors, USENIX Security 2014, pages 797\u2013812. USENIX Association, August 2014."},{"key":"7_CR50","unstructured":"Srinivasan Raghuraman and Peter Rindal. VOLE-PSI. https:\/\/github.com\/Visa-Research\/volepsi."},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Srinivasan Raghuraman and Peter Rindal. Blazing fast PSI from improved OKVS and subfield VOLE. In Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi, editors, ACM CCS 2022, pages 2505\u20132517. ACM Press, November 2022.","DOI":"10.1145\/3548606.3560658"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Srinivasan Raghuraman, Peter Rindal, and Titouan Tanguy. Expand-convolute codes for pseudorandom correlation generators from LPN. In Helena Handschuh and Anna Lysyanskaya, editors, CRYPTO\u00a02023, Part\u00a0IV, volume 14084 of LNCS, pages 602\u2013632. Springer, Cham, August 2023.","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Mike Rosulek. Improved private set intersection against malicious adversaries. In Jean-S\u00e9bastien Coron and Jesper\u00a0Buus Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0I, volume 10210 of LNCS, pages 235\u2013259. Springer, Cham, April\u00a0\/\u00a0May 2017.","DOI":"10.1007\/978-3-319-56620-7_9"},{"key":"7_CR54","doi-asserted-by":"crossref","unstructured":"Peter Rindal and Phillipp Schoppmann. VOLE-PSI: Fast OPRF and circuit-PSI from vector-OLE. In Anne Canteaut and Fran\u00e7ois-Xavier Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0II, volume 12697 of LNCS, pages 901\u2013930. Springer, Cham, October 2021.","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher\u00a0W. Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. Path ORAM: an extremely simple oblivious RAM protocol. In Ahmad-Reza Sadeghi, Virgil\u00a0D. Gligor, and Moti Yung, editors, ACM CCS 2013, pages 299\u2013310. ACM Press, November 2013.","DOI":"10.1145\/2508859.2516660"},{"issue":"2","key":"7_CR56","first-page":"95","volume":"43","author":"N Trieu","year":"2020","unstructured":"Ni\u00a0Trieu, Kareem Shehata, Prateek Saxena, Reza Shokri, and Dawn Song. Epione: Lightweight contact tracing with strong privacy. IEEE Data Eng. Bull., 43(2):95\u2013107, 2020.","journal-title":"IEEE Data Eng. Bull."},{"key":"7_CR57","unstructured":"Xiao Wang, Alex\u00a0J. Malozemoff, and Jonathan Katz. EMP-toolkit: Efficient MultiParty computation toolkit. https:\/\/github.com\/emp-toolkit, 2016."},{"key":"7_CR58","doi-asserted-by":"crossref","unstructured":"Andrew Chi-Chih Yao. How to generate and exchange secrets (extended abstract). In 27th FOCS, pages 162\u2013167. IEEE Computer Society Press, October 1986.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:29:52Z","timestamp":1733945392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}