Pages that link to "Item:Q1879467"
From MaRDI portal
The following pages link to Encryption against storage-bounded adversaries from on-line strong extractors (Q1879467):
Displaying 12 items.
- How to re-use a one-time pad safely and almost optimally even if \(\mathrm P=\mathrm{NP}\) (Q268461) (← links)
- Innovative approaches for security of small artefacts (Q465672) (← links)
- Optimal randomizer efficiency in the bounded-storage model (Q1879466) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Strong Knowledge Extractors for Public-Key Encryption Schemes (Q3163103) (← links)
- (Q4409123) (← links)
- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes (Q4931664) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428111) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
