{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:01:04Z","timestamp":1783008064994,"version":"3.54.5"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031918285","type":"print"},{"value":"9783031918292","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-3-031-91829-2_3","type":"book-chapter","created":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:30:16Z","timestamp":1746516616000},"page":"76-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Permutation Correlations and\u00a0Batched Random Access for\u00a0Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Stanislav","family":"Peceny","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srinivasan","family":"Raghuraman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Rindal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Harshal","family":"Shah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,5,5]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: CCS 2016, pp. 805-817. Association for Computing Machinery, New York (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Asharov, G., et al.: Efficient secure three-party sorting with applications to data analysis and heavy hitters. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 125-138. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3548606.3560691"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Pranav\u00a0Shriram, A., Koti, N., Kukkala, V.B., Patra, A., Gopal, B.R., Sangal, S.: Ruffle: Rapid 3-party shuffle protocols. In: PoPETS 2023, pp. 24\u201342 (2023)","DOI":"10.56553\/popets-2023-0068"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Alamati, N., Policharla, G.V., Raghuraman, S., Rindal, P.: Improved alternating moduli prfs and post-quantum signatures. In: Advances in Cryptology \u2013 CRYPTO (2024)","DOI":"10.1007\/978-3-031-68397-8_9"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-46800-5_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Rechberger, C., Schneider, T., Tiessen, T., Zohner, M.: Ciphers for MPC and FHE. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 430\u2013454. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_17"},{"key":"3_CR6","unstructured":"Blunk, M., Bunn, P., Dittmer, S., Lu, S., Ostrovsky, R.: Secure merge in linear time and O(log log N) rounds. Cryptology ePrint Archive, Report 2022\/590 (2022). https:\/\/eprint.iacr.org\/2022\/590"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round ot extension and silent non-interactive secure computation. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, pp. 291-308. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: Silent OT extension and more. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E. et al.: Correlated Pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. LNCS, vol. 13508. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E. et al.: Oblivious transfer with constant computational overhead. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2023. EUROCRYPT 2023. LNCS, vol. 14004. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_10","DOI":"10.1007\/978-3-031-30545-0_10"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-662-49099-0_7","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: Oblivious parallel RAM and applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 175\u2013204. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_7"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Das, S., Garimella, G., Raghuraman, S., Rindal, P.: Secret-shared joins with multiplicity from aggregation trees. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, pp. 209-222. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3548606.3560670"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1641","DOI":"10.1002\/j.1538-7305.1964.tb04103.x","volume":"43","author":"VE Benes","year":"1964","unstructured":"Benes, V.E.: Optimal rearrangeable multistage connecting networks. Bell Syst. Tech. J. 43(4), 1641\u20131656 (1964)","journal-title":"Bell Syst. Tech. J."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"3_CR15","series-title":"Part II, volume 11240 of LNCS","first-page":"699","volume-title":"TCC 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., Ishai, Y., Passel\u00e8gue, A., Sahai, A., David, J.W.: Exploring crypto dark matter: new simple PRF candidates and their applications. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. Part II, volume 11240 of LNCS, pp. 699\u2013729. Springer, Heidelberg (2018)"},{"key":"3_CR16","unstructured":"Cao, X., et al.: Towards practical oblivious map. Cryptology ePrint Archive, Paper 2024\/1650 (2024)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-030-64840-4_12","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Chase","year":"2020","unstructured":"Chase, M., Ghosh, E., Poburinnaya, O.: Secret-shared shuffle. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 342\u2013372. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_12"},{"key":"3_CR18","unstructured":"Chida, K., Hamada, K., Ikarashi, D., Kikuchi, R., Kiribuchi, N., Pinkas, B.: An efficient secure three-party sorting protocol with an honest majority. Cryptology ePrint Archive, Paper 2019\/695(2019). https:\/\/eprint.iacr.org\/2019\/695"},{"key":"3_CR19","unstructured":"Chandran, G.R., Schneider, T., Stillger, M., Weinert, C.: Concretely efficient private set union via circuit-based PSI. IACR Cryptol. ePrint Arch., pp. 1494 (2024)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Doerner, J., Evans, D., Shelat, A.: Secure stable matching at scale. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 1602\u20131613. ACM Press (October 2016)","DOI":"10.1145\/2976749.2978373"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-030-84259-8_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Dinur","year":"2021","unstructured":"Dinur, I., et al.: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 517\u2013547. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_18"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Doerner, J., Shelat, A.: Scaling oram for secure computation. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, pp. 523-535. Association for Computing Machinery, New York (2017)","DOI":"10.1145\/3133956.3133967"},{"key":"3_CR23","unstructured":"Durak, F.B., Weng, C., Anderson, E., Laine, K., Chase, M.: Precio: Private aggregate measurement via oblivious shuffling. Cryptology ePrint Archive, Paper 2021\/1490 (2021)"},{"key":"3_CR24","unstructured":"Brett\u00a0Hemenway Falk and Rafail Ostrovsky. Secure merge with $${O}(n \\log \\log n)$$ secure operation. Cryptology ePrint Archive, Report 2020\/807, 2020. https:\/\/eprint.iacr.org\/2020\/807"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed Point Functions and Their Applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"3_CR26","series-title":"Part II, volume 12711 of LNCS","first-page":"591","volume-title":"PKC 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Mohassel, P., Rosulek, M., Sadeghian, S., Singh, J.: Private set operations from oblivious switching. In: Garay, J. (ed.) PKC 2021. Part II, volume 12711 of LNCS, pp. 591\u2013617. Springer, Heidelberg (2021)"},{"key":"3_CR27","series-title":"LNCS","first-page":"171","volume-title":"CRYPTO\u201986","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. LNCS, vol. 263, pp. 171\u2013185. Springer, Heidelberg (1987)"},{"key":"3_CR28","unstructured":"Garimella, G., Raghuramam, S., Rindal, P.: Distributional secure merge. Cryptology ePrint Archive, Paper 2024\/1048 (2024)"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-37682-5_15","volume-title":"Information Security and Cryptology \u2013 ICISC 2012","author":"K Hamada","year":"2013","unstructured":"Hamada, K., Kikuchi, R., Ikarashi, D., Chida, K., Takahashi, K.: Practically efficient multi-party sorting protocols from comparison sort algorithms. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol. 7839, pp. 202\u2013216. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37682-5_15"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"Heath, D., Kolesnikov, V., Ostrovsky, R.: Tri-state circuits. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14084. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_5","DOI":"10.1007\/978-3-031-38551-3_5"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Han, F., Zhang, L., Feng, H., Liu, W., Li, X.-Y.: Scape: scalable collaborative analytics system on private database with malicious security. In: 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, 9-12 May 2022, pp. 1740\u20131753. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00176"},{"key":"3_CR32","unstructured":"Juvekar, C., Vaikuntanathan, V., Chandrakasan, A.P.: GAZELLE: a low latency framework for secure neural network inference. In: Enck, W., Felt, A.P. (eds.) 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, 15-17 August 2018, pp. 1651\u20131669. USENIX Association (2018)"},{"key":"3_CR33","unstructured":"Kim, J., Lee, H.T., Son, Y.: Revisiting shuffle-based private set unions with reduced communication. Cryptology ePrint Archive, Paper 2024\/1560 (2024)"},{"key":"3_CR34","unstructured":"Kluczniak, K,: Circuit privacy for fhew\/tfhe-style fully homomorphic encryption in practice. Cryptology ePrint Archive, Paper 2022\/1459 (2022). https:\/\/eprint.iacr.org\/2022\/1459"},{"key":"3_CR35","unstructured":"Karmakar, B., Murthy, S., Patra, A., Paul, P.: Quickpool: Privacy-preserving ride-sharing service. IACR Cryptol. ePrint Arch., p. 1109 (2024)"},{"key":"3_CR36","unstructured":"Lindell, Y.: How to simulate it - a tutorial on the simulation proof technique. Cryptology ePrint Archive, Paper 2016\/046 (2016). https:\/\/eprint.iacr.org\/2016\/046"},{"key":"3_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-38348-9_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Lu","year":"2013","unstructured":"Lu, S., Ostrovsky, R.: How to garble RAM programs? In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 719\u2013734. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_42"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63715-0_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"S Lu","year":"2017","unstructured":"Lu, S., Ostrovsky, R.: Black-box parallel garbled RAM. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 66\u201392. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_3"},{"key":"3_CR39","unstructured":"Luo, O., Wang, Y., Dong, W., Yi, K.: Secure query processing with linear complexity. CoRR, abs\/ arXiv: 2403.13492 (2024)"},{"key":"3_CR40","unstructured":"Liu, H., Wang, X., Yang, K., Yu, Y.: The hardness of LPN over any integer ring and field for PCG applications. Cryptology ePrint Archive, Report 2022\/712 (2022). https:\/\/eprint.iacr.org\/2022\/712"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Malewicz, G., et al.: Pregel: a system for large-scale graph processing. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, pp. 135-146. Association for Computing Machinery, New York (2010)","DOI":"10.1145\/1807167.1807184"},{"key":"3_CR42","unstructured":"Mohassel, P., Rindal, P.: Aby3: A mixed protocol framework for machine learning. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, pp. 35-52. Association for Computing Machinery, New York (2018)"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Mohassel, P., Rindal, P., Rosulek, M.: Fast database joins and PSI for secret shared data. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1271\u20131287. ACM Press (November 2020)","DOI":"10.1145\/3372297.3423358"},{"key":"3_CR44","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-38348-9_33","volume-title":"EUROCRYPT 2013","author":"Payman Mohassel and Seyed Saeed Sadeghian","year":"2013","unstructured":"Payman Mohassel and Seyed Saeed Sadeghian: How to hide circuits in MPC an efficient framework for private function evaluation. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 557\u2013574. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_33"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Nayak, K., Wang, X.S., Ioannidis, S., Weinsberg, U., Taft, N., Shi, E.: GraphSC: parallel secure computation made easy. In: 2015 IEEE Symposium on Security and Privacy, pp. 377\u2013394. IEEE Computer Society Press (May 2015)","DOI":"10.1109\/SP.2015.30"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Ostrovsky, B.: Privacy-preserving dijkstra. Cryptology ePrint Archive, Paper 2024\/988 (2024)","DOI":"10.1007\/978-3-031-68400-5_3"},{"key":"3_CR47","doi-asserted-by":"publisher","unstructured":"Park, A., Lin, WK., Shi, E.: Nanogram: Garbled ram with o(log n) overhead. page 456-486. Springer-Verlag, Berlin (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_16","DOI":"10.1007\/978-3-031-30545-0_16"},{"key":"3_CR48","unstructured":"Rindal, L.R.P.: libOTe: an efficient, portable, and easy to use Oblivious Transfer Library. https:\/\/github.com\/osu-crypto\/libOTe"},{"key":"3_CR49","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14084. Springer, Cham (2023).https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Song, X., Yin, D., Bai, J., Dong, C., Chang, E.-C.: Secret-shared shuffle with malicious security. Cryptology ePrint Archive, Paper 2023\/1794 (2023)","DOI":"10.14722\/ndss.2024.24021"},{"key":"3_CR51","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-62576-4_15","volume-title":"ACISP 21","author":"H Tsuchida","year":"2021","unstructured":"Tsuchida, H., Nishide, T.: Private decision tree evaluation with constant rounds via (only) fair SS-4PC. In: Baek, J., Ruj, S. (eds.) ACISP 21. LNCS, vol. 13083, pp. 309\u2013329. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-62576-4_15"},{"key":"3_CR52","doi-asserted-by":"crossref","unstructured":"Wang, X., Chan, H., Shi, E.: Circuit oram: on tightness of the goldreich-ostrovsky lower bound. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015, page 850-861. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2810103.2813634"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Yang, Y., Peceny, S., Heath, D., Kolesnikov, V.: Towards generic mpc compilers via variable instruction set architectures (visas). In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, CCS 2023, pp. 2516-2530. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3576915.3616664"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91829-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:31:23Z","timestamp":1746516683000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91829-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031918285","9783031918292"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91829-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"R\u00f8ros","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}