Tight security proofs for the bounded-storage model

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 341-350

  Dziembowski, Stefan ^a   Maurer, Ueli ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; MATHEMATICAL MODELS; RESOURCE ALLOCATION; SECURITY OF DATA;

BOUNDED STORAGE MODEL; SECURITY PROOF;

CRYPTOGRAPHY;

EID: 0036040061     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509960     Document Type: Conference Paper

References (18)

1. Everlasting security in the bounded storage model
2. Information theoretically secure communication in the limited storage space model
3. Weighted sums of certain dependent random variables
4. Experimental quantum cryptography
5. Oblivious transfer with a memory-bounded receiver
6. Unconditional security against memory-bounded adversaries
7. Oblivious transfer in the bounded storage model
8. Hyper-encryption and everlasting security
9. Concentration of measure for the analysis of randomised algorithms
10. Probabilistic Encryption
11. The rip van winkle cipher - A simple and probably computationally secure cipher with a finite key
12. Conditionally-perfect secrecy and a provably-secure randomized cipher
13. Secret key agreement by public discussion
14. Communication theory of secrecy systems