Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Extractors Using Hardness Amplification
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Simple extractors via constructions of cryptographic pseudo-random generators
Theoretical Computer Science
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
SIAM Journal on Computing
One-time computable self-erasing functions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
On everlasting security in the hybrid bounded storage model
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Simple extractors via constructions of cryptographic pseudo-random generators
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Universally composable privacy amplification against quantum adversaries
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Intrusion-Resilience via the bounded-storage model
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Perfectly secure password protocols in the bounded retrieval model
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Information security in a quantum world
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
A computational indistinguishability logic for the bounded storage model
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
| Hi-index | 0.00 |
In the bounded-storage model for information-theoretically secure encryption and key-agreement one can prove the security of a cipher based on the sole assumption that the adversary’s storage capacity is bounded, say by $s$ bits, even if her computational power is unlimited. Assume that a random $t$-bit string $R$ is either publicly available (e.g., the signal of a deep-space radio source) or broadcast by one of the legitimate parties. If $s ns$), or the adversary was assumed to be able to store only $s$ actual bits of $R$ rather than arbitrary $s$ bits of information about $R$, or the adversary received a non-negligible amount of information about $X$. In this paper we prove the first non-restricted security result in the bounded-storage model: $K$ is short, $X$ is very long, and $t$ needs to be only moderately larger than $s + n$. In fact, $s/t$ can be arbitrarily close to $1$ and hence the storage bound is essentially optimal. The security can be proved also if $R$ is not uniformly random, provided that the min-entropy of $R$ is sufficiently greater than $s$.