On generating the initial key in the bounded-storage model

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

Volumn 3027, Issue , 2004, Pages 126-137

  Dziembowski, Stefan ^a   Maurer, Ueli ^b  

^a UNIVERSITY OF WARSAW   (Poland)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; INFORMATION THEORY; NETWORK SECURITY;

BOUNDED STORAGE MODEL; COMPUTATIONAL SECURITY; KEY AGREEMENT PROTOCOL; KEY AGREEMENT SCHEME; PROVABLE SECURITY; SECRET KEY AGREEMENT; STANDARD DEFINITIONS; STORAGE OPERATIONS;

CRYPTOGRAPHY;

EID: 35048832981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_8     Document Type: Article

References (17)

1. Y. Aumann, Y. Z. Ding, and M. O. Rabin. Everlasting security in the bounded storage model. IEEE Transactions on Information Theory, 48(6): 1668-1680, 2002.
2. Y. Aumann and M. O. Rabin. Information theoretically secure communication in the limited storage space model. Advances in Cryptology - CRYPTO '99, 65-79, 1999.
3. C. Cachin and U. Maurer. Unconditional security against memory-bounded adversaries. Advances in Cryptology - CRYPTO '97, 292-306, 1997.
4. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the ACM, 45(6): 965-981, 1998.
5. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 1991.
6. G. Di Crescenzo, T. Malkin, and R. Ostrovsky. Single database private information retrieval implies oblivious transfer. Advances in Cryptology - EUROCRYPT 2000, 122-138, 2000.
7. W. Diffie and M.E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, 22(6): 644-654, 1976.
8. Y. Z. Ding. Oblivious transfer in the bounded storage model. Advances in Cryptology - CRYPTO 2001, 155-170, 2001.
9. Y. Z. Ding. Provable Everlasting Security in the Bounded Storage Model. PhD thesis, Harvard University, 2001.
10. Y. Z. Ding and M. O. Rabin. Hyper-encryption and everlasting security. STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, 1-26, 2002.
11. S. Dziembowski and U. Maurer. Tight security proofs for the bounded-storage model. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, 341-350, 2002.
12. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan. Relationship between public key encryption and oblivious transfer. In 41st Annual Symposium on Foundations of Computer Science, 325-339, 2000.
13. E. Kushilevitz and R. Ostrovsky. Replication is not needed: Single database, computationally-private information retrieval. In 38th Annual Symposium on Foundations of Computer Science, 364-373, 1997.
14. C. Lu. Hyper-encryption against space-bounded adversaries from on-line strong extractors. Advances in Cryptology - CRYPTO 2002, 257-271, 2002.
15. U. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. Journal of Cryptology, 5(1): 53-66, 1992.
16. U. Maurer. Secret key agreement by public discussion. IEEE Transactions on Information Theory, 39(3): 733-742, 1993.
17. S. Vadhan. On constructing locally computable extractors and cryptosystems in the bounded storage model. Advances in Cryptology - CRYPTO 2003, 61-77, 2003.