{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:06:06Z","timestamp":1773511566553,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642420320","type":"print"},{"value":"9783642420337","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-42033-7_10","type":"book-chapter","created":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T08:07:02Z","timestamp":1385194022000},"page":"174-193","source":"Crossref","is-referenced-by-count":49,"title":["Computational Fuzzy Extractors"],"prefix":"10.1007","author":[{"given":"Benjamin","family":"Fuller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianrui","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonid","family":"Reyzin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A. Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 474\u2013495. Springer, Heidelberg (2009), http:\/\/dx.doi.org\/10.1007\/978-3-642-00457-5_28"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in NC 0. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 260\u2013271 (2006)","DOI":"10.1007\/11830924_25"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-22792-9_1","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"B. Barak","year":"2011","unstructured":"Barak, B., Dodis, Y., Krawczyk, H., Pereira, O., Pietrzak, K., Standaert, F.-X., Yu, Y.: Leftover hash lemma, revisited. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: 11th International Conference on Random Structures and Algorithms, pp. 200\u2013215 (2003)","DOI":"10.1007\/978-3-540-45198-3_18"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C.H. Bennett","year":"1988","unstructured":"Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. SIAM Journal on Computing\u00a017(2), 210\u2013229 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E. Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/11426639_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"X. Boyen","year":"2005","unstructured":"Boyen, X., Dodis, Y., Katz, J., Ostrovsky, R., Smith, A.: Secure remote authentication using biometric data. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 147\u2013163. Springer, Heidelberg (2005)"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Langlois, A., Peikert, C., Regev, O., Stehl\u00e9, D.: Classical hardness of learning with errors. In: Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing, pp. 575\u2013584. ACM (2013)","DOI":"10.1145\/2488608.2488680"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Brostoff, S., Sasse, M.: Are passfaces more usable than passwords?: A field trial investigation. People and Computers, 405\u2013424 (2000)","DOI":"10.1007\/978-1-4471-0515-2_27"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Castelluccia, C., Mutaf, P.: Shake them up!: A movement-based pairing protocol for CPU-constrained devices. In: Proceedings of the 3rd International Conference on Mobile Systems, Applications, and Services, pp. 51\u201364. ACM (2005)","DOI":"10.1145\/1067170.1067177"},{"key":"10_CR11","first-page":"785","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing","author":"N. Chandran","year":"2010","unstructured":"Chandran, N., Kanukurthi, B., Ostrovsky, R., Reyzin, L.: Privacy amplification with asymptotically optimal entropy loss. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 785\u2013794. ACM, New York (2010), http:\/\/doi.acm.org\/10.1145\/1806689.1806796"},{"key":"10_CR12","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory, 2nd edn. Wiley Interscience (2006)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/978-3-642-28914-9_22","volume-title":"Theory of Cryptography","author":"D. Dachman-Soled","year":"2012","unstructured":"Dachman-Soled, D., Gennaro, R., Krawczyk, H., Malkin, T.: Computational extractors and pseudorandomness. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 383\u2013403. Springer, Heidelberg (2012)"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TCSVT.2003.818350","volume":"14","author":"J. Daugman","year":"2004","unstructured":"Daugman, J.: How iris recognition works. IEEE Transactions on Circuits and Systems for Video Technology\u00a014(1), 21\u201330 (2004)","journal-title":"IEEE Transactions on Circuits and Systems for Video Technology"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing\u00a038(1), 97\u2013139 (2008)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1145\/1536414.1536496","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"Y. Dodis","year":"2009","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. ACM, New York (2009), http:\/\/doi.acm.org\/10.1145\/1536414.1536496"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-38348-9_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"N. D\u00f6ttling","year":"2013","unstructured":"D\u00f6ttling, N., M\u00fcller-Quade, J.: Lossy codes and a new variant of the learning-with-errors problem. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 18\u201334. Springer, Heidelberg (2013)"},{"key":"10_CR18","unstructured":"Fuller, B., Meng, X., Reyzin, L.: Computational fuzzy extractors. Cryptology ePrint Archive (2013), http:\/\/eprint.iacr.org\/2013\/416"},{"key":"10_CR19","first-page":"99","volume-title":"STOC","author":"C. Gentry","year":"2011","unstructured":"Gentry, C., Wichs, D.: Separating succinct non-interactive arguments from all falsifiable assumptions. In: STOC, pp. 99\u2013108. ACM, New York (2011)"},{"key":"10_CR20","unstructured":"Guruswami, V.: Introduction to coding theory - lecture 2: Gilbert-Varshamov bound. University Lecture (2010)"},{"issue":"4","key":"10_CR21","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C.-Y. Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Juels, A., Wattenberg, M.: A fuzzy commitment scheme. In: Sixth ACM Conference on Computer and Communication Security, pp. 28\u201336. ACM (November 1999)","DOI":"10.1145\/319709.319714"},{"issue":"5","key":"10_CR24","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J. Kamp","year":"2007","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM Journal on Computing\u00a036(5), 1231\u20131247 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR25","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.\u00a05479, pp. 206\u2013223. Springer, Heidelberg (2009)"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-14623-7_34","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Krawczyk","year":"2010","unstructured":"Krawczyk, H.: Cryptographic extraction and key derivation: The HKDF scheme. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 631\u2013648. Springer, Heidelberg (2010)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-40041-4_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D. Micciancio","year":"2013","unstructured":"Micciancio, D., Peikert, C.: Hardness of SIS and LWE with Small Parameters. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 21\u201339. Springer, Heidelberg (2013)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences, 43\u201352 (1993)","DOI":"10.1006\/jcss.1996.0004"},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/1536414.1536461","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 333\u2013342. ACM, New York (2009), http:\/\/doi.acm.org\/10.1145\/1536414.1536461"},{"key":"10_CR30","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, pp. 84\u201393. ACM, New York (2005), http:\/\/doi.acm.org\/10.1145\/1060590.1060603"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: Annual IEEE Conference on Computational Complexity, pp. 191\u2013204 (2010)","DOI":"10.1109\/CCC.2010.26"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-20728-0_13","volume-title":"Information Theoretic Security","author":"L. Reyzin","year":"2011","unstructured":"Reyzin, L.: Some notions of entropy for cryptography. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol.\u00a06673, pp. 138\u2013142. Springer, Heidelberg (2011)"},{"key":"10_CR33","unstructured":"Shannon, C.E., Weaver, W., Blahut, R.E., Hajek, B.: The mathematical theory of communication, vol.\u00a0117. University of Illinois press Urbana (1949)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Suh, G.E., Devadas, S.: Physical unclonable functions for device authentication and secret key generation. In: Proceedings of the 44th Annual Design Automation Conference, pp. 9\u201314. ACM (2007)","DOI":"10.1109\/DAC.2007.375043"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11894063_29","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"P. Tuyls","year":"2006","unstructured":"Tuyls, P., Schrijen, G.-J., \u0160kori\u0107, B., van Geloven, J., Verhaegh, N., Wolters, R.: Read-proof hardware from protective coatings. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 369\u2013383. Springer, Heidelberg (2006), http:\/\/dx.doi.org\/10.1007\/11894063_29"},{"key":"10_CR36","doi-asserted-by":"crossref","unstructured":"Vadhan, S.: Pseudorandomness. Foundations and Trends in Theoretical Computer Science. Now Publishers (2012)","DOI":"10.1561\/0400000010"},{"issue":"3","key":"10_CR37","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1093\/comjnl\/36.3.227","volume":"36","author":"M. Zviran","year":"1993","unstructured":"Zviran, M., Haga, W.J.: A comparison of password techniques for multilevel authentication mechanisms. The Computer Journal\u00a036(3), 227\u2013237 (1993)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-42033-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,17]],"date-time":"2022-03-17T06:33:11Z","timestamp":1647498791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-42033-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642420320","9783642420337"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-42033-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}