Privacy amplification with asymptotically optimal entropy loss

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 785-794

  Chandran, Nishanth ^a   Kanukurthi, Bhavana ^b   Ostrovsky, Rafail ^c   Reyzin, Leonid ^b  

^a University of California   (United States)

^b BOSTON UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

entropy loss; information theoretic key agreement; privacy amplification

Indexed keywords

ASYMPTOTICALLY OPTIMAL; COMPUTATIONAL ASSUMPTIONS; CONSTANT FACTORS; CRYPTOGRAPHIC PROTOCOLS; EDIT DISTANCE; ENTROPY LOSS; ERROR CORRECTING CODE; KEY AGREEMENT; KEY AGREEMENT PROTOCOL; NONUNIFORM; PARTIAL KNOWLEDGE; PRIVACY AMPLIFICATION; SECURITY DEVICES; SECURITY PARAMETERS;

AMPLIFICATION; COMPUTATION THEORY; CRYPTOGRAPHY; ENTROPY; INFORMATION THEORY; INTERNET PROTOCOLS; OPTIMIZATION;

NETWORK SECURITY;

EID: 77954731169     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806796     Document Type: Conference Paper

References (22)

1. C. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM Journal on Computing, 17(2):210-229, 1988.
2. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer. Generalized privacy amplification. IEEE Transactions on Information Theory, 41(6):1915-1923, 1995.
3. X. Boyen, Y. Dodis, J. Katz, R. Ostrovsky, and A. Smith. Secure remote authentication using biometric data. In R. Cramer, editor, Advances in Cryptology - EUROCRYPT 2005, volume 3494 of LNCS, pages 147-163. Springer-Verlag, 2005.
4. N. Chandran, B. Kanukurthi, R. Ostrovsky, and L. Reyzin. Privacy amplification with asymptotically optimal entropy loss. Cryptology ePrint Archive, 2010. http://eprint.iacr.org/2010/.
5. Y. Dodis, J. Katz, L. Reyzin, and A. Smith. Robust fuzzy extractors and authenticated key agreement from close secrets. In C. Dwork, editor, Advances in Cryptology - CRYPTO 2006, volume 4117 of LNCS, pages 232-250. Springer-Verlag, 20-24 Aug. 2006.
6. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM Journal on Computing, 38(1):97-139, 2008. arXiv:cs/0602007.
7. Y. Dodis and D. Wichs. Non-malleable extractors and symmetric key cryptography from weak secrets. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pages 601-610, Bethesda, Maryland, 31 May-2 June 2009.
8. V. Guruswami, C. Umans, and S. P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. In IEEE Conference on Computational Complexity, pages 96-108, 2007.
9. Y. Ishai, E. Kushilevitz, R. Ostrovsky, and A. Sahai. Extracting correlations. In 50th Annual Symposium on Foundations of Computer Science, Atlanta, Georgia, Oct. 2009. IEEE.
10. B. Kanukurthi and L. Reyzin. An improved robust fuzzy extractor. In R. Ostrovsky, R. D. Prisco, and I. Visconti, editors, Sixth Conference on Security and Cryptography in Networks SCN '08, volume 5229 of LNCS, pages 206-223, Sept. 2008.
11. B. Kanukurthi and L. Reyzin. Key agreement from close secrets over unsecured channels. Technical Report 2008/494, Cryptology ePrint archive, http://eprint.iacr.org, 2008.
12. B. Kanukurthi and L. Reyzin. Key agreement from close secrets over unsecured channels. In A. Joux, editor, Advances in Cryptology - EUROCRYPT 2009, volume 5479 of LNCS. Springer, 2009.
13. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10:707-710, Feb. 1966.
14. U. Maurer. Information-theoretically secure secret-key agreement by NOT authenticated public discussion. In W. Fumy, editor, Advances in Cryptology - EUROCRYPT 97, volume 1233 of LNCS, pages 209-225. Springer-Verlag, 1997.
15. U. Maurer and S. Wolf. Privacy amplification secure against active adversaries. In B. S. Kaliski, Jr., editor, Advances in Cryptology - CRYPTO '97, volume 1294 of LNCS, pages 307-321. Springer-Verlag, 1997.
16. U. Maurer and S. Wolf. Secret-key agreement over unauthenticated public channels - Part III: Privacy amplification. IEEE Trans. Info. Theory, 49(4):839-851, 2003.
17. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1):43-53, 1996.
18. J. Radhakrishnan and A. Ta-Shma. Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM Journal on Computing, 13(1):2-24, 2000.
19. R. Renner and S. Wolf. Unconditional authenticity and privacy from an arbitrarily weak secret. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 78-95. Springer-Verlag, 2003.
20. R. Renner and S. Wolf. The exact price for unconditionally secure asymmetric cryptography. In C. Cachin and J. Camenisch, editors, Advances in Cryptology - EUROCRYPT 2004, volume 3027 of LNCS, pages 109-125. Springer-Verlag, 2004.
21. L. J. Schulman and D. Zuckerman. Asymptotically good codes correcting insertions, deletions, and transpositions. IEEE Transactions on Information Theory, 45(7):2552-2557, 1999.
22. S. Wolf. Strong security against active attacks in information-theoretic secret-key agreement. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT '98, volume 1514 of LNCS, pages 405-419. Springer-Verlag, 1998.