{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:11:00Z","timestamp":1765113060408,"version":"3.44.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032018830"},{"type":"electronic","value":"9783032018847"}],"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-01884-7_1","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T09:31:02Z","timestamp":1755336662000},"page":"3-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Round Complexity of\u00a0Black-Box Post-quantum Secure Computation"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-030-77870-5_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Agarwal","year":"2021","unstructured":"Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part I. LNCS, vol. 12696, pp. 435\u2013464. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_16"},{"key":"1_CR2","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, Part I. LNCS, vol. 12825, pp. 467\u2013496. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17"},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Khurana, D., Paneth, O.: Weak zero-knowledge beyond the black-box barrier. In: Charikar, M., Cohen, E. (eds.) 51st Annual ACM Symposium on Theory of Computing, pp. 1091\u20131102. ACM Press, Phoenix (2019).https:\/\/doi.org\/10.1145\/3313276.3316382","DOI":"10.1145\/3313276.3316382"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bostanci, J., Qian, L., Spooner, N., Yuen, H.: An efficient quantum parallel repetition theorem and applications. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024 (2024)","DOI":"10.1145\/3618260.3649603"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th Annual ACM Symposium on Theory of Computing, pp. 494\u2013503. ACM Press, Montr\u00e9al (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Liang, X., Pandey, O., Yamakawa, T.: The round complexity of black-box post-quantum secure computation. Cryptology ePrint Archive (2025)","DOI":"10.1007\/978-3-032-01884-7_1"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Chia, N., Chung, K., Liang, X., Liu, J.: The black-box simulation barrier persists in a fully quantum world. CoRR abs\/2409.06317 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2409.06317","DOI":"10.48550\/ARXIV.2409.06317"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Chia, N.H., Chung, K.M., Liang, X., Yamakawa, T.: Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0III. LNCS, vol. 13509, pp. 533\u2013563. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_18","DOI":"10.1007\/978-3-031-15982-4_18"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Chia, N.H., Chung, K.M., Liu, Q., Yamakawa, T.: On the impossibility of post-quantum black-box zero-knowledge in constant round. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 59\u201367. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00015"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, 7\u201310 February 2022, pp. 49\u201358. IEEE (2021). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00014","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-00457-5_23","volume-title":"Theory of Cryptography","author":"SG Choi","year":"2009","unstructured":"Choi, S.G., Dachman-Soled, D., Malkin, T., Wee, H.: Simple, black-box constructions of adaptively secure protocols. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 387\u2013402. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_23"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions (extended abstract). In: 29th Annual Symposium on Foundations of Computer Science, pp. 42\u201352. IEEE Computer Society Press, White Plains (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21920","DOI":"10.1109\/SFCS.1988.21920"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: 23rd Annual ACM Symposium on Theory of Computing, pp. 542\u2013552. ACM Press, New Orleans (1991). https:\/\/doi.org\/10.1145\/103418.103474","DOI":"10.1145\/103418.103474"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, 17\u201318 October, 1999, New York, NY, USA, pp. 523\u2013534. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814626","DOI":"10.1109\/SFFCS.1999.814626"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 416\u2013426. ACM Press, Baltimore (1990). https:\/\/doi.org\/10.1145\/100216.100272","DOI":"10.1145\/100216.100272"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-540-24638-1_15","volume-title":"Theory of Cryptography","author":"R Gennaro","year":"2004","unstructured":"Gennaro, R., Lysyanskaya, A., Malkin, T., Micali, S., Rabin, T.: Algorithmic tamper-proof (ATP) security: theoretical foundations for security against hardware tampering. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 258\u2013277. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_15"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993651","DOI":"10.1145\/1993636.1993651"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: 41st Annual Symposium on Foundations of Computer Science, pp. 325\u2013335. IEEE Computer Society Press, Redondo Beach (2000). https:\/\/doi.org\/10.1109\/SFCS.2000.892121","DOI":"10.1109\/SFCS.2000.892121"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A. (ed.) 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229. ACM Press, New York City (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd Annual ACM Symposium on Theory of Computing, pp. 695\u2013704. ACM Press, San Jose (2011). https:\/\/doi.org\/10.1145\/1993636.1993729","DOI":"10.1145\/1993636.1993729"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: a black-box approach. In: 53rd Annual Symposium on Foundations of Computer Science, pp. 51\u201360. IEEE Computer Society Press, New Brunswick (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.47","DOI":"10.1109\/FOCS.2012.47"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-031-38554-4_5","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"V Goyal","year":"2023","unstructured":"Goyal, V., Liang, X., Malavolta, G.: On concurrent multi-party quantum computation. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14085, pp. 129\u2013161. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_5"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-77886-6_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"AB Grilo","year":"2021","unstructured":"Grilo, A.B., Lin, H., Song, F., Vaikuntanathan, V.: Oblivious transfer Is in MiniQCrypt. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 531\u2013561. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_18"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-540-78524-8_23","volume-title":"Theory of Cryptography","author":"I Haitner","year":"2008","unstructured":"Haitner, I.: Semi-honest to malicious oblivious transfer\u2014the black-box way. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 412\u2013426. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_23"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-22792-9_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"S Hallgren","year":"2011","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical cryptographic protocols in a quantum world. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 411\u2013428. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_23"},{"issue":"3","key":"1_CR26","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s00145-010-9066-x","volume":"24","author":"D Hofheinz","year":"2010","unstructured":"Hofheinz, D.: Possibility and impossibility results for selective decommitments. J. Cryptol. 24(3), 470\u2013516 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9066-x","journal-title":"J. Cryptol."},{"key":"1_CR27","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235. IEEE Computer Society Press, Research Triangle Park (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63483","DOI":"10.1109\/SFCS.1989.63483"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st Annual ACM Symposium on Theory of Computing, pp. 44\u201361. ACM Press, Seattle (1989). https:\/\/doi.org\/10.1145\/73007.73012","DOI":"10.1145\/73007.73012"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions for secure computation. In: Kleinberg, J.M. (ed.) 38th Annual ACM Symposium on Theory of Computing, pp. 99\u2013108. ACM Press, Seattle (2006). https:\/\/doi.org\/10.1145\/1132516.1132531","DOI":"10.1145\/1132516.1132531"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th Annual ACM Symposium on Theory of Computing, pp. 21\u201330. ACM Press, San Diego (2007). https:\/\/doi.org\/10.1145\/1250790.1250794","DOI":"10.1145\/1250790.1250794"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-63715-0_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Jain","year":"2017","unstructured":"Jain, A., Kalai, Y.T., Khurana, D., Rothblum, R.: Distinguisher-dependent simulation in two rounds and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 158\u2013189. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_6"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: 20th Annual ACM Symposium on Theory of Computing, pp. 20\u201331. ACM Press, Chicago (1988).https:\/\/doi.org\/10.1145\/62212.62215","DOI":"10.1145\/62212.62215"},{"key":"1_CR34","doi-asserted-by":"publisher","unstructured":"Kilian, J.: On the complexity of bounded-interaction and noninteractive zero-knowledge proofs. In: 35th Annual Symposium on Foundations of Computer Science, pp. 466\u2013477. IEEE Computer Society Press, Santa Fe (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365744","DOI":"10.1109\/SFCS.1994.365744"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Tal, A.: Quantum-computable one-way functions without one-way functions. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC) (2025)","DOI":"10.1145\/3717823.3718144"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Liang, X., Pandey, O., Yamakawa, T.: A new approach to post-quantum non-malleability. In: 2023 IEEE 64nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00041"},{"key":"1_CR37","unstructured":"Liang, X., Pandey, O., Yamakawa, T.: A new approach to post-quantum non-malleability (2023). https:\/\/arxiv.org\/abs\/2207.05861v3"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 851\u2013859. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"1_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-21969-6_2","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"C Lunemann","year":"2011","unstructured":"Lunemann, C., Nielsen, J.B.: Fully simulatable quantum-secure coin-flipping and applications. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol. 6737, pp. 21\u201340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21969-6_2"},{"key":"1_CR40","doi-asserted-by":"publisher","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: 47th Annual Symposium on Foundations of Computer Science, pp. 367\u2013378. IEEE Computer Society Press, Berkeley (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.43","DOI":"10.1109\/FOCS.2006.43"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 96\u2013109. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_6"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: Babai, L. (ed.) 36th Annual ACM Symposium on Theory of Computing, pp. 232\u2013241. ACM Press, Chicago (2004). https:\/\/doi.org\/10.1145\/1007352.1007393","DOI":"10.1145\/1007352.1007393"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Pass, R., Rosen, A.: New and improved constructions of non-malleable cryptographic protocols. In: Gabow, H.N., Fagin, R. (eds.) 37th Annual ACM Symposium on Theory of Computing, pp. 533\u2013542. ACM Press, Baltimore (2005). https:\/\/doi.org\/10.1145\/1060590.1060670","DOI":"10.1145\/1060590.1060670"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-00457-5_24","volume-title":"Theory of Cryptography","author":"R Pass","year":"2009","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403\u2013418. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_24"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"1_CR46","doi-asserted-by":"publisher","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: 51st Annual Symposium on Foundations of Computer Science, pp. 531\u2013540. IEEE Computer Society Press, Las Vegas (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.87","DOI":"10.1109\/FOCS.2010.87"},{"issue":"8","key":"1_CR47","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1002\/j.1538-7305.1975.tb02040.x","volume":"54","author":"AD Wyner","year":"1975","unstructured":"Wyner, A.D.: The wire-tap channel. Bell Syst. Tech. J. 54(8), 1355\u20131387 (1975)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR48","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press, Toronto (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-030-64381-2_3","volume-title":"Theory of Cryptography","author":"M Zhandry","year":"2020","unstructured":"Zhandry, M.: Schr\u00f6dinger\u2019s pirate: how to trace a quantum decoder. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 61\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_3"}],"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-01884-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T14:58:49Z","timestamp":1757429929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01884-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032018830","9783032018847"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01884-7_1","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"}}]}}