Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
type: Item
instance of: scholarly article
title: Provable time-memory trade-offs: symmetric cryptography against memory-bounded adversaries
zbMATH Open document ID: 1443.94080
DOI: 10.1007/978-3-030-03807-6_1
author: Stefano Tessaro
author: Aishwarya Thiruvengadam
publication date: 2018-12-11T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6992085
zbMATH Keywords: foundations
zbMATH Keywords: symmetric cryptography
zbMATH Keywords: randomness extraction
MaRDI profile type: Publication
full work available at URL: 978-3-030-03807-6 1
OpenAlex ID: W2899198057
cites work: Q4249346
cites work: Q3002761
cites work: Depth-Robust Graphs and Their Cumulative Memory Complexity
cites work: Scrypt Is Maximally Memory-Hard
cites work: Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
cites work: High Parallel Complexity Graphs and Memory-Hard Functions
cites work: Memory-tight reductions
cites work: Time-space trade-off lower bounds for randomized computation of decision problems
cites work: Q4941860
cites work: Big-Key Symmetric Encryption: Resisting Key Exfiltration
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Pseudorandomness for Linear Length Branching Programs and Stack Machines
cites work: A time-space tradeoff for sorting on non-oblivious machines
cites work: 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
cites work: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
cites work: Extractor-based time-space lower bounds for learning
cites work: Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
cites work: Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes
cites work: Cascade Encryption Revisited
cites work: Efficient and Optimally Secure Key-Length Extension for Block Ciphers via Randomized Cascading
cites work: A Pseudorandom Generator from any One-way Function
cites work: Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
cites work: Pseudorandomness from Shrinkage
cites work: Towards Key-Length Extension with Optimal Security: Cascade Encryption and Xor-cascade Encryption
cites work: Pseudorandom generators for space-bounded computation
cites work: Randomness is linear in space
cites work: A monte carlo method for factorization
cites work: Advances in cryptology -- CRYPTO 2016. 36th annual international cryptology conference, Santa Barbara, CA, USA, August 14--18, 2016. Proceedings. Part I
cites work: Constructing locally computable extractors and cryptosystems in the bounded-storage model
cites work: Pseudorandomness
cites work: Parallel collision search with cryptanalytic applications
cites work: Near-Optimal Time-Space Tradeoff for Element Distinctness
description: scientific article; zbMATH DE number 6992085