Careful with Composition: Limitations of the Indifferentiability Framework
From MaRDI portal
Publication:3003399
DOI10.1007/978-3-642-20465-4_27zbMath1290.94155OpenAlexW1619166970MaRDI QIDQ3003399
Thomas Ristenpart, Hovav Shacham, Thomas Shrimpton
Publication date: 27 May 2011
Published in: Advances in Cryptology – EUROCRYPT 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20465-4_27
Related Items (37)
How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications ⋮ Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles ⋮ Improved indifferentiability security bound for the JH mode ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Extracts from the SHA-3 Competition ⋮ Provable Security of BLAKE with Non-ideal Compression Function ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Query-Complexity Amplification for Random Oracles ⋮ Open problems in hash function security ⋮ Improved domain extender for the ideal cipher ⋮ Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA ⋮ Context discovery and commitment attacks. How to break CCM, EAX, SIV, and more ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions ⋮ A modular approach to the incompressibility of block-cipher-based AEADs ⋮ \textsc{SwiftEC}: Shallue-van de Woestijne indifferentiable function to elliptic curves. Faster indifferentiable hashing to elliptic curves ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Leakage-Resilient Chosen-Ciphertext Secure Functional Encryption from Garbled Circuits ⋮ How to sample a discrete Gaussian (and more) from a random oracle ⋮ State separation for code-based game-playing proofs ⋮ Functional broadcast encryption with applications to data sharing for cloud storage ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ Indifferentiable deterministic hashing to elliptic and hyperelliptic curves ⋮ Optimal collision security in double block length hashing with single length key ⋮ Public-Seed Pseudorandom Permutations ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties ⋮ Indifferentiability of 8-Round Feistel Networks ⋮ Indifferentiability for public key cryptosystems ⋮ Quantifying the security cost of migrating protocols to practice ⋮ Incompressible encodings ⋮ Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
This page was built for publication: Careful with Composition: Limitations of the Indifferentiability Framework
