{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:44Z","timestamp":1765113044062,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780165"},{"type":"electronic","value":"9783031780172"}],"license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"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-031-78017-2_3","type":"book-chapter","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T23:48:19Z","timestamp":1732751299000},"page":"60-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Split-State Non-malleable Codes and\u00a0Secret Sharing Schemes for\u00a0Quantum Messages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6595-572X","authenticated-orcid":false,"given":"Naresh Goud","family":"Boddu","sequence":"first","affiliation":[]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3649-6576","authenticated-orcid":false,"given":"Rahul","family":"Jain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9870-0501","authenticated-orcid":false,"given":"Jo\u00e3o","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-662-49099-0_15","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2016","unstructured":"Aggarwal, D., Agrawal, S., Gupta, D., Maji, H.K., Pandey, O., Prabhakaran, M.: Optimal computational split-state non-malleable codes. In: Kushilevitz, E., Malkin, T. (eds.) Theory of Cryptography, pp. 393\u2013417. Springer, Heidelberg (2016)"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/TIT.2023.3328839","volume":"70","author":"D Aggarwal","year":"2024","unstructured":"Aggarwal, D., Boddu, N.G., Jain, R.: Quantum secure non-malleable codes in the split-state model. IEEE Trans. Inf. Theory 70(1), 349\u2013371 (2024). https:\/\/doi.org\/10.1109\/TIT.2023.3328839","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"publisher","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":"3_CR3","DOI":"10.1007\/978-3-030-26951-7_18"},{"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","key":"3_CR4","DOI":"10.1137\/140985251"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/978-3-662-46494-6_17","volume-title":"Theory of Cryptography","author":"D Aggarwal","year":"2015","unstructured":"Aggarwal, D., Dziembowski, S., Kazana, T., Obremski, M.: Leakage-resilient non-malleable codes. In: Dodis, Y., Nielsen, J.B. (eds.) Theory of Cryptography, pp. 398\u2013426. Springer, Heidelberg (2015)"},{"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","key":"3_CR6","DOI":"10.1145\/3519935.3519972"},{"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 (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00122","key":"3_CR7","DOI":"10.1109\/FOCS46700.2020.00122"},{"key":"3_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"},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1063\/1.3094756","volume":"50","author":"A Ambainis","year":"2009","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","journal-title":"J. Math. Phys."},{"key":"3_CR10","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"},{"doi-asserted-by":"publisher","unstructured":"Ball, M., Chattopadhyay, E., Liao, J., Malkin, T., Tan, L.: Non-malleability against polynomial tampering. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology - CRYPTO 2020, pp. 97\u2013126. Springer (2020).https:\/\/doi.org\/10.1007\/978-3-030-56877-1_4","key":"3_CR11","DOI":"10.1007\/978-3-030-56877-1_4"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/978-3-662-49896-5_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Ball","year":"2016","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes for bounded depth, bounded fan-in circuits. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 881\u2013908. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_31"},{"doi-asserted-by":"publisher","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codes from average-case hardness: $$\\sf AC^0$$, decision trees, and streaming space-bounded tampering. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018, pp. 618\u2013650. Springer (2018).https:\/\/doi.org\/10.1007\/978-3-319-78372-7_20","key":"3_CR13","DOI":"10.1007\/978-3-319-78372-7_20"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-030-26948-7_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Ball","year":"2019","unstructured":"Ball, M., Guo, S., Wichs, D.: Non-malleable codes for decision trees. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 413\u2013434. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_15"},{"doi-asserted-by":"publisher","unstructured":"Barnum, H., Crepeau, C., Gottesman, D., Smith, A., Tapp, A.: Authentication of quantum messages. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 449\u2013458 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181969","key":"3_CR15","DOI":"10.1109\/SFCS.2002.1181969"},{"unstructured":"Batra, R., Boddu, N.G., Jain, R.: Quantum secure non-malleable randomness encoder and its applications. arXiv preprint arXiv:2308.07340 (2023). Contributed talk at QCRYPT 2023","key":"3_CR16"},{"doi-asserted-by":"crossref","unstructured":"Bergamaschi, T.: Pauli manipulation detection codes and applications to quantum communication over adversarial channels. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 404\u2013433. Springer, Cham (2024). https:\/\/arxiv.org\/abs\/2304.06269","key":"3_CR17","DOI":"10.1007\/978-3-031-58734-4_14"},{"doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), pp. 313\u2013318 (1979). https:\/\/doi.org\/10.1109\/MARK.1979.8817296","key":"3_CR18","DOI":"10.1109\/MARK.1979.8817296"},{"unstructured":"Boddu, N.G., Goyal, V., Jain, R., Ribeiro, J.: Split-state non-malleable codes and secret sharing schemes for quantum messages. arXiv preprint arXiv:2308.06466","key":"3_CR19"},{"unstructured":"Boddu, N.G., Jain, R., Kapshikar, U.: Quantum secure non-malleable-extractors. arXiv preprint arXiv:2109.03097 (2021). Contributed talk at TQC 2022","key":"3_CR20"},{"key":"3_CR21","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"},{"doi-asserted-by":"publisher","unstructured":"Brian, G., Faonio, A., Ribeiro, J., Venturi, D.: Short non-malleable codes from related-key secure block ciphers, revisited. IACR Trans. Symmet. Cryptol. 2022(3), 1\u201319 (2022). https:\/\/doi.org\/10.46586\/tosc.v2022.i3.1-19","key":"3_CR22","DOI":"10.46586\/tosc.v2022.i3.1-19"},{"key":"3_CR23","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)"},{"doi-asserted-by":"publisher","unstructured":"Brian, G., Faust, S., Micheli, E., Venturi, D.: Continuously non-malleable codes against bounded-depth tampering. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology - ASIACRYPT 2022, pp. 384\u2013413. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-22972-5_14","key":"3_CR24","DOI":"10.1007\/978-3-031-22972-5_14"},{"key":"3_CR25","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)"},{"unstructured":"\u00c7akan, A., Goyal, V., Liu-Zhang, C.D., Ribeiro, J.: Unbounded leakage-resilience and intrusion-detection in a quantum world (2024). https:\/\/eprint.iacr.org\/2023\/410, to appear at TCC 2024. Contributed talk at TQC 2024. https:\/\/eprint.iacr.org\/2023\/410","key":"3_CR26"},{"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","key":"3_CR27","DOI":"10.1007\/978-3-031-15802-5_7"},{"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","key":"3_CR28","DOI":"10.1137\/18M1176622"},{"doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_19. Extended Version in Journal of Cryptology","key":"3_CR29","DOI":"10.1007\/978-3-642-54242-8_19"},{"issue":"3","key":"3_CR30","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"},{"doi-asserted-by":"publisher","unstructured":"Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23, 880\u2013884 (1969). https:\/\/doi.org\/10.1103\/PhysRevLett.23.880","key":"3_CR31","DOI":"10.1103\/PhysRevLett.23.880"},{"doi-asserted-by":"publisher","unstructured":"Cleve, R., Gottesman, D., Lo, H.K.: How to share a quantum secret. Phys. Rev. Lett. 83, 648\u2013651 (1999). https:\/\/doi.org\/10.1103\/PhysRevLett.83.648","key":"3_CR32","DOI":"10.1103\/PhysRevLett.83.648"},{"doi-asserted-by":"crossref","unstructured":"Cleve, R., Leung, D., Liu, L., Wang, C.: Near-linear constructions of exact unitary 2-designs. Quantum Info. Comput. 16(9\u201310), 721\u2013756 (2016)","key":"3_CR33","DOI":"10.26421\/QIC16.9-10-1"},{"doi-asserted-by":"publisher","unstructured":"Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80, 012304 (2009). https:\/\/doi.org\/10.1103\/PhysRevA.80.012304","key":"3_CR34","DOI":"10.1103\/PhysRevA.80.012304"},{"key":"3_CR35","doi-asserted-by":"publisher","first-page":"2816","DOI":"10.1109\/TIT.2009.2018325","volume":"55","author":"N Datta","year":"2009","unstructured":"Datta, N.: Min- and max- relative entropies and a new entanglement monotone. IEEE Trans. Inf. Theory 55, 2816\u20132826 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3_CR36","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"},{"doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. J. ACM 65(4), 1\u201332 (2018). https:\/\/doi.org\/10.1145\/3178432. Preliminary version in ICS 2010","key":"3_CR37","DOI":"10.1145\/3178432"},{"key":"3_CR38","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"},{"doi-asserted-by":"publisher","unstructured":"Faust, S., Host\u00e1kov\u00e1, K., Mukherjee, P., Venturi, D.: Non-malleable codes for space-bounded tampering. In: Katz, J., Shacham, H. (eds.) Advances in Cryptology - CRYPTO 2017, pp. 95\u2013126. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_4","key":"3_CR39","DOI":"10.1007\/978-3-319-63715-0_4"},{"doi-asserted-by":"publisher","unstructured":"Faust, S., Mukherjee, P., Nielsen, J.B., Venturi, D.: Continuous non-malleable codes. In: Lindell, Y. (ed.) Theory of Cryptography - 11th Theory of Cryptography Conference, TCC 2014, pp. 465\u2013488. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_20","key":"3_CR40","DOI":"10.1007\/978-3-642-54242-8_20"},{"doi-asserted-by":"publisher","unstructured":"Fehr, S., Karpman, P., Mennink, B.: Short non-malleable codes from related-key secure block ciphers. IACR Trans. Symmet. Cryptol. 2018(1), 336\u2013352 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i1.336-352","key":"3_CR41","DOI":"10.13154\/tosc.v2018.i1.336-352"},{"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","key":"3_CR42","DOI":"10.1145\/3188745.3188872"},{"key":"3_CR43","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"},{"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","key":"3_CR44","DOI":"10.1145\/2897518.2897657"},{"key":"3_CR45","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"},{"doi-asserted-by":"publisher","unstructured":"Jain, R., Radhakrishnan, J., Sen, P.: Privacy and interaction in quantum communication complexity and a theorem about the relative entropy of quantum states. In: The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 429\u2013438 (2002). https:\/\/doi.org\/10.1109\/SFCS.2002.1181967","key":"3_CR46","DOI":"10.1109\/SFCS.2002.1181967"},{"key":"3_CR47","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)"},{"doi-asserted-by":"publisher","unstructured":"Kiayias, A., Liu, F.H., Tselekounis, Y.: Practical non-malleable codes from $$\\ell $$-more extractable hash functions. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (CCS 2016), pp. 1317\u20131328. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2976749.2978352","key":"3_CR48","DOI":"10.1145\/2976749.2978352"},{"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","key":"3_CR49","DOI":"10.1109\/FOCS.2015.58"},{"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","key":"3_CR50","DOI":"10.1145\/3055399.3055486"},{"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","key":"3_CR51","DOI":"10.4230\/LIPIcs.CCC.2019.28"},{"doi-asserted-by":"publisher","unstructured":"Li, X.: Two source extractors for asymptotically optimal entropy, and (many) more. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1271\u20131281 (2023). https:\/\/doi.org\/10.1109\/FOCS57990.2023.00075","key":"3_CR52","DOI":"10.1109\/FOCS57990.2023.00075"},{"key":"3_CR53","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"},{"key":"3_CR54","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"unstructured":"Ozols, M.: Lecture 5: quantum information processing protocols, quantum computing: exercise sheet 2 (2016). https:\/\/www.cl.cam.ac.uk\/teaching\/1617\/QuantComp\/exercise2.pdf","key":"3_CR55"},{"doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","key":"3_CR56","DOI":"10.1145\/359168.359176"},{"key":"3_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-030-26951-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Srinivasan","year":"2019","unstructured":"Srinivasan, A., Vasudevan, P.N.: Leakage resilient secret sharing and applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 480\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_17"},{"key":"3_CR58","doi-asserted-by":"publisher","DOI":"10.1017\/9781316848142","volume-title":"The Theory of Quantum Information","author":"J Watrous","year":"2018","unstructured":"Watrous, J.: The Theory of Quantum Information. Cambridge University Press, Cambridge (2018)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78017-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:16:28Z","timestamp":1732752988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78017-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"ISBN":["9783031780165","9783031780172"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78017-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"28 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}