Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
From MaRDI portal
Publication:1629393
DOI10.1007/978-3-030-03807-6_1zbMath1443.94080OpenAlexW2899198057MaRDI QIDQ1629393
Aishwarya Thiruvengadam, Stefano Tessaro
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_1
Related Items
Hiding in plain sight: memory-tight proofs via randomness programming ⋮ Memory-tight multi-challenge security of public-key encryption ⋮ Quantum key-length extension ⋮ Unnamed Item ⋮ Tight time-space lower bounds for finding multiple collision pairs and their applications ⋮ The memory-tightness of authenticated encryption ⋮ On the streaming indistinguishability of a random permutation and a random function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 -- May 4, 2017. Proceedings. Part II
- A time-space tradeoff for sorting on non-oblivious machines
- Pseudorandom generators for space-bounded computation
- Parallel collision search with cryptanalytic applications
- Memory-tight reductions
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Randomness is linear in space
- Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
- Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
- Big-Key Symmetric Encryption: Resisting Key Exfiltration
- Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
- Pseudorandomness
- Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
- High Parallel Complexity Graphs and Memory-Hard Functions
- Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
- Pseudorandomness for Linear Length Branching Programs and Stack Machines
- Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
- Time-space trade-off lower bounds for randomized computation of decision problems
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
- Cascade Encryption Revisited
- A monte carlo method for factorization
- A Pseudorandom Generator from any One-way Function
- Near-Optimal Time-Space Tradeoff for Element Distinctness
- Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
- Extractor-based time-space lower bounds for learning
- Pseudorandomness from Shrinkage
- Depth-Robust Graphs and Their Cumulative Memory Complexity
- Scrypt Is Maximally Memory-Hard
This page was built for publication: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
