Encryption against storage-bounded adversaries from on-line strong extractors

Journal of Cryptology

Volumn 17, Issue 1, 2004, Pages 27-42

  Lu, Chi Jen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Bounded storage model; Everlasting security; Expander graphs; List decodable codes; Randomness extractors

Indexed keywords

BOUNDED STORAGE MODELS; EVERLASTING SECURITY; EXPANDER GRAPHS; LIST DECODABLE CODES; RANDOMNESS EXTRACTORS;

CODES (SYMBOLS); DATA PRIVACY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; GRAPH THEORY; NETWORK PROTOCOLS; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 4344636292     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-003-0217-1     Document Type: Article

References (20)

1. N. Alon, J. Bruck, J. Naor, M. Naor, and R. M. Roth. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory, vol. 38, pages 509-516, 1992.
2. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
3. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, vol. 48, no. 6, pages 1668-1680, 2002.
4. Z. Bar-Yossef, O. Reingold, R. Shaltiel, and L. Trevisan. Streaming computaion of combinatorial objects. In Proceedings of the 17th IEEE Annual Conference on Computational Complexity, pages 133-142, 2002.
5. M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs and non-approximability - towards tight results. SIAM Journal on Computing, vol. 27, no. 3, pages 804-915, 1998.
6. C. Cachin and U. Maurer. Unconditional security against memory-bounded adversaries. In Advances in Cryptology - CRYPTO '97, pages 292-306, Lecture Notes in Computer Science, vol. 1294, Springer-Verlag, Berlin, 1997.
7. B. Chor and O. Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, vol. 17, no. 2, pages 230-261, 1988.
8. Y. Z. Ding and M. O. Rabin. Hyper-encryption and everlasting security. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, pages 1-26, 2002.
9. S. Dziembowski and U. Maurer. Tight security proofs for the bounded-storage model. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pages 341-350, 2002.
10. O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences, vol. 22, no. 3, pages 407-420, 1981.
11. O. Goldreich. A Sample of Samplers: A Computational Perspective on Sampling. Electronic Colloquium on Computational Complexity, Technical Report TR97-020, 1997.
12. Z. Hartman and R. Raz. On the distribution of the number of roots of polynomials and logspace explicit extractors. In Proceedings of the 4th International Workshop on Randomization and Approximation Techniques in Computer Science, pages 3-22, 2000.
13. A. Lubotzky, R. Philips, and P. Sarnak. Explicit expanders and the Ramanujan conjecture. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 240-246, 1986.
14. F. J. MacWilliams and N. J. A. Sloan. The Theory of Error-Correcting Codes. North-Holland, Amsterdam, 1981.
15. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, vol. 5, no. 1, pages 53-66, 1992.
16. N. Nisan. Extracting randomness: how and why - a survey. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44-58, 1996.
17. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, vol. 52, no. 1, pages 43-52, 1996.
18. R. Raz, O. Reingold, and S. P. Vadhan. Extracting all the randomness and reducing the error in Trevisan's extractors. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 149-158, 1999.
19. L. Trevisan. Extractors and pseudorandom generators. Journal of ACM, vol. 48, no. 4, pages 860-879, 2001.
20. S. P. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. Cryptology ePrint Archive, Report 2002/162, 2002. http://eprint.iacr.org/.