Offline-online indifferentiability of cryptographic systems

DOI10.1007/978-3-032-12293-3_1MaRDI QIDQ7233187zbMATH OpenFDO

Authors Ashrujit Ghoshal, Ilan Komargodski, Gil Segev

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12293-3_1

zbMATH Keywords

indifferentiability framework

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A cryptanalytic time-memory trade-off
• Careful with composition: limitations of the indifferentiability framework
• Fixing cracks in the concrete: random oracles with auxiliary input, revisited
• Indifferentiability of confusion-diffusion networks
• Merkle-Damgård Revisited: How to Construct a Hash Function
• Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
• On the indifferentiability of key-alternating ciphers
• On the Indifferentiability of the Sponge Construction
• On the public indifferentiability and correlation intractability of the 6-round Feistel construction
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions
• Random Oracles and Auxiliary Input
• Random oracles and non-uniformity
• Resource-restricted indifferentiability
• Rigorous Time/Space Trade-offs for Inverting Functions
• Salvaging indifferentiability in a multi-stage setting
• Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
• The equivalence of the random oracle model and the ideal cipher model, revisited
• The query-complexity of preprocessing attacks
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Theory of Cryptography
• Theory of Cryptography
• Time-space lower bounds for finding collisions in Merkle-Damgård Hash functions
• Time-space tradeoffs and short collisions in Merkle-Damgård hash functions
• Time-space tradeoffs for sponge hashing: attacks and limitations for short collisions
• Towards defeating backdoored random oracles: indifferentiability with bounded adaptivity
• Unifying presampling via concentration bounds
• Universally composable security

This page was built for publication: Offline-online indifferentiability of cryptographic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233187)