Pages that link to "Item:Q1879468"
From MaRDI portal
The following pages link to Constructing locally computable extractors and cryptosystems in the bounded-storage model (Q1879468):
Displaying 27 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)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries (Q1629393) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Incremental deterministic public-key encryption (Q1747660) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Authentication in the bounded storage model (Q2170109) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition (Q2840793) (← links)
- Efficient and Provable White-Box Primitives (Q2958118) (← links)
- Bounded-Retrieval Model with Keys Derived from Private Data (Q2980861) (← links)
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes (Q3453318) (← links)
- Secure Computation from Leaky Correlated Randomness (Q3457091) (← links)
- A Leakage-Resilient Mode of Operation (Q3627451) (← links)
- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes (Q4931664) (← links)
- (Q5091780) (← links)
- Nonmalleable Extractors and Codes, with Their Many Tampered Extensions (Q5129235) (← links)
- Efficient Error-Correcting Codes for Sliding Windows (Q5220468) (← links)
- Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs (Q5738884) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
