Scrambling adversarial errors using few random bits, optimal information reconciliation, and better private codes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 395-404

  Smith, Adam ^a  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; CODES (SYMBOLS); CONCATENATED CODES; ENTROPY; ERRORS;

CAPACITY-APPROACHING; COMPUTATIONAL ASSUMPTIONS; COMPUTATIONALLY EFFICIENT; COOPERATING PARTIES; ENTROPY FUNCTION; OPTIMAL COMMUNICATION; RECONCILIATION PROTOCOLS; SHANNON CAPACITY;

RANDOM ERRORS;

EID: 84969141630     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)

1. C. Bennett, G. Brassard, and J. 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. G. Brassard and L. Salvail. Secret-key reconciliation by public discussion. In EUROCRYPT, pages 410-423, 1993.
4. G. Cormode, M. Paterson, S. C. Sahinalp, and U. Vishkin. Communication complexity of document exchange. In SODA, pages 197-206, 2000.
5. T. Cover and J. Thomas. Elements of Information Theory. Wiley Series in Telecommunications, 1991.
6. Y. Z. Ding. Error correction in the bounded storage model. In Kilian [20].
7. Y. Z. Ding, P. Gopalan, and R. J. Lipton. Error correction against computationally bounded adversaries. Manuscript. Appeared initially as [23], 2004.
8. Y. Z. Ding, D. Harnik, A. Rosen, and R. Shaltiel. Constant-round oblivious transfer in the bounded storage model. In TCC 2004, pages 446-472, 2004.
9. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith. Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004.
10. Y. Dodis and A. Smith. Correcting errors without leaking partial information. In H. N. Gabow and R. Fagin, editors, STOC, pages 654-663. ACM, 2005.
11. P. Elias. Error-correcting codes for list decoding. IEEE Transactions on Information Theory, 37(1):5-12, 1991.
12. G. D. Forney. Concatenated Codes. PhD thesis, MIT, 1966.
13. V. Guruswami. List decoding with side information. In IEEE Conference on Computational Complexity, pages 300-. IEEE Computer Society, 2003.
14. V. Guruswami, J. Håstad, M. Sudan, and D. Zuckerman. Combinatorial bounds for list decoding. IEEE Transactions on Information Theory, 48(5):1021-1034, 2002.
15. V. Guruswami and A. Rudra. Explicit capacityachieving list-decodable codes. In STOC 2006, 2006.
16. V. Guruswami and M. Sudan. List decoding algorithms for certain concatenated codes. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pages 181-190, Portland, Oregon, 21-23 May 2000.
17. A. Juels and M. Sudan. A fuzzy vault scheme. In IEEE International Symposium on Information Theory, 2002.
18. A. Juels and M. Wattenberg. A fuzzy commitment scheme. In Sixth ACM Conference on Computer and Communication Security, pages 28-36. ACM, Nov. 1999.
19. E. Kaplan, M. Naor, and O. Reingold. Derandomized constructions of k-wise (almost) independent permutations. In APPROX-RANDOM, pages 354-365, 2005.
20. J. Kilian, editor. First Theory of Cryptography Conference - TCC 2005, volume 3378 of Lecture Notes in Computer Science. Springer-Verlag, Feb. 10-12 2005.
21. M. Langberg. Private codes or succinct random codes that are (almost) perfect. In FOCS '04: Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 325-334, Washington, DC, USA, 2004. IEEE Computer Society.
22. J.-P. M. G. Linnartz and P. Tuyls. New shielding functions to enhance privacy and prevent misuse of biometric templates. In AVBPA, pages 393-402, 2003.
23. R. J. Lipton. A new approach to information theory. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, STACS, volume 775 of Lecture Notes in Computer Science, pages 699-708. Springer, 1994. The full version of this paper is in preparation [7].
24. S. Micali, C. Peikert, M. Sudan, and D. Wilson. Optimal error correction against computationally bounded noise. In Kilian [20].
25. Y. Minsky and A. Trachtenberg. Scalable set reconciliation. In 40th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2002. See also tehcnial report BUECE- 2002-01.
26. Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Transactions on Information Theory, 49(9):2213-2218, 2003.
27. A. Orlitsky. Worst-case interactive communication i: Two messages are almost optimal. IEEE Transactions on Information Theory, 36(5):1111-1126, 1990.
28. A. Orlitsky. Average-case interactive communication. IEEE Transactions on Information Theory, 38(5):1534-1547, 1992.
29. A. Orlitsky. Interactive communication of balanced distributions and of correlated files. SIAM J. Discrete Math., 6(4):548-564, 1993.
30. R. Renner and S. Wolf. The exact price for unconditionally secure asymmetric cryptography. In C. Cachin and J. Camenisch, editors, EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 109-125. Springer-Verlag, 2004.
31. R. Renner and S. Wolf. Simple and tight bounds for information reconciliation and privacy amplification. In B. Roy, editor, Advances in Cryptology-ASIACRYPT 2005, Lecture Notes in Computer Science, Chennai, India, 4-8 Dec. 2005. Springer-Verlag.
32. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM J. Discrete Math., 8(2):223-250, 1995.
33. A. Smith. Scrambling aversarial errors using few random bits. IACR ePrint report 2006/020, available at http://eprint.iacr.org, 2006.
34. H. Stichtenoth. Algebraic Function Fields and Codes. Springer, 1993.
35. J. van Lint. Introduction to Coding Theory. Springer-Verlag, 1992.
36. V. V. Zyablov and M. S. Pinsker. List cascade decoding. Problems of Information Transmission, 17(4):29-34, 1981. (In Russian); pp. 236-240 (in English), 1982.