{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T01:26:21Z","timestamp":1777857981746,"version":"3.51.4"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031587337","type":"print"},{"value":"9783031587344","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58734-4_14","type":"book-chapter","created":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T11:12:08Z","timestamp":1714475528000},"page":"404-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Pauli Manipulation Detection Codes and\u00a0Applications to\u00a0Quantum Communication over\u00a0Adversarial Channels"],"prefix":"10.1007","author":[{"given":"Thiago","family":"Bergamaschi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,1]]},"reference":[{"key":"14_CR1","unstructured":"Aggarwal, D., Ball, M., Obremski, M.: Survey: non-malleable code in the split-state model. Cryptology ePrint Archive, Paper 2022\/1326 (2022). https:\/\/eprint.iacr.org\/2022\/1326"},{"key":"14_CR2","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. Cryptology ePrint Archive, Paper 2013\/201 (2013). https:\/\/eprint.iacr.org\/2013\/201"},{"key":"14_CR3","unstructured":"Aggarwal, D., Sekar, S., Kanukurthi, B., Obremski, M., Obbattu, S.L.B.: Rate one-third non-malleable codes. Cryptology ePrint Archive, Paper 2021\/1042 (2021). https:\/\/eprint.iacr.org\/2021\/1042"},{"key":"14_CR4","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Explicit non-malleable codes resistant to permutations and perturbations. Cryptology ePrint Archive, Paper 2014\/841 (2014). https:\/\/eprint.iacr.org\/2014\/841"},{"key":"14_CR5","unstructured":"Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: A rate-optimizing compiler for non-malleable codes against bit-wise tampering and permutations. Cryptology ePrint Archive, Paper 2014\/842 (2014). https:\/\/eprint.iacr.org\/2014\/842"},{"key":"14_CR6","unstructured":"Aharonov, D., Ben-Or, M., Eban, E.: Interactive proofs for quantum computations. In: International Conference on Supercomputing (2008)"},{"key":"14_CR7","unstructured":"Anshu, A., Nirkhe, C.: Circuit lower bounds for low-energy states of quantum code Hamiltonians. In: Information Technology Convergence and Services (2020)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Guo, S., Malkin, T., Tan, L.Y.: Non-malleable codes for small-depth circuits. Cryptology ePrint Archive, Paper 2018\/207 (2018). https:\/\/eprint.iacr.org\/2018\/207","DOI":"10.1109\/FOCS.2018.00083"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Ball, M., Dachman-Soled, D., Loss, J.: (nondeterministic) hardness vs. non-malleability. Cryptology ePrint Archive, Paper 2022\/070 (2022). https:\/\/eprint.iacr.org\/2022\/070","DOI":"10.1007\/978-3-031-15802-5_6"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"1798","DOI":"10.1016\/j.disc.2017.10.032","volume":"341","author":"J Bao","year":"2016","unstructured":"Bao, J., Ji, L., Wei, R., Zhang, Y.: New existence and nonexistence results for strong external difference families. Discret. Math. 341, 1798\u20131805 (2016)","journal-title":"Discret. Math."},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Barnum, H., Cr\u00e9peau, C., Gottesman, D., Smith, A., Tapp, A.: Authentication of quantum messages. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings, pp. 449\u2013458. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181969"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1063\/1.1459754","volume":"43","author":"H Barnum","year":"2000","unstructured":"Barnum, H., Knill, E.: Reversing quantum dynamics with near-optimal quantum and classical fidelity. J. Math. Phys. 43, 2097\u20132106 (2000)","journal-title":"J. Math. Phys."},{"key":"14_CR13","unstructured":"Ben-Aroya, A., Doron, D., Ta-Shma, A.: Near-optimal erasure list-decodable codes. In: Proceedings of the 35th Computational Complexity Conference (2020)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-10698-9_7","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"C B\u00e9ny","year":"2009","unstructured":"B\u00e9ny, C.: Conditions for the approximate correction of algebras. In: Childs, A., Mosca, M. (eds.) TQC 2009. LNCS, vol. 5906, pp. 66\u201375. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10698-9_7"},{"issue":"12","key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.120501","volume":"104","author":"C B\u00e9ny","year":"2010","unstructured":"B\u00e9ny, C., Oreshkov, O.: General conditions for approximate quantum error correction and near-optimal recovery channels. Phys. Rev. Lett. 104(12), 120501 (2010)","journal-title":"Phys. Rev. Lett."},{"key":"14_CR16","unstructured":"Bergamaschi, T., Boddu, N.G.: On split-state quantum tamper detection and non-malleability (2023). https:\/\/api.semanticscholar.org\/CorpusID:265456980"},{"key":"14_CR17","unstructured":"Bergamaschi, T., Golowich, L., Gunn, S.: Approaching the quantum singleton bound with approximate error correction. arXiv abs\/2212.09935 (2022)"},{"key":"14_CR18","unstructured":"Boddu, N.G., Goyal, V., Jain, R., Ribeiro, J.L.: Split-state non-malleable codes and secret sharing schemes for quantum messages. ArXiv abs\/2308.06466 (2023). https:\/\/api.semanticscholar.org\/CorpusID:260886799"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Boddu, N.G., Jain, R.: Non-malleable code in the split-state model. Entropy 24 (2022). https:\/\/api.semanticscholar.org\/CorpusID:208058906","DOI":"10.3390\/e24081038"},{"key":"14_CR20","unstructured":"Boddu, N.G., Kapshikar, U.: Tamper detection against unitary operators. ArXiv abs\/2105.04487 (2021)"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Calderbank, S.: Good quantum error-correcting codes exist. Phys. Rev. A Atom. Mol. Opt. Phys. 54(2), 1098\u20131105 (1996)","DOI":"10.1103\/PhysRevA.54.1098"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00145-015-9219-z","volume":"30","author":"M Cheraghchi","year":"2013","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. J. Cryptol. 30, 191\u2013241 (2013)","journal-title":"J. Cryptol."},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1103\/PhysRevLett.83.648","volume":"83","author":"R Cleve","year":"1999","unstructured":"Cleve, R., Gottesman, D., Lo, H.K.: How to share a quantum secret. Phys. Rev. Lett. 83, 648\u2013651 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"14_CR24","first-page":"1089","volume":"2015","author":"R Cramer","year":"2015","unstructured":"Cramer, R., Damg\u00e5rd, I., D\u00f6ttling, N., Fehr, S., Spini, G.: Linear secret sharing schemes from error correcting codes and universal hash functions. IACR Cryptol. ePrint Arch. 2015, 1089 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Fehr, S.: On the cost of reconstructing a secret, or vss with optimal reconstruction phase. In: Annual International Cryptology Conference (2001)","DOI":"10.1007\/3-540-44647-8_30"},{"key":"14_CR26","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)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Cramer, R., Fehr, S., Padr\u00f3, C.: Algebraic manipulation detection codes. Sci. China Math. 56, 1349\u20131358 (2013). https:\/\/api.semanticscholar.org\/CorpusID:31391230","DOI":"10.1007\/s11425-013-4654-5"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Cramer, R., Padr\u00f3, C., Xing, C.: Optimal algebraic manipulation detection codes in the constant-error model. In: Theory of Cryptography Conference (2015)","DOI":"10.1007\/978-3-662-46494-6_20"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Gottesman, D., Smith, A.D.: Approximate quantum error-correcting codes and secret sharing schemes. In: International Conference on the Theory and Application of Cryptographic Techniques (2005)","DOI":"10.1007\/11426639_17"},{"key":"14_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/TIT.2004.839515","volume":"51","author":"I Devetak","year":"2005","unstructured":"Devetak, I.: The private classical capacity and quantum capacity of a quantum channel. IEEE Trans. Inf. Theory 51, 44\u201355 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"3889","DOI":"10.1109\/TIT.2014.2314468","volume":"60","author":"Y Ding","year":"2014","unstructured":"Ding, Y., Jin, L., Xing, C.: Erasure list-decodable codes from random and algebraic geometry codes. IEEE Trans. Inf. Theory 60, 3889\u20133894 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Kazana, T., Obremski, M.: Non-malleable codes from two-source extractors. Cryptology ePrint Archive, Paper 2013\/498 (2013). https:\/\/eprint.iacr.org\/2013\/498","DOI":"10.1007\/978-3-642-40084-1_14"},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes (2018). https:\/\/api.semanticscholar.org\/CorpusID:14293524","DOI":"10.1145\/3178432"},{"key":"14_CR34","unstructured":"Elias, P.: List decoding for noisy channels. In: Technical Report 335. Research Laboratory of Electronics, MIT (1957)"},{"key":"14_CR35","unstructured":"Gottesman, D.: Stabilizer codes and quantum error correction. arXiv:\u00a0Quantum Physics (1997)"},{"key":"14_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.61.042311","volume":"61","author":"D Gottesman","year":"1999","unstructured":"Gottesman, D.: Theory of quantum secret sharing. Phys. Rev. A 61, 042311 (1999)","journal-title":"Phys. Rev. A"},{"key":"14_CR37","doi-asserted-by":"publisher","first-page":"3942","DOI":"10.1109\/TIT.2022.3149291","volume":"68","author":"M Grassl","year":"2020","unstructured":"Grassl, M., Huber, F., Winter, A.J.: Entropic proofs of singleton bounds for quantum error-correcting codes. IEEE Trans. Inf. Theory 68, 3942\u20133950 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR38","volume":"11","author":"MJ Gullans","year":"2020","unstructured":"Gullans, M.J., Krastanov, S., Huse, D.A., Jiang, L., Flammia, S.T.: Quantum coding with low-depth random circuits. Phys. Rev. X 11, 031066 (2020)","journal-title":"Phys. Rev. X"},{"key":"14_CR39","doi-asserted-by":"publisher","first-page":"2826","DOI":"10.1109\/TIT.2003.815776","volume":"49","author":"V Guruswami","year":"2001","unstructured":"Guruswami, V.: List decoding from erasures: bounds and code constructions. IEEE Trans. Inf. Theory 49, 2826\u20132833 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR40","unstructured":"Hayden, P.M., Leung, D.W., Mayers, D.: The universal composable security of quantum message authentication with key recyling. arXiv:\u00a0Quantum Physics (2016)"},{"key":"14_CR41","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00220-020-03689-1","volume":"374","author":"PM Hayden","year":"2017","unstructured":"Hayden, P.M., Penington, G.: Approximate quantum error correction revisited: introducing the alpha-bit. Commun. Math. Phys. 374, 369\u2013432 (2017)","journal-title":"Commun. Math. Phys."},{"key":"14_CR42","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disc.2017.08.007","volume":"341","author":"S Huczynska","year":"2016","unstructured":"Huczynska, S., Paterson, M.B.: Existence and non-existence results for strong external difference families. Discret. Math. 341, 87\u201395 (2016)","journal-title":"Discret. Math."},{"key":"14_CR43","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1016\/j.disc.2018.11.009","volume":"342","author":"S Huczynska","year":"2018","unstructured":"Huczynska, S., Paterson, M.B.: Weighted external difference families and R-optimal AMD codes. Discret. Math. 342, 855\u2013867 (2018)","journal-title":"Discret. Math."},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Jafargholi, Z., Wichs, D.: Tamper detection and continuous non-malleable codes. In: Theory of Cryptography Conference (2015)","DOI":"10.1007\/978-3-662-46494-6_19"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Kanukurthi, B., Obbattu, S.L.B., Sekar, S.: Four-state non-malleable codes with explicit constant rate. Cryptology ePrint Archive, Paper 2017\/930 (2017). https:\/\/eprint.iacr.org\/2017\/930","DOI":"10.1007\/978-3-319-70503-3_11"},{"key":"14_CR46","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1103\/PhysRevA.55.900","volume":"55","author":"E Knill","year":"1996","unstructured":"Knill, E., Laflamme, R.: Theory of quantum error-correcting codes. Phys. Rev. A 55, 900\u2013911 (1996)","journal-title":"Phys. Rev. A"},{"key":"14_CR47","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TIT.2008.917696","volume":"54","author":"D Kretschmann","year":"2006","unstructured":"Kretschmann, D., Schlingemann, D., Werner, R.F.: The information-disturbance tradeoff and the continuity of Stinespring\u2019s representation. IEEE Trans. Inf. Theory 54, 1708\u20131717 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR48","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1103\/PhysRevA.56.2567","volume":"56","author":"DW Leung","year":"1997","unstructured":"Leung, D.W., Nielsen, M.A., Chuang, I.L., Yamamoto, Y.: Approximate quantum error correction can lead to better codes. Phys. Rev. A 56, 2567\u20132573 (1997)","journal-title":"Phys. Rev. A"},{"key":"14_CR49","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1109\/TIT.2007.913433","volume":"54","author":"DW Leung","year":"2006","unstructured":"Leung, D.W., Smith, G.: Communicating over adversarial quantum channels using quantum list codes. IEEE Trans. Inf. Theory 54, 883\u2013887 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR50","unstructured":"Lin, F., Cheraghchi, M., Guruswami, V., Safavi-Naini, R., Wang, H.: Secret sharing with binary shares. In: IACR Cryptol. ePrint Arch. (2018)"},{"key":"14_CR51","doi-asserted-by":"publisher","unstructured":"Mandayam, P., Ng, H.K.: Towards a unified framework for approximate quantum error correction. Phys. Rev. A 86, 012335 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.012335. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.86.012335","DOI":"10.1103\/PhysRevA.86.012335"},{"key":"14_CR52","doi-asserted-by":"publisher","unstructured":"Ng, H.K., Mandayam, P.: Simple approach to approximate quantum error correction based on the transpose channel. Phys. Rev. A 81, 062342 (2010). https:\/\/doi.org\/10.1103\/PhysRevA.81.062342. https:\/\/link.aps.org\/doi\/10.1103\/PhysRevA.81.062342","DOI":"10.1103\/PhysRevA.81.062342"},{"key":"14_CR53","doi-asserted-by":"publisher","first-page":"2361","DOI":"10.1109\/18.796376","volume":"45","author":"EM Rains","year":"1996","unstructured":"Rains, E.M.: Quantum shadow enumerators. IEEE Trans. Inf. Theory 45, 2361\u20132366 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR54","doi-asserted-by":"publisher","first-page":"1827","DOI":"10.1109\/18.782103","volume":"45","author":"EM Rains","year":"1997","unstructured":"Rains, E.M.: Nonbinary quantum codes. IEEE Trans. Inf. Theory 45, 1827\u20131832 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR55","doi-asserted-by":"crossref","unstructured":"Schumacher, B., Westmoreland, M.D.: Approximate quantum error correction. Quantum Inf. Process. 1(1-2), 5\u201312 (2002). https:\/\/doi.org\/10.1023\/A%3A1019653202562","DOI":"10.1023\/A:1019653202562"},{"key":"14_CR56","unstructured":"Smith, A.D.: Quantum secret sharing for general access structures. arXiv:\u00a0Quantum Physics (2000)"},{"key":"14_CR57","doi-asserted-by":"crossref","unstructured":"Steane: Simple quantum error-correcting codes. Phys. Rev. A Atom. Mol. Opt. Phys. 54 6, 4741\u20134751 (1996)","DOI":"10.1103\/PhysRevA.54.4741"},{"key":"14_CR58","unstructured":"Wozencraft., J.M.: List Decoding. Quarterly Progress Report, Research Laboratory of Electronics, vol. 48, pp. 90\u201395. MIT (1958)"},{"key":"14_CR59","doi-asserted-by":"publisher","first-page":"4657","DOI":"10.1038\/s41467-022-32094-6","volume":"13","author":"Y Wu","year":"2022","unstructured":"Wu, Y., Kolkowitz, S., Puri, S., Thompson, J.D.: Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays. Nat. Commun. 13, 4657 (2022)","journal-title":"Nat. Commun."},{"key":"14_CR60","unstructured":"Yoshida, B., Kitaev, A.Y.: Efficient decoding for the Hayden-Preskill protocol. arXiv:\u00a0High Energy Physics - Theory (2017)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58734-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:05:16Z","timestamp":1777507516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58734-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031587337","9783031587344"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58734-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zurich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}