Correcting errors without leaking partial information

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 654-663

  Dodis, Yevgeniy ^a   Smith, Adam ^b  

^a NEW YORK UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Bounded Storage Model; Code Obfuscation; Cryptography; Entropic Security; Error Correcting Codes; Information Reconciliation; Randomness Extractors

Indexed keywords

BOUNDED STORAGE MODEL; CODE OBFUSCATION; ENTROPIC SECURITY; ERROR-CORRECTING CODES; INFORMATION RECONCILIATION; RANDOMNESS EXTRACTORS;

CODES (SYMBOLS); ENTROPY; ERROR ANALYSIS; MATHEMATICAL MODELS; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 34848837353     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060688     Document Type: Conference Paper

References (28)

1. B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S. Vadhan, K. Yang. On the (Im)possibility of Obfuscating Programs. In Advances in Cryptology - CRYPTO 2001, pp. 1-18.
2. C. Bennett, G. Brassard, and J. Robert. Privacy Amplification by Public Discussion. SIAM J. on Computing, 17(2), pp. 210-229, 1988.
3. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. STOC 2003: 612-621
4. Gilles Brassard, Louis Salvail. Secret-Key Reconciliation by Public Discussion. In Advances in Cryptology -EUROCRYPT 1993, p. 410-423.
5. Christian Cachin, Ueli M. Maurer. Linking Information Reconciliation and Privacy Amplification. In J. Cryptology, 10(2), 97-110, 1997.
6. R. Canetti. Towards realizing random oracles: Hash functions that hide all partial information, In Advances in Cryptology - CRYPTO 1997.
7. R. Canetti, D. Micciancio, O. Reingold. Perfectly One-Way Probabilistic Hash Functions. In Proc. 30th ACM Symp. on Theory of Computing, 1998, pp. 131-140.
8. V. Chauhan and A. Trachtenberg. Reconciliation puzzles. IEEE Globecom 2004.
9. Graham Cormode, Mike Paterson, Süleyman Cenk Sahinalp, Uzi Vishkin. Communication complexity of document exchange. Proc. ACM Symp. on Discrete Algorithms, 2000, p. 197-206.
10. Y.Z. Ding. Error Correction In the Bounded Storage Model, In Theory of Cryptography 2005.
11. Y. Dodis, L. Reyzin and A. Smith. Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. In Advances in Cryptology - EUROCRYPT 2004.
12. Y. Dodis and A. Smith. Entropic Security and the Encryption of High-Entropy Messages. In Theory of Cryptography 2005.
13. S. Goldwasser and S. Micali. Probabilistic encryption. JCSS, 28(2), pp. 270-299, April 1984.
14. R. Impagliazzo and D. Zuckerman. How to Recycle Random Bits. In Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989.
15. A. Juels, M. Wattenberg. A Fuzzy Commitment Scheme. In Proc. ACM Conf. Computer and Communications Security, 1999, pp. 28-36.
16. A. Juels and M. Sudan. A Fuzzy Vault Scheme. In IEEE International Symposium on Information Theory, 2002.
17. Shengli Liu and Henk C. A. Van Tilborg and Marten Van Dijk. Practical Protocol for Advantage Distillation and Information Reconciliation. Des. Codes Cryptography, 30(1), 39-62, 2003.
18. Chi-Jen Lu. Encryption against Storage-Bounded Adversaries from Oil-Line Strong Extractors. J. Cryptology, 17(1): 27-42 (2004).
19. Ben Lynn, Manoj Prabhakaran, Amit Sahai. Positive Results and Techniques for Obfuscation. Advances in Cryptology -EUROCRYPT 2004, p. 20-39.
20. F. J. MacWilllams and N. J. A. Sloane. The Theory of Error-Correcting Codes, North-Holland, Amsterdam, New York, Oxford, 1978.
21. U. Maurer. Secret Key Agreement by Public Discussion. IEEE Trans. on Info. Theory, 39(3):733-742, 1993.
22. J. Naor, M. Naor. Small-Bias Probability Spaces: Efficient Constructions and Applications.SIAM J. Comput. 22(4): 838-856 (1993).
23. N. Nisan, D. Zuckerman. Randomness is Linear in Space. In JCSS, 52(1), pp. 43-52, 1996.
24. A. Russell and Wang. How to Fool an Unbounded Adversary with a Short Key. In Advances in Cryptology -EUROCRYPT 2002.
25. R. Shaltiel. Recent developments in Explicit Constructions of Extractors. Bulletin of the EATCS, 77, pp. 67-95, 2002.
26. A. Smith. Maintaining Secrecy When Information Leakage is Unavoidable. Ph.D. Thesis, Massachusetts Institute of Technology, 2004.
27. Salil P. Vadhan. Constructing Locally Computable Extractors and Cryptosystems In the Bounded-Storage Model. J. Cryptology 17(1): 43-77 (2004).
28. Hoeteck Wee. On Obfuscating Point Functions. (These Proceedings.) Proc. 37th ACM Symp. on Theory of Computing, 2005.