Key agreement from close secrets over unsecured channels

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5479 LNCS, Issue , 2009, Pages 206-223

  Kanukurthi, BhaVana ^a   Reyzin, Leonid ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENTROPY LOSS; KEY AGREEMENT; NON-INTERACTIVE; POLYNOMIAL-TIME; PRIVACY AMPLIFICATION; ROBUST FUZZY; SECURITY PARAMETERS;

AMPLIFICATION; CRYPTOGRAPHY; INFORMATION THEORY; POLYNOMIAL APPROXIMATION;

ENTROPY;

EID: 67650671123     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01001-9_12     Document Type: Conference Paper

References (27)

1. [BC92] Bos, J.N.E., Chaum, D.: Provably Unforgeable Signatures. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 1-14. Springer, Heidelberg (1993)
2. +05] Boyen, X., Dodis, Y., Katz, J., Ostrovsky, R., Smith, A.: Secure Remote Authentication Using Biometric Data. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 147-163. Springer, Heidelberg (2005) (Pubitemid 41313951)
3. [BJKS93] Bierbrauer, J., Johansson, T., Kabatianskii, G., Smeets, B.: On Families of Hash Functions via Geometric Codes and Concatenation. In: Stinson [Sti93], pp. 331-342
4. +08] Cramer, R., Dodis, Y., Fehr, S., Padro, 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. 4965, pp. 471-488. Springer, Heidelberg (2008) (Pubitemid 351762845)
5. [Che97] Cheung, S.: An efficient message authentication scheme for link state routing. In: 13th Annual Computer Security Applications Conference, pp. 90-98 (1997)
6. [CL06] Chang, E.-C., Li, Q.: Hiding Secret Points Amidst Chaff. In: VauDenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 59-72. Springer, Heidelberg (2006) (Pubitemid 44072233)
7. [CRVW02] Capalbo, M.R., Reingold, O., Vadhan, S.P., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: IEEE Conference on Computational Complexity, p. 15 (2002) (Pubitemid 34691882)
8. [CW79] Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences 18, 143-154 (1979)
9. [dB93] Den Boer, B.: A Simple and Key-Economical Unconditional Authentication Scheme. Journal of Computer Security 2, 65-71 (1993)
10. [DKRS06] 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-250. Springer, Heidelberg (2006) (Pubitemid 44532119)
11. [DORS08] 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 38(1), 97-139 (2007); arXiv:cs/0602007
12. [DW08] Dodis, Y., Wichs, D.: One-round authenticated key agreement from weak secrets. Technical Report 2008/503, Cryptology ePrint archive (2008), http://eprint.iacr.org
13. [HILL99] Hstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal on Computing 28(4), 1364-1396 (1999)
14. [KR08a] Kanukurthi, B., Reyzin, L.: An Improved Robust Fuzzy Extractor. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 156-171. Springer, Heidelberg (2008)
15. [KR08b] Kanukurthi, B., Reyzin, L.: Key agreement from close secrets over unsecured channels. Technical Report 2008/494, Cryptology ePrint archive (2008), http://eprint.iacr.org
16. [Mau97] Maurer, U.M.: Information-theoretically secure secret-key agreement by NOT authenticated public discussion. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 209-225. Springer, Heidelberg (1997)
17. [MW97] Maurer, U.M., Wolf, S.: Privacy amplification secure against active adversaries. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 307-321. Springer, Heidelberg (1997) (Pubitemid 127112561)
18. [MW03] Maurer, U., Wolf, S.: Secret-key agreement over unauthenticated public channels - Part III: Privacy amplification. IEEE Trans. Info. Theory 49(4), 839-851 (2003)
19. [NZ96] Nisan, N., Zuckerman, D.: Randomness is linear in space. Journal of Computer and System Sciences 52(1), 43-53 (1996)
20. [RR02] Reyzin, L., Reyzin, N.: Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 144-153. Springer, Heidelberg (2002)
21. [RW03] 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-95. Springer, Heidelberg (2003) (Pubitemid 137636936)
22. [RW04] Renner, R.S., Wolf, S.: The Exact Price for Unconditionally Secure Asymmetric Cryptography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 109-125. Springer, Heidelberg (2004)
23. [Sho99] Shoup, V.: On formal models for secure key exchange. Technical Report RZ 3120 (#93166), IBM Zurich Research Lab (1999), http://eprint.iacr.org/ 1999/012
24. [Sho01] Shoup, V.: Ntl: A library for doing number theory, version 5.4.2 (2001), http://www.shoup.net/ntl
25. [Sti93] Stinson, D.R. (ed.): CRYPTO 1993. LNCS, vol. 773, pp. 22-26. Springer, Heidelberg (1994)
26. [Tay93] Taylor, R.: An Integrity Check Value Algorithm for Stream Ciphers. In: Stinson [Sti93], pp. 40-48
27. [Wol98] 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-419. Springer, Heidelberg (1998) (Pubitemid 128151436)