{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T16:16:09Z","timestamp":1769012169287,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_19","type":"book-chapter","created":{"date-parts":[[2014,2,3]],"date-time":"2014-02-03T02:42:54Z","timestamp":1391395374000},"page":"440-464","source":"Crossref","is-referenced-by-count":73,"title":["Non-malleable Coding against Bit-Wise and Split-State Tampering"],"prefix":"10.1007","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","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, D., Dodis, Y., Lovett, S.: Non-malleable codes from additive combinatorics. ECCC Technical Report TR13-081 (2013)","DOI":"10.1145\/2591796.2591804"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1483","DOI":"10.4007\/annals.2012.176.3.3","volume":"176","author":"B. Barak","year":"2012","unstructured":"Barak, B., Rao, A., Shaltiel, R., Wigderson, A.: 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction. Annals of Mathematics\u00a0176(3), 1483\u20131544 (2012)","journal-title":"Annals of Mathematics"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793042105000108","volume":"1","author":"J. Bourgain","year":"2005","unstructured":"Bourgain, J.: More on the Sum-Product phenomenon in prime fields and its applications. International Journal of Number Theory\u00a01(1), 1\u201332 (2005)","journal-title":"International Journal of Number Theory"},{"key":"19_CR4","unstructured":"Cheraghchi, M.: Applications of Derandomization Theory in Coding. PhD thesis, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland (2010), http:\/\/eccc.hpi-web.de\/static\/books\/Applications_of_Derandomization_Theory_in_Coding\/"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Guruswami, V.: Capacity of non-malleable codes. ECCC Technical Report TR13-118 (2013)","DOI":"10.1145\/2554797.2554814"},{"key":"19_CR6","unstructured":"Cheraghchi, M., Guruswami, V.: Explicit optimal rate non-malleable codes for bit-tampering. IACR Technical Report 2013\/565 (2013), http:\/\/eprint.iacr.org\/2013\/565"},{"issue":"17","key":"19_CR7","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"2","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing\u00a02(17), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Cramer","year":"2008","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: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and non-malleable extractors via character sums. In: Proceedings of FOCS 2011, pp. 668\u2013677 (2011)","DOI":"10.1109\/FOCS.2011.67"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 601\u2013610 (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"19_CR11","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, Part II. LNCS, vol.\u00a08043, pp. 239\u2013257. Springer, Heidelberg (2013)"},{"key":"19_CR12","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Proceedings of Innovations in Computer Science, ICS\u00a02010 (2010)"},{"key":"19_CR13","unstructured":"Forney, G.D.: Concatenated Codes. MIT Press (1966)"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Gohen, G., Raz, R., Segev, G.: Non-malleable extractors with short seeds and applications to privacy amplification. In: Proceedings of CCC 2012, pp. 298\u2013308 (2012)","DOI":"10.1109\/CCC.2012.21"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Smith, A.: Codes for computationally simple channels: Explicit constructions with optimal rate. In: Proceedings of FOCS 2010, pp. 723\u2013732 (2010)","DOI":"10.1109\/FOCS.2010.74"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TIT.1972.1054893","volume":"18","author":"J. Justesen","year":"1972","unstructured":"Justesen, J.: A class of constructive asymptotically good algebraic codes. IEEE Transactions on Information Theory\u00a018, 652\u2013656 (1972)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Li, X., Rao, A.: 2-source extractors under computational assumptions and cryptography with defective randomness. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 617\u2013626 (2009)","DOI":"10.1109\/FOCS.2009.61"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Kaplan, E., Naor, M., Reingold, O.: Derandomized constructions of k-wise (almost) independent permutations. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX and RANDOM 2005. LNCS, vol.\u00a03624, pp. 354\u2013365. Springer, Heidelberg (2005)","DOI":"10.1007\/11538462_30"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 688\u2013697 (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-540-85363-3_43","volume-title":"Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques","author":"A. Rao","year":"2008","unstructured":"Rao, A.: A 2-source almost-extractor for linear entropy. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol.\u00a05171, pp. 549\u2013556. Springer, Heidelberg (2008)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.jcss.2010.06.013","volume":"77","author":"R. Raz","year":"2011","unstructured":"Raz, R., Yehudayoff, A.: Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. Journal of Computer and System Sciences\u00a077(1), 167\u2013190 (2011)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54242-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T03:32:36Z","timestamp":1648179156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}