{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:46:02Z","timestamp":1765107962810,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":71,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551248","type":"print"},{"value":"9789819551255","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5125-5_14","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:20Z","timestamp":1765107740000},"page":"411-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Almost-Total Puzzles and\u00a0Their Applications"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Liang","sequence":"first","affiliation":[]},{"given":"Omkant","family":"Pandey","sequence":"additional","affiliation":[]},{"given":"Yuhao","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Takashi","family":"Yamakawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. In: Karloff, H.J., Pitassi, T. (eds.) 44th ACM STOC, pp. 41\u201360. ACM Press, May 2012. https:\/\/doi.org\/10.1145\/2213977.2213983","DOI":"10.1145\/2213977.2213983"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT\u00a02021, Part\u00a0I. LNCS, vol. 12696, pp. 435\u2013464. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_16","DOI":"10.1007\/978-3-030-77870-5_16"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Ananth, P., Chung, K.M., La Placa, R.L.: On the concurrent composition of quantum zero-knowledge. In: Malkin, T., Peikert, C. (eds.) CRYPTO\u00a02021, Part\u00a0I. LNCS, vol. 12825, pp. 346\u2013374. Springer, Heidelberg, Virtual Event (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_13","DOI":"10.1007\/978-3-030-84242-0_13"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Kalai, Y.T., Khurana, D., Sahai, A.: Promise zero knowledge and its applications to round optimal MPC. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO\u00a02018, Part\u00a0II. LNCS, vol. 10992, pp. 459\u2013487. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_16","DOI":"10.1007\/978-3-319-96881-0_16"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd FOCS, pp. 106\u2013115. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959885","DOI":"10.1109\/SFCS.2001.959885"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: 34th ACM STOC, pp. 484\u2013493. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.509979","DOI":"10.1145\/509907.509979"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: 47th FOCS, pp. 345\u2013354. IEEE Computer Society Press (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.21","DOI":"10.1109\/FOCS.2006.21"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Impagliazzo, R., Naor, M.: Does parallel repetition lower the error in computationally sound protocols? In: 38th FOCS, pp. 374\u2013383. IEEE Computer Society Press (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646126","DOI":"10.1109\/SFCS.1997.646126"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Lin, H., Shmueli, O.: Non-malleable commitments against quantum attacks. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022, Part\u00a0III. LNCS, vol. 13277, pp. 519\u2013550. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_19","DOI":"10.1007\/978-3-031-07082-2_19"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) 52nd ACM STOC, pp. 269\u2013279. ACM Press (2020). https:\/\/doi.org\/10.1145\/3357713.3384324","DOI":"10.1145\/3357713.3384324"},{"key":"14_CR11","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444\u20131451 (1986)"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Broadnax, B., D\u00f6ttling, N., Hartung, G., M\u00fcller-Quade, J., Nagel, M.: Concurrently composable security with shielded super-polynomial simulators. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0I. LNCS, vol. 10210, pp. 351\u2013381. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_13","DOI":"10.1007\/978-3-319-56620-7_13"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000). https:\/\/doi.org\/10.1007\/s001459910006","journal-title":"J. Cryptol."},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: 34th ACM STOC, pp. 494\u2013503. ACM Press (2002). https:\/\/doi.org\/10.1145\/509907.509980","DOI":"10.1145\/509907.509980"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Chatterjee, R., Liang, X., Pandey, O.: Improved black-box constructions of composable secure computation. In: Czumaj, A., Dawar, A., Merelli, E. (eds.) ICALP 2020. LIPIcs, vol.\u00a0168, pp. 28:1\u201328:20. Schloss Dagstuhl (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.28","DOI":"10.4230\/LIPIcs.ICALP.2020.28"},{"key":"14_CR17","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":"14_CR18","doi-asserted-by":"publisher","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: 62nd FOCS, pp. 59\u201367. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00015","DOI":"10.1109\/FOCS52979.2021.00015"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: 62nd FOCS, pp. 49\u201358. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS52979.2021.00014","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"14_CR20","unstructured":"Choudhuri, A.R., Ciampi, M., Goyal, V., Jain, A., Ostrovsky, R.: Round optimal secure multiparty computation from minimal assumptions. Cryptology ePrint Archive, Report 2019\/216 (2019). https:\/\/eprint.iacr.org\/2019\/216"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Ciampi, M., Goyal, V., Jain, A., Ostrovsky, R.: Round optimal secure multiparty computation from minimal assumptions. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0II. LNCS, vol. 12551, pp. 291\u2013319. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_11","DOI":"10.1007\/978-3-030-64378-2_11"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Liu, F.H.: Parallel repetition theorems for interactive arguments. In: Micciancio, D. (ed.) TCC\u00a02010. LNCS, vol.\u00a05978, pp. 19\u201336. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_2","DOI":"10.1007\/978-3-642-11799-2_2"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Pass, R.: Tight parallel repetition theorems for public-coin arguments using KL-divergence. In: Dodis, Y., Nielsen, J.B. (eds.) TCC\u00a02015, Part\u00a0II. LNCS, vol.\u00a09015, pp. 229\u2013246. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_9","DOI":"10.1007\/978-3-662-46497-7_9"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Concurrent non-malleable commitments (and more) in 3 rounds. In: Robshaw, M., Katz, J. (eds.) CRYPTO\u00a02016, Part\u00a0III. LNCS, vol.\u00a09816, pp. 270\u2013299. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_10","DOI":"10.1007\/978-3-662-53015-3_10"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds. In: Kalai, Y., Reyzin, L. (eds.) TCC\u00a02017, Part\u00a0I. LNCS, vol. 10677, pp. 711\u2013742. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_24","DOI":"10.1007\/978-3-319-70500-2_24"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Four-round concurrent non-malleable commitments from one-way functions. In: Katz, J., Shacham, H. (eds.) CRYPTO\u00a02017, Part\u00a0II. LNCS, vol. 10402, pp. 127\u2013157. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_5","DOI":"10.1007\/978-3-319-63715-0_5"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Mitzenmacher, M. (ed.) 41st ACM STOC, pp. 601\u2013610. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536496","DOI":"10.1145\/1536414.1536496"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: 23rd ACM STOC, pp. 542\u2013552. ACM Press (1991). https:\/\/doi.org\/10.1145\/103418.103474","DOI":"10.1145\/103418.103474"},{"key":"14_CR29","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Yao, A.C.C. (ed.) ICS 2010, pp. 434\u2013452. Tsinghua University Press (2010)"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st FOCS, pp. 308\u2013317. IEEE Computer Society Press (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89549","DOI":"10.1109\/FSCS.1990.89549"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A.: Witness indistinguishable and witness hiding protocols. In: 22nd ACM STOC, pp. 416\u2013426. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100272","DOI":"10.1145\/100216.100272"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO\u201989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_46","DOI":"10.1007\/0-387-34805-0_46"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO\u201986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12","DOI":"10.1007\/3-540-47721-7_12"},{"key":"14_CR34","unstructured":"Folwarczn\u00fd, L., G\u00f6\u00f6s, M., Hub\u00e1\u010dek, P., Maystre, G., Yuan, W.: One-way functions vs. TFNP: simpler and improved. Cryptology ePrint Archive, Paper 2023\/945 (2023). https:\/\/eprint.iacr.org\/2023\/945"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Garg, S., Goyal, V., Jain, A., Sahai, A.: Concurrently secure computation in constant rounds. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 99\u2013116. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_8","DOI":"10.1007\/978-3-642-29011-4_8"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Garg, S., Kiyoshima, S., Pandey, O.: On the exact round complexity of self-composable two-party computation. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT\u00a02017, Part\u00a0II. LNCS, vol. 10211, pp. 194\u2013224. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_7","DOI":"10.1007\/978-3-319-56614-6_7"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Garg, S., Mukherjee, P., Pandey, O., Polychroniadou, A.: The exact round complexity of secure computation. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 448\u2013476. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_16","DOI":"10.1007\/978-3-662-49896-5_16"},{"key":"14_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Automata, Languages and Programming","author":"O Goldreich","year":"1990","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 268\u2013282. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032038"},{"key":"14_CR39","doi-asserted-by":"publisher","unstructured":"Goyal, V.: Constant round non-malleable protocols using one way functions. In: Fortnow, L., Vadhan, S.P. (eds.) 43rd ACM STOC, pp. 695\u2013704. ACM Press (2011). https:\/\/doi.org\/10.1145\/1993636.1993729","DOI":"10.1145\/1993636.1993729"},{"key":"14_CR40","doi-asserted-by":"publisher","unstructured":"Goyal, V., Lee, C.K., Ostrovsky, R., Visconti, I.: Constructing non-malleable commitments: A black-box approach. In: 53rd FOCS, pp. 51\u201360. IEEE Computer Society Press (2012). https:\/\/doi.org\/10.1109\/FOCS.2012.47","DOI":"10.1109\/FOCS.2012.47"},{"key":"14_CR41","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 1128\u20131141. ACM Press (2016). https:\/\/doi.org\/10.1145\/2897518.2897657","DOI":"10.1145\/2897518.2897657"},{"key":"14_CR42","doi-asserted-by":"publisher","unstructured":"Goyal, V., Richelson, S.: Non-malleable commitments using Goldreich-Levin list decoding. In: Zuckerman, D. (ed.) 60th FOCS, pp. 686\u2013699. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00047","DOI":"10.1109\/FOCS.2019.00047"},{"key":"14_CR43","doi-asserted-by":"publisher","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical cryptographic protocols in a quantum world. In: Rogaway, P. (ed.) CRYPTO\u00a02011. LNCS, vol.\u00a06841, pp. 411\u2013428. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_23","DOI":"10.1007\/978-3-642-22792-9_23"},{"key":"14_CR44","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J., Pass, R., Wikstr\u00f6m, D., Pietrzak, K.: An efficient parallel repetition theorem. In: Micciancio, D. (ed.) TCC\u00a02010. LNCS, vol.\u00a05978, pp. 1\u201318. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_1","DOI":"10.1007\/978-3-642-11799-2_1"},{"key":"14_CR45","doi-asserted-by":"publisher","unstructured":"Hub\u00e1cek, P., Kamath, C., Kr\u00e1l, K., Sl\u00edvov\u00e1, V.: On average-case hardness in TFNP from one-way functions. In: Pass, R., Pietrzak, K. (eds.) TCC\u00a02020, Part\u00a0III. LNCS, vol. 12552, pp. 614\u2013638. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_22","DOI":"10.1007\/978-3-030-64381-2_22"},{"key":"14_CR46","doi-asserted-by":"publisher","unstructured":"Hub\u00e1cek, P., Naor, M., Yogev, E.: The journey from NP to TFNP hardness. In: Papadimitriou, C.H. (ed.) ITCS 2017, vol.\u00a04266, pp. 60:1\u201360:21. LIPIcs, 67 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.60","DOI":"10.4230\/LIPIcs.ITCS.2017.60"},{"key":"14_CR47","doi-asserted-by":"publisher","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\u00a02017, Part\u00a0II. LNCS, vol. 10402, pp. 158\u2013189. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_6","DOI":"10.1007\/978-3-319-63715-0_6"},{"key":"14_CR48","unstructured":"Katz, J., Koo, C.Y.: On constructing universal one-way hash functions from arbitrary one-way functions. Cryptology ePrint Archive, Report 2005\/328 (2005). https:\/\/eprint.iacr.org\/2005\/328"},{"key":"14_CR49","doi-asserted-by":"publisher","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round efficiency of multi-party computation with a dishonest majority. In: Biham, E. (ed.) EUROCRYPT\u00a02003. LNCS, vol.\u00a02656, pp. 578\u2013595. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_36","DOI":"10.1007\/3-540-39200-9_36"},{"key":"14_CR50","doi-asserted-by":"publisher","unstructured":"Kiyoshima, S.: Round-efficient black-box construction of composable multi-party computation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO\u00a02014, Part\u00a0II. LNCS, vol.\u00a08617, pp. 351\u2013368. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_20","DOI":"10.1007\/978-3-662-44381-1_20"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Kiyoshima, S.: Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness. In: Nissim, K., Waters, B. (eds.) TCC\u00a02021, Part\u00a0I. LNCS, vol. 13042, pp. 369\u2013400. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_13","DOI":"10.1007\/978-3-030-90459-3_13"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Lapidot, D., Shamir, A.: Publicly verifiable non-interactive zero-knowledge proofs. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO\u201990. LNCS, vol.\u00a0537, pp. 353\u2013365. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_26","DOI":"10.1007\/3-540-38424-3_26"},{"key":"14_CR53","unstructured":"Liang, X., Pandey, O., Tang, Y., Yamakawa, T.: Almost-total puzzles and their applications. Cryptology ePrint Archive, Paper 2025\/949 (2025). https:\/\/eprint.iacr.org\/2025\/949"},{"key":"14_CR54","doi-asserted-by":"publisher","unstructured":"Liang, X., Pandey, O., Yamakawa, T.: A new approach to post-quantum non-malleability. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 568\u2013579. IEEE Computer Society, Los Alamitos, CA, USA (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00041. https:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS57990.2023.00041","DOI":"10.1109\/FOCS57990.2023.00041"},{"key":"14_CR55","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: how to do quantum rewinding undetectably. In: 63rd FOCS, pp. 851\u2013859. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00086","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"14_CR56","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":"14_CR57","doi-asserted-by":"publisher","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theor. Comput. Sci. 81(2), 317\u2013324 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90200-L","DOI":"10.1016\/0304-3975(91)90200-L"},{"key":"14_CR58","doi-asserted-by":"publisher","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: 47th FOCS, pp. 367\u2013378. IEEE Computer Society Press (2006). https:\/\/doi.org\/10.1109\/FOCS.2006.43","DOI":"10.1109\/FOCS.2006.43"},{"key":"14_CR59","doi-asserted-by":"publisher","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: 21st ACM STOC, pp. 33\u201343. ACM Press (1989). https:\/\/doi.org\/10.1145\/73007.73011","DOI":"10.1145\/73007.73011"},{"key":"14_CR60","doi-asserted-by":"publisher","unstructured":"Pandey, O., Pass, R., Vaikuntanathan, V.: Adaptive one-way functions and applications. In: Wagner, D. (ed.) CRYPTO\u00a02008. LNCS, vol.\u00a05157, pp. 57\u201374. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_4","DOI":"10.1007\/978-3-540-85174-5_4"},{"key":"14_CR61","doi-asserted-by":"publisher","unstructured":"Papadimitriou, C.H.: On the complexity of the parity argument and other inefficient proofs of existence. J. Comput. Syst. Sci. 48(3), 498\u2013532 (1994). https:\/\/doi.org\/10.1016\/S0022-0000(05)80063-7","DOI":"10.1016\/S0022-0000(05)80063-7"},{"key":"14_CR62","doi-asserted-by":"publisher","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT\u00a02003. LNCS, vol.\u00a02656, pp. 160\u2013176. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_10","DOI":"10.1007\/3-540-39200-9_10"},{"key":"14_CR63","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 ACM STOC, pp. 533\u2013542. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060670","DOI":"10.1145\/1060590.1060670"},{"key":"14_CR64","doi-asserted-by":"publisher","unstructured":"Pass, R., Venkitasubramaniam, M.: Is it easier to prove theorems that are guaranteed to be true? In: 61st FOCS, pp. 1255\u20131267. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00119","DOI":"10.1109\/FOCS46700.2020.00119"},{"key":"14_CR65","doi-asserted-by":"publisher","unstructured":"Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC\u00a02009. LNCS, vol.\u00a05444, pp. 403\u2013418. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_24","DOI":"10.1007\/978-3-642-00457-5_24"},{"key":"14_CR66","doi-asserted-by":"publisher","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: Babai, L. (ed.) 36th ACM STOC, pp. 242\u2013251. ACM Press (2004). https:\/\/doi.org\/10.1145\/1007352.1007394","DOI":"10.1145\/1007352.1007394"},{"key":"14_CR67","doi-asserted-by":"publisher","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: 22nd ACM STOC, pp. 387\u2013394. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100269","DOI":"10.1145\/100216.100269"},{"key":"14_CR68","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT\u00a02012. LNCS, vol.\u00a07237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10","DOI":"10.1007\/978-3-642-29011-4_10"},{"key":"14_CR69","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II. LNCS, vol.\u00a09666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18","DOI":"10.1007\/978-3-662-49896-5_18"},{"key":"14_CR70","doi-asserted-by":"publisher","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: Kleinberg, J.M. (ed.) 38th ACM STOC, pp. 296\u2013305. ACM Press (2006). https:\/\/doi.org\/10.1145\/1132516.1132560","DOI":"10.1145\/1132516.1132560"},{"key":"14_CR71","doi-asserted-by":"publisher","unstructured":"Wee, H.: Black-box, round-efficient secure computation via non-malleability amplification. In: 51st FOCS, pp. 531\u2013540. IEEE Computer Society Press (2010). https:\/\/doi.org\/10.1109\/FOCS.2010.87","DOI":"10.1109\/FOCS.2010.87"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5125-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:22Z","timestamp":1765107742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5125-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551248","9789819551255"],"references-count":71,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5125-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","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":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}