{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:11:47Z","timestamp":1748751107680,"version":"3.41.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266169"},{"type":"electronic","value":"9783319266176"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26617-6_16","type":"book-chapter","created":{"date-parts":[[2015,11,27]],"date-time":"2015-11-27T05:40:44Z","timestamp":1448602844000},"page":"293-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Non-malleable Extractors with Shorter Seeds and Their Applications"],"prefix":"10.1007","author":[{"given":"Yanqing","family":"Yao","sequence":"first","affiliation":[]},{"given":"Zhoujun","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,28]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u00e5stad, J., Peralta, R.: Simple construction of almost k-wise independent random variables. Random Struct. Algorithms 3(3), 289\u2013304 (1992)","journal-title":"Random Struct. Algorithms"},{"key":"16_CR2","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. Int. J. Number Theory 1, 1\u201332 (2005)","journal-title":"Int. J. Number Theory"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/978-3-642-54242-8_19","volume-title":"Theory of Cryptography","author":"M Cheraghchi","year":"2014","unstructured":"Cheraghchi, M., Guruswami, V.: Non-malleable coding against bit-wise and split-state tampering. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 440\u2013464. Springer, Heidelberg (2014)"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R., Reyzin, L.: Privacy amplification with asymptotically optimal entropy loss. In: STOC 2010, pp. 785\u2013794 (2010)","DOI":"10.1145\/1806689.1806796"},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, G., Raz, R., Segev, G.: Non-malleable extractors with short seeds and applications to privacy amplification. In: CCC 2012, pp. 298\u2013308 (2012)","DOI":"10.1109\/CCC.2012.21"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/11818175_14","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y Dodis","year":"2006","unstructured":"Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232\u2013250. Springer, Heidelberg (2006)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Li, X., Wooley, T.D., Zuckerman, D.: Privacy amplification and non-malleable extractors via character sums. In: FOCS 2011, pp. 668\u2013677 (2011)","DOI":"10.1109\/FOCS.2011.67"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Wichs, D.: Non-malleable extractors and symmetric key cryptography from weak secrets. In: STOC 2009, pp. 601\u2013610 (2009)","DOI":"10.1145\/1536414.1536496"},{"key":"16_CR10","unstructured":"Dziembowski, S., Pietrzak, K., Wichs, D.: Non-malleable codes. In: Proceedings of Innovations in Computer Science (ICS 2010), pp. 434\u2013452 (2010)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36594-2_1","volume-title":"Theory of Cryptography","author":"Y Dodis","year":"2013","unstructured":"Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1\u201322. Springer, Heidelberg (2013)"},{"key":"16_CR12","first-page":"67","volume":"77","author":"L Fortnow","year":"2002","unstructured":"Fortnow, L., Shaltiel, R.: Recent developments in explicit constructions of extractors, 2002. Bull. EATCS 77, 67\u201395 (2002)","journal-title":"Bull. EATCS"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-01001-9_12","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"B Kanukurthi","year":"2009","unstructured":"Kanukurthi, B., Reyzin, L.: Key agreement from close secrets over unsecured channels. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 206\u2013223. Springer, Heidelberg (2009)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Li, X.: Non-malleable extractors, two-source extractors and privacy amplification. In: FOCS 2012, pp. 688\u2013697 (2012)","DOI":"10.1109\/FOCS.2012.26"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BFb0052244","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"UM Maurer","year":"1997","unstructured":"Maurer, U.M., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307\u2013321. Springer, Heidelberg (1997)"},{"issue":"4","key":"16_CR16","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1109\/TIT.2003.809559","volume":"49","author":"UM Maurer","year":"2003","unstructured":"Maurer, U.M., Wolf, S.: Secret-key agreement over unauthenticated public channels III: privacy amplification. IEEE Trans. Inf. Theory 49(4), 839\u2013851 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"16_CR17","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J Naor","year":"1993","unstructured":"Naor, J., Naor, M.: Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22(4), 838\u2013856 (1993)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci. 52(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR19","unstructured":"Rao, A.: An exposition of Bourgain\u2019s 2-source extractor. Technical report TR07-34, ECCC (2007). http:\/\/eccc.hpi-web.de\/eccc-reports\/2007\/TR07-034\/index.html"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: STOC 2005, pp. 11\u201320 (2005)","DOI":"10.1145\/1060590.1060593"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-45146-4_5","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"RS Renner","year":"2003","unstructured":"Renner, R.S., Wolf, S.: Unconditional authenticity and privacy from an arbitrarily weak secret. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 78\u201395. Springer, Heidelberg (2003)"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: Randomness extractors and their many guises: invited tutorial. In: FOCS 2002, p. 9 (2002)","DOI":"10.1109\/SFCS.2002.1181877"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/3-540-49649-1_32","volume-title":"Advances in Cryptology - ASIACRYPT 1998","author":"S Wolf","year":"1998","unstructured":"Wolf, S.: Strong security against active attacks in information-theoretic secret-key agreement. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 405\u2013419. Springer, Heidelberg (1998)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Theory of Computing 2007, pp. 103\u2013128 (2007)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology -- INDOCRYPT 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26617-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T15:35:08Z","timestamp":1748705708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26617-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266169","9783319266176"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26617-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 November 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}