{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:06:04Z","timestamp":1757624764632,"version":"3.44.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018779"},{"type":"electronic","value":"9783032018786"}],"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-032-01878-6_18","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T18:09:07Z","timestamp":1755367747000},"page":"545-574","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Cryptography and\u00a0Meta-Complexity"],"prefix":"10.1007","author":[{"given":"Taiga","family":"Hiroka","sequence":"first","affiliation":[]},{"given":"Tomoyuki","family":"Morimae","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Arkhipov, A.: The computational complexity of linear optics. In: Fortnow, L., Vadhan, S.P. (eds.), 43rd ACM STOC, pp. 333\u2013342. ACM Press, June 2011","DOI":"10.1145\/1993636.1993682"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Aaronson, S.: BQP and the polynomial hierarchy. In: Schulman, L.J. (ed.), 42nd ACM STOC, pp. 141\u2013150. ACM Press, June 2010","DOI":"10.1145\/1806689.1806711"},{"key":"18_CR3","unstructured":"Aaronson, S., Chen, L.: Complexity-theoretic foundations of quantum supremacy experiments. In: CCC\u201917: Proceedings of the 32nd Computational Complexity Conference, 2017"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Arora, A.S., Coladangelo, A., Coudron, M., Gheorghiu, A., Singh, U., Waldner, H.: Quantum depth in the random oracle model. In: Saha, B., Servedio, R.A. (eds.), 55th ACM STOC, pp. 1111\u20131124. ACM Press, June 2023","DOI":"10.1145\/3564246.3585153"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-030-64834-3_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"N Alamati","year":"2020","unstructured":"Alamati, N., De Feo, L., Montgomery, H., Patranabis, S.: Cryptographic group actions and applications. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 411\u2013439. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_14"},{"key":"18_CR6","unstructured":"Aaronson, S., Gunn, S.: On the classical hardness of spoofing linear cross-entropy benchmarking, 2019. arXiv:1910.12085"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P., Gulati, A., Qian, L., Yuen, H.: Pseudorandom (function-like) quantum state generators: new definitions and applications. In: Kiltz, E., Vaikuntanathan, V. (eds.) Theory of Cryptography. TCC 2022. LNCS, vol. 13747, pp. 237\u2013265. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_9","DOI":"10.1007\/978-3-031-22318-1_9"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, May 1996","DOI":"10.1145\/237814.237838"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. LNCS, vol. 13507,pp. 208\u2013236. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_8","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-84242-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: One-way functions imply secure computation in a quantum world. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 467\u2013496. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. J. ACM 68(5), 31:1\u201331:47 (2021)","DOI":"10.1145\/3441309"},{"key":"18_CR12","unstructured":"Brakerski, Z., Canetti, R., Qian, L.: On the computational hardness needed for quantum cryptography. In: Kalai, Y.T. (ed.), 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, 10\u201313 January 2023, MIT, Cambridge, Massachusetts, USA, volume 251 of LIPIcs, pp. 24:1\u201324:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2023"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1038\/s41567-018-0318-2","volume":"15","author":"A Bouland","year":"2019","unstructured":"Bouland, A., Fefferman, B., Nirkhe, C., Vazirani, U.: On the complexity and verification of quantum random circuit sampling. Nat. Phys. 15, 159\u2013163 (2019)","journal-title":"Nat. Phys."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Batra, R., Jain, R.: Commitments are equivalent to statistically-verifiable one-way state generators, 2024","DOI":"10.1109\/FOCS61266.2024.00077"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1098\/rspa.2010.0301","volume":"467","author":"MJ Bremner","year":"2011","unstructured":"Bremner, M.J., Jozsa, R., Shepherd, D.J.: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proc. R. Soc. A: Math. Phys. Eng. Sci. 467, 459\u2013472 (2011)","journal-title":"Proc. R. Soc. A: Math. Phys. Eng. Sci."},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.117.080501","volume":"117","author":"MJ Bremner","year":"2016","unstructured":"Bremner, M.J., Montanaro, A., Shepherd, D.J.: Average-case complexity versus approximate simulation of commuting quantum computations. Phys. Rev. Lett. 117, 080501 (2016)","journal-title":"Phys. Rev. Lett."},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Brassard, G., Yung, M.: One-way group actions. In: Menezes, A.J., Vanstone, S.A. (eds.) Advances in Cryptology-CRYPTO\u2019 90. CRYPTO 1990. LNCS, vol. 537, pp. 94\u2013107. Springer, Berlin, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_7","DOI":"10.1007\/3-540-38424-3_7"},{"key":"18_CR18","doi-asserted-by":"publisher","unstructured":"Chung, KM., Goldin, E., Gray, M.: On central primitives for quantum cryptography with classical communication. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. CRYPTO 2024. LNCS, vol. 14926, pp. 215\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_8","DOI":"10.1007\/978-3-031-68394-7_8"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Cavalar, B.P., Goldin, E., Gray, M., Hall, P.: A meta-complexity characterization of quantum cryptography, 2024","DOI":"10.1007\/978-3-031-91098-2_4"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16(3), 407\u2013422 (1969)","DOI":"10.1145\/321526.321530"},{"key":"18_CR21","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive, Paper 2006\/291, 2006"},{"issue":"6","key":"18_CR22","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.200502","volume":"120","author":"K Fujii","year":"2018","unstructured":"Fujii, K., Kobayashi, H., Morimae, T., Nishimura, H., Tani, S., Tamate, S.: Impossibility of classically simulating one-clean-qubit model with multiplicative error. Phys. Rev. Lett. 120, 200502 (2018)","journal-title":"Phys. Rev. Lett."},{"key":"18_CR24","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: On the cryptographic applications of random functions (extended abstract). In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology. CRYPTO 1984. LNCS, vol. 196, pp. 276\u2013288. Springer, Berlin, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_22","DOI":"10.1007\/3-540-39568-7_22"},{"issue":"4","key":"18_CR25","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Grilo, A.B., Lin, H., Song, F., Vaikuntanathan, V.: Oblivious transfer is in MiniQCrypt. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2021. EUROCRYPT 2021. LNCS, vol. 12697, pp. 531\u2013561. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_18","DOI":"10.1007\/978-3-030-77886-6_18"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28, 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Ilango, R., Lu, Z., Nanashima, M., Oliveira, I.C.: A duality between one-way functions and average-case symmetry of information. In: Saha, B., Servedio, R.A. (eds.), 55th ACM STOC, pp. 1039\u20131050. ACM Press, June 2023","DOI":"10.1145\/3564246.3585138"},{"issue":"4","key":"18_CR29","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Hirahara, S.: Capturing one-way functions via NP-hardness of meta-complexity. In: Saha, B., Servedio, R.A. (eds.), 55th ACM STOC, pp. 1027\u20131038. ACM Press, June 2023","DOI":"10.1145\/3564246.3585130"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Nanashima, M.: Learning in pessiland via inductive inference. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 447\u2013457, 2023","DOI":"10.1109\/FOCS57990.2023.00033"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th FOCS, pp. 230\u2013235. IEEE Computer Society Press, October\/November 1989","DOI":"10.1109\/SFCS.1989.63483"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A.: No better ways to generate hard NP instances than picking uniformly at random. In: 31st FOCS, pp. 812\u2013821. IEEE Computer Society Press, October 1990","DOI":"10.1109\/FSCS.1990.89604"},{"key":"18_CR34","unstructured":"Ilango, R., Ren, H., Santhanam, R.: Hardness on any samplable distribution suffices: New characterizations of one-way functions by meta-complexity. Electron. Colloquium Comput. Complex., TR21-082, 2021"},{"key":"18_CR35","doi-asserted-by":"publisher","unstructured":"Ji, Z., Liu, Y.K., Song, F.: Pseudorandom quantum states. In: Shacham, H., Boldyreva, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2018. CRYPTO 2018. LNCS, vol. 10993, pp. 126\u2013152. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_5","DOI":"10.1007\/978-3-319-96878-0_5"},{"key":"18_CR36","doi-asserted-by":"publisher","unstructured":"Ji, Z., Qiao, Y., Song, F., Yun, A.: General linear group action on tensors: a candidate for post-quantum cryptography. In: Hofheinz, D., Rosen, A. (eds.) Theory of Cryptography. TCC 2019. LNCS, vol. 11891, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_11","DOI":"10.1007\/978-3-030-36030-6_11"},{"key":"18_CR37","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"A Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2, 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Saha, B., Servedio, R.A. (eds.), 55th ACM STOC, pp. 1589\u20131602. ACM Press, June 2023","DOI":"10.1145\/3564246.3585225"},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Tal, A.: Quantum-computable one-way functions without one-way functions, 2024","DOI":"10.1145\/3717823.3718144"},{"key":"18_CR40","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: Hsieh, M.-H. (ed.), 16th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2021), volume 197 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 2:1\u20132:20, Dagstuhl, Germany, 2021. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Khurana, D., Tomer, K.: Commitments from quantum one-wayness. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.), 56th ACM STOC, pp. 968\u2013978. ACM Press, June 2024","DOI":"10.1145\/3618260.3649654"},{"key":"18_CR42","unstructured":"Khurana, D., Tomer, K.: Founding quantum cryptography on quantum advantage, or, towards cryptography from $$\\#\\sf P$$-hardness. Cryptology ePrint Archive, Paper 2024\/1490, 2024"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Wright, J.: A one-query lower bound for unitary synthesis and breaking quantum cryptography. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.), 56th ACM STOC, pages 979\u2013990. ACM Press, June 2024","DOI":"10.1145\/3618260.3649650"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and kolmogorov complexity. In: 61st FOCS, pp. 1243\u20131254. IEEE Computer Society Press, November 2020","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"18_CR45","doi-asserted-by":"publisher","unstructured":"Liu, Y., Pass, R.: On the possibility of basing cryptography on $${\\sf EXP} \\ne {\\sf BPP }$$. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology \u2013 CRYPTO 2021. CRYPTO 2021. LNCS, vol. 12825, pp. 11\u201340. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_2","DOI":"10.1007\/978-3-030-84242-0_2"},{"key":"18_CR46","doi-asserted-by":"publisher","unstructured":"Liu, Y., Pass, R.: One-way functions and the hardness of (probabilistic) time-bounded kolmogorov complexity w.r.t. samplable distributions. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. CRYPTO 2023. LNCS, vol. 14082, pp. 645\u2013673. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_21","DOI":"10.1007\/978-3-031-38545-2_21"},{"key":"18_CR47","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 4th edition. Texts in Computer Science. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-0-387-49820-1","DOI":"10.1007\/978-0-387-49820-1"},{"key":"18_CR48","unstructured":"Ma, F., Huang, H.Y.: How to construct random unitaries. Cryptology ePrint Archive, Paper 2024\/1652, 2024"},{"key":"18_CR49","doi-asserted-by":"crossref","unstructured":"Morimae, T., Shirakawa, Y., Yamakawa, T.: Cryptographic characterization of quantum advantage. arXiv:2410.00499, 2024","DOI":"10.1145\/3717823.3718133"},{"key":"18_CR50","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022. CRYPTO 2022. LNCS, vol. 13507, pp. 269\u2013295. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_10","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"18_CR51","unstructured":"Morimae, T., Yamakawa, T.: One-wayness in quantum cryptography. In: Magniez, F., Grilo, A.B. (eds.), 19th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2024, 9\u201313 September 2024, Okinawa, Japan, volume 310 of LIPIcs, pp. 4:1\u20134:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2024"},{"key":"18_CR52","doi-asserted-by":"publisher","unstructured":"Morimae, T., Yamakawa, T.: Quantum advantage from one-way functions. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024. CRYPTO 2024. LNCS, vol. 14924, pp. 359\u2013392. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68388-6_13","DOI":"10.1007\/978-3-031-68388-6_13"},{"key":"18_CR53","doi-asserted-by":"publisher","unstructured":"Naor, M.: Bit commitment using pseudo-randomness. In: Brassard, G. (eds.) Advances in Cryptology \u2013 CRYPTO\u2019 89 Proceedings. CRYPTO 1989. LNCS, vol. 435, pp. 128\u2013136. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_13","DOI":"10.1007\/0-387-34805-0_13"},{"key":"18_CR54","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: 22nd ACM STOC, pp. 387\u2013394. ACM Press, May 1990","DOI":"10.1145\/100216.100269"},{"key":"18_CR55","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 35th FOCS, pp. 124\u2013134. IEEE Computer Society Press, November 1994","DOI":"10.1109\/SFCS.1994.365700"},{"key":"18_CR56","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.R.: A formal theory of inductive inference. Part i. Inf. Control 7, 1\u201322 (1964)","DOI":"10.1016\/S0019-9958(64)90223-2"},{"issue":"2","key":"18_CR57","first-page":"134","volume":"4","author":"BM Terhal","year":"2004","unstructured":"Terhal, B.M., DiVincenzo, D.P.: Adaptive quantum computation, constant-depth circuits and arthur-merlin games. Quant. Inf. Comput. 4(2), 134\u2013145 (2004)","journal-title":"Quant. Inf. Comput."},{"key":"18_CR58","doi-asserted-by":"publisher","unstructured":"Yan, J.: General properties of quantum bit commitments (extended abstract). In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. ASIACRYPT 2022. LNCS, vol. 13794, pp. 628\u2013657. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_22","DOI":"10.1007\/978-3-031-22972-5_22"},{"key":"18_CR59","doi-asserted-by":"crossref","unstructured":"Yamakawa, T., Zhandry, M.: Verifiable quantum advantage without structure. J. ACM 71(3) (2024)","DOI":"10.1145\/3658665"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01878-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:11:04Z","timestamp":1757430664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01878-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018779","9783032018786"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01878-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}