From Indifferentiability to Constructive Cryptography (and Back)
From MaRDI portal
Publication:3179350
Recommendations
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Constructive cryptography -- a primer. (Abstract)
- Indifferentiability for public key cryptosystems
- scientific article; zbMATH DE number 1164029
- Inductive Proofs of Computational Secrecy
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- On the indifferentiability of key-alternating ciphers
- scientific article; zbMATH DE number 7759462
- Theory and application of computationally-independent one-way functions: interactive proof of ability -- revisited
Cites work
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- scientific article; zbMATH DE number 6765508 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
- Careful with composition: limitations of the indifferentiability framework
- Confidentiality and integrity: a constructive perspective
- Constructing confidential channels from authenticated channels-public-key encryption revisited
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- On the indifferentiability of the Grøstl hash function
- Randomness is linear in space
- Resource-restricted indifferentiability
- Sampling of Min-Entropy Relative to Quantum Knowledge
- The Operational Meaning of Min- and Max-Entropy
- Theory of Cryptography
- Theory of Cryptography
- To hash or not to hash again? (In)differentiability results for \(H^2\) and HMAC
Cited in
(12)- Overcoming impossibility results in composable security using interval-wise guarantees
- A unified and composable take on ratcheting
- Anonymous authenticated communication
- Some observations on indifferentiability
- Quantum authentication with key recycling
- Sequential indifferentiability of confusion-diffusion networks
- Resource-restricted indifferentiability
- Composable and finite computational security of quantum message transmission
- Classical leakage resilience from fault-tolerant quantum computation
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Adaptive security of multi-party protocols, revisited
- scientific article; zbMATH DE number 6386979 (Why is no real title available?)
This page was built for publication: From Indifferentiability to Constructive Cryptography (and Back)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179350)