{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T15:21:15Z","timestamp":1768922475590,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T00:00:00Z","timestamp":1444089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00145-015-9219-z","type":"journal-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T20:33:23Z","timestamp":1444163603000},"page":"191-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Non-malleable Coding Against Bit-Wise and Split-State Tampering"],"prefix":"10.1007","volume":"30","author":[{"given":"Mahdi","family":"Cheraghchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,6]]},"reference":[{"key":"9219_CR1","unstructured":"D.\u00a0Aggarwal, Y.\u00a0Dodis, T.\u00a0Kazana, M.\u00a0Obremski, Non-malleable reductions and applications, in Cryptology ePrint Archive, Report 2014\/821 (2014). \n                    http:\/\/eprint.iacr.org\/"},{"key":"9219_CR2","unstructured":"D.\u00a0Aggarwal, Y.\u00a0Dodis, S.\u00a0Lovett, Non-malleable codes from additive combinatorics, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing (2014), pp.774\u2013783"},{"issue":"3","key":"9219_CR3","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.4007\/annals.2012.176.3.3","volume":"176","author":"B Barak","year":"2012","unstructured":"B.\u00a0Barak, A.\u00a0Rao, R.\u00a0Shaltiel, A.\u00a0Wigderson, 2-Source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl\u2013Wilson construction. Ann. Math.\u00a0176(3), 1483\u20131544 (2012)","journal-title":"Annals of Mathematics"},{"issue":"1","key":"9219_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J Bourgain","year":"2005","unstructured":"J.\u00a0Bourgain, More on the Sum\u2013Product phenomenon in prime fields and its applications. Int. J. Number Theory\u00a01(1), 1\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"key":"9219_CR5","doi-asserted-by":"crossref","unstructured":"E.\u00a0Chattopadhyay, V.\u00a0Goyal, X.\u00a0Li, Non-malleable extractors and codes, with their many tampered extensions. Preprint \n                    arXiv:1505.00107\n                    \n                   (2015)","DOI":"10.1145\/2897518.2897547"},{"key":"9219_CR6","unstructured":"E.\u00a0Chattopadhyay, D.\u00a0Zuckerman, Non-malleable codes against constant split-state tampering, in Proceedings of the 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2014), pp. 306\u2013315"},{"key":"9219_CR7","unstructured":"M.\u00a0Cheraghchi, Applications of Derandomization Theory in Coding. Ph.D. Thesis, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (2010). \n                    http:\/\/eccc.hpi-web.de\/static\/books\/Applications_of_Derandomization_Theory_in_Coding\/"},{"key":"9219_CR8","doi-asserted-by":"crossref","unstructured":"M.\u00a0Cheraghchi, V.\u00a0Guruswami, Capacity of non-malleable codes, in Proceedings of Innovations in Theoretical Computer Science (ITCS\u00a02014) (2014)","DOI":"10.1145\/2554797.2554814"},{"key":"9219_CR9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Cheraghchi, V.\u00a0Guruswami, Non-malleable coding against bit-wise and split-state tampering, in Proceedings of Theory of Cryptography Conference (TCC\u00a02014) (2014)","DOI":"10.1007\/978-3-642-54242-8_19"},{"issue":"17","key":"9219_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"2","author":"B Chor","year":"1988","unstructured":"B.\u00a0Chor, O.\u00a0Goldreich, Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput., 2(17),\u00a0230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"9219_CR11","unstructured":"R.\u00a0Cramer, H.\u00a0Chen, S.\u00a0Goldwasser, R.\u00a0de\u00a0Haan, V.\u00a0Vaikuntanathan, Secure computation from random error-correcting codes, in Proceedings of Eurocrypt 2007 (2007), pp. 291\u2013310"},{"key":"9219_CR12","unstructured":"R.\u00a0Cramer, Y.\u00a0Dodis, S.\u00a0Fehr, C.\u00a0Padr\u00f3, D.\u00a0Wichs, Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors, in Proceedings of EUROCRYPT 2008 (2008), pp. 471\u2013488"},{"key":"9219_CR13","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, D.\u00a0Wichs, Non-malleable extractors and symmetric key cryptography from weak secrets, in Proceedings of the 41st annual ACM Symposium on Theory of Computing (2009), pp. 601\u2013610. Full version published in Cryptology ePrint Archive, Report 2008\/503 (eprint.iacr.org\/2008\/503)","DOI":"10.1145\/1536414.1536496"},{"key":"9219_CR14","unstructured":"S.\u00a0Dziembowski, T.\u00a0Kazana, M.\u00a0Obremski, Non-malleable codes from two-source extractors, in Proceedings of CRYPTO (2013), pp. 239\u2013257"},{"key":"9219_CR15","unstructured":"S.\u00a0Dziembowski, K.\u00a0Pietrzak, D.\u00a0Wichs, Non-malleable codes, in Proceedings of Innovations in Computer Science (ICS\u00a02010) (2010)"},{"key":"9219_CR16","volume-title":"Concatenated Codes","author":"GD Forney","year":"1966","unstructured":"G.D. Forney, Concatenated Codes (MIT Press, Cambridge, 1966)"},{"key":"9219_CR17","unstructured":"V.\u00a0Guruswami, A.\u00a0Smith. Codes for computationally simple channels: Explicit constructions with optimal rate, in Proceedings of FOCS 2010 (2010), pp. 723\u2013732"},{"key":"9219_CR18","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J Justesen","year":"1972","unstructured":"J.\u00a0Justesen, A class of constructive asymptotically good algebraic codes. IEEE Trans. Inf. Theory\u00a018, 652\u2013656 (1972)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9219_CR19","unstructured":"Y.\u00a0Kalai, X.\u00a0Li, A.\u00a0Rao, in 2th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (2009), pp. 617\u2013626"},{"key":"9219_CR20","unstructured":"E.\u00a0Kaplan, M.\u00a0Naor, O.\u00a0Reingold, Derandomized constructions of \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -wise (almost) independent permutations, in Proceedings of RANDOM 2005 (2005), pp. 113\u2013133"},{"key":"9219_CR21","unstructured":"A.\u00a0Rao, A 2-source almost-extractor for linear entropy, in Proceedings of RANDOM\u00a02008 (2008), pp. 549\u2013556"},{"key":"9219_CR22","unstructured":"R.\u00a0Raz, Extractors with weak random seeds, in Proceedings of the37th Annual ACM Symposium on Theory of Computing (STOC) (2005), pp. 11\u201320"},{"issue":"1","key":"9219_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jcss.2010.06.013","volume":"77","author":"R Raz","year":"2011","unstructured":"R.\u00a0Raz, A.\u00a0Yehudayoff, Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci\u00a077(1), 167\u2013190 (2011)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1\u20133","key":"9219_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000010","volume":"7","author":"S Vadhan","year":"2012","unstructured":"S.\u00a0Vadhan, Pseudorandomness. Found. Trends Theor. Comput. Sci.\u00a07(1\u20133), 1\u2013336 (2012)","journal-title":"Foundations and Trends in Theoretical Computer Science"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9219-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-015-9219-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9219-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-015-9219-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:13:01Z","timestamp":1586333581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-015-9219-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,6]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9219"],"URL":"https:\/\/doi.org\/10.1007\/s00145-015-9219-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,6]]},"assertion":[{"value":"5 December 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}