Abstract
We provide a simple secret-key two-party secure communication scheme, which is provably information-theoretically secure in the limited-storage-space model. The limited-storage-space model postulates an eavesdropper who can execute arbitrarily complex computations, and is only limited in the total amount of storage space (not computation space) available to him. The bound on the storage space can be arbitrarily large (e.g. terabytes), as long as it is fixed. Given this bound, the protocol guarantees that the probability of the eavesdropper of gaining any information on the message is exponentially small. The proof of our main results utilizes a novel combination of linear algebra and Kolmogorov complexity considerations.
| Original language | English |
|---|---|
| Title of host publication | Advances in Cryptology – CRYPTO 1999 - 19th Annual International Cryptology Conference, Proceedings |
| Editors | Michael Wiener |
| Publisher | Springer Verlag |
| Pages | 65-79 |
| Number of pages | 15 |
| ISBN (Print) | 3540663479, 9783540663478 |
| DOIs | |
| State | Published - 1999 |
| Event | 19th Annual International Cryptology Conference, CRYPTO 1999 - Santa Barbara, United States Duration: 15 Aug 1999 → 19 Aug 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1666 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 19th Annual International Cryptology Conference, CRYPTO 1999 |
|---|---|
| Country/Territory | United States |
| City | Santa Barbara |
| Period | 15/08/99 → 19/08/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.