Hyper-encryption against space-bounded adversaries from on-line strong extractors

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

Volumn 2442, Issue , 2002, Pages 257-271

  Lu, Chi Jen ^a  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; RANDOM PROCESSES; SIGNAL RECEIVERS;

BOUNDED STORAGE MODEL; ENCRYPTION SCHEMES; EXPONENTIAL NUMBERS; HYPER-ENCRYPTION; INTUITIVE UNDERSTANDING; PARTIAL INFORMATION; RANDOMNESS EXTRACTORS; SECURITY PROPERTIES;

CRYPTOGRAPHY;

EID: 84937432504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45708-9_17     Document Type: Conference Paper

References (17)

1. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley Interscience, New York, 1992.
2. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. To appear in IEEE Transactions on Information Theory, 2002.
3. M. Bellare, O. Goldreich and M. Sudan. Free bits, PCPs and non-approximability — towards tight results. SIAM Journal on Computing, 27(3), pages 804–915, 1998.
4. C. Cachin and U. Maurer. Unconditional security against memory-bounded adversaries. In Advances in Cryptology – CRYPTO’97, Lecture Notes in Computer Science, Springer-Verlag, vol. 1294, pages 292–306, 1997.
5. 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.
6. S. Dziembowski and U. Maurer. Tight security proofs for the bounded-storage model. To appear in Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 2002.
7. O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators. Journal of Computer and System Sciences, 22(3), pages 407–420, 1981.
8. 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.
9. F. J. MacWilliams and N. J. A. Sloan. The Theory of Error-Correcting Codes. Noth-Holland, 1981.
10. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1), pages 53–66, 1992.
11. N. Nisan. Extracting randomness: how and why — a survey. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 44–58, 1996.
12. N. Nisan and A. Wigderson. Hardness vs. randomness. Journal of Computer and System Sciences, 49(2), pages 149–167, 1994.
13. N. Nisan and D. Zuckerman. Randomness is linear in space. Journal of Computer and System Sciences, 52(1), pages 43–52, 1996.
14. R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudo-random generators with optimal seed length. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 1–10, 2000.
15. 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.
16. L. Trevisan. Extractors and pseudorandom generators. Journal of ACM, 48(4), pages 860–879, 2001.
17. A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on the Foundations of Computer Science, pages 80–91, 1982.