{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:45:59Z","timestamp":1765107959640,"version":"3.46.0"},"publisher-location":"Singapore","reference-count":42,"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_6","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:13Z","timestamp":1765107733000},"page":"165-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Split-State Quantum Tamper Detection"],"prefix":"10.1007","author":[{"given":"Thiago","family":"Bergamaschi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naresh Goud","family":"Boddu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"6_CR1","unstructured":"Aaronson, S., Atia, Y., Susskind, L.: On the hardness of detecting macroscopic superpositions. Electron. Colloquium Comput. Complex. TR20 (2020)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Boddu, N.G., Jain, R.: Quantum secure non-malleable-codes in the split-state model (2022). arXiv:2202.13354","DOI":"10.3390\/e24081038"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/978-3-030-26951-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Aggarwal","year":"2019","unstructured":"Aggarwal, D., et al.: Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 510\u2013539. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_18"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. SIAM J. Comput. 47(2), 524\u2013546 (2018). https:\/\/doi.org\/10.1137\/140985251, preliminary version in STOC 2014","DOI":"10.1137\/140985251"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Kanukurthi, B., Obbattu, S.L.B., Obremski, M., Sekar, S.: Rate one-third non-malleable codes. In: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022, pp. 1364\u20131377. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3519935.3519972","DOI":"10.1145\/3519935.3519972"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Aggarwal, D., Obremski, M.: A constant rate non-malleable code in the split-state model. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1285\u20131294. IEEE Computer Society, Los Alamitos, CA, USA (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00122. https:\/\/doi.ieeecomputersociety.org\/10.1109\/FOCS46700.2020.00122","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"6_CR7","unstructured":"Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: International Conference on Supercomputing (2008)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-63715-0_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"G Alagic","year":"2017","unstructured":"Alagic, G., Majenz, C.: Quantum non-malleability and authentication. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 310\u2013341. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_11"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Bouda, J., Winter, A.: Nonmalleable encryption of quantum information. J. Math. Phys. 50(4), 042106 (2009). https:\/\/doi.org\/10.1063\/1.3094756","DOI":"10.1063\/1.3094756"},{"key":"6_CR10","unstructured":"Anshu, A., Nirkhe, C.: Circuit lower bounds for low-energy states of quantum code hamiltonians. arXiv abs\/2011.02044 (2020). https:\/\/api.semanticscholar.org\/CorpusID:226299885"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-030-17653-2_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Badrinarayanan","year":"2019","unstructured":"Badrinarayanan, S., Srinivasan, A.: Revisiting non-malleable secret sharing. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 593\u2013622. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_20"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Barnum, H., Cr\u00e9peau, C., Gottesman, D., Smith, A.D., Tapp, A.: Authentication of quantum messages. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 449\u2013458 (2001)","DOI":"10.1109\/SFCS.2002.1181969"},{"key":"6_CR13","unstructured":"Batra, R., Boddu, N.G., Jain, R.: Quantum secure non-malleable randomness encoder and its applications (2023)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Bergamaschi, T.: Pauli manipulation detection codes and applications to quantum communication over adversarial channels (2023)","DOI":"10.1007\/978-3-031-58734-4_14"},{"key":"6_CR15","unstructured":"Bergamaschi, T., Boddu, N.G.: On split-state quantum tamper detection and non-malleability (2023)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Boddu, N.G., Goyal, V., Jain, R., Ribeiro, J.: Split-state non-malleable codes and secret sharing schemes for quantum messages (2023)","DOI":"10.1007\/978-3-031-78017-2_3"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-56877-1_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"G Brian","year":"2020","unstructured":"Brian, G., Faonio, A., Obremski, M., Simkin, M., Venturi, D.: Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 127\u2013155. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_5"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-030-90453-1_12","volume-title":"Theory of Cryptography","author":"G Brian","year":"2021","unstructured":"Brian, G., Faonio, A., Venturi, D.: Continuously non-malleable secret sharing: joint tampering, plain model and capacity. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography, pp. 333\u2013364. Springer, Cham (2021)"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-49175-2_4","volume-title":"Information Theoretic Security","author":"A Broadbent","year":"2016","unstructured":"Broadbent, A., Wainewright, E.: Efficient simulation for quantum message authentication. In: Nascimento, A.C., Barreto, P. (eds.) Information Theoretic Security, pp. 72\u201391. Springer, Cham (2016)"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Chandran, N., Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Short leakage resilient and non-malleable secret sharing schemes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022, pp. 178\u2013207. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_7","DOI":"10.1007\/978-3-031-15802-5_7"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, E., Goyal, V., Li, X.: Nonmalleable extractors and codes, with their many tampered extensions. SIAM J. Comput. 49(5), 999\u20131040 (2020). https:\/\/doi.org\/10.1137\/18M1176622, preliminary version in STOC 2016","DOI":"10.1137\/18M1176622"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. J. Cryptol. 30, 191\u2013241 (2013). https:\/\/api.semanticscholar.org\/CorpusID:1470207","DOI":"10.1007\/s00145-015-9219-z"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Proceedings of Theory of Cryptography Conference (TCC). pp. 440\u2013464 (2014), extended version in Journal of Cryptology","DOI":"10.1007\/978-3-642-54242-8_19"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TIT.2015.2511784","volume":"62","author":"M Cheraghchi","year":"2016","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. IEEE Trans. Inf. Theory 62(3), 1097\u20131118 (2016). https:\/\/doi.org\/10.1109\/TIT.2015.2511784","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR25","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: International Conference on the Theory and Application of Cryptographic Techniques (2008). https:\/\/api.semanticscholar.org\/CorpusID:5864621"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-40084-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Dziembowski","year":"2013","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 239\u2013257. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_14"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4) (2018). https:\/\/doi.org\/10.1145\/3178432, preliminary version in ICS 2010","DOI":"10.1145\/3178432"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-26951-7_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Faonio","year":"2019","unstructured":"Faonio, A., Venturi, D.: Non-malleable secret sharing in the computational setting: adaptive tampering, noisy-leakage resilience, and improved rate. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 448\u2013479. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_16"},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Garg, S., Yuen, H., Zhandry, M.: New security notions and feasibility results for authentication of quantum data (2016)","DOI":"10.1007\/978-3-319-63715-0_12"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, pp. 685\u2013698. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3188745.3188872","DOI":"10.1145\/3188745.3188872"},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-319-96884-1_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"V Goyal","year":"2018","unstructured":"Goyal, V., Kumar, A.: Non-malleable secret sharing for general access structures. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 501\u2013530. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_17"},{"key":"6_CR32","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Richelson, S.: Textbook non-malleable commitments. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 1128\u20131141. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2897518.2897657","DOI":"10.1145\/2897518.2897657"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-030-77886-6_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Srinivasan, A., Zhu, C.: Multi-source non-malleable extractors and applications. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 468\u2013497. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_16"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Gunn, S., Ju, N., Ma, F., Zhandry, M.: Commitments to quantum states. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (2022)","DOI":"10.1145\/3564246.3585198"},{"key":"6_CR35","unstructured":"Hayden, P.M., Leung, D.W., Mayers, D.: The universal composable security of quantum message authentication with key recyling. arXiv, Quantum Physics (2016)"},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Jafargholi, Z., Wichs, D.: Tamper detection and continuous non-malleable codes. In: Theory of Cryptography Conference (2015). https:\/\/api.semanticscholar.org\/CorpusID:1165875","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"6_CR37","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-319-78372-7_19","volume-title":"Advances in Cryptology - EUROCRYPT 2018","author":"B Kanukurthi","year":"2018","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Non-malleable randomness encoders and their applications. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018, pp. 589\u2013617. Springer, Cham (2018)"},{"key":"6_CR38","doi-asserted-by":"publisher","unstructured":"Li, X.: Three-source extractors for polylogarithmic min-entropy. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 863\u2013882 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.58","DOI":"10.1109\/FOCS.2015.58"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Li, X.: Improved non-malleable extractors, non-malleable codes and independent source extractors. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 1144\u20131156. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3055399.3055486","DOI":"10.1145\/3055399.3055486"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Li, X.: Non-malleable extractors and non-malleable codes: partially optimal constructions. In: Proceedings of the 34th Computational Complexity Conference. CCC 2019, Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, DEU (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CCC.2019.28","DOI":"10.4230\/LIPIcs.CCC.2019.28"},{"key":"6_CR41","doi-asserted-by":"crossref","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more (2023). https:\/\/arxiv.org\/abs\/2303.06802. To appear at FOCS 2023","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-642-32009-5_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"F-H Liu","year":"2012","unstructured":"Liu, F.-H., Lysyanskaya, A.: Tamper and leakage resilience in the split-state model. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 517\u2013532. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_30"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:15Z","timestamp":1765107735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5125-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551248","9789819551255"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5125-5_6","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"}}]}}