From Indifferentiability to Constructive Cryptography (and Back)
From MaRDI portal
Publication:3179350
DOI10.1007/978-3-662-53641-4_1zbMATH Open1351.94057OpenAlexW2539263880MaRDI QIDQ3179350FDOQ3179350
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_1
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
- Careful with Composition: Limitations of the Indifferentiability Framework
- Indifferentiability of Permutation-Based Compression Functions and Tree-Based Modes of Operation, with Applications to MD6
- Title not available (Why is that?)
- Resource-Restricted Indifferentiability
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On the Indifferentiability of the Sponge Construction
- Theory of Cryptography
- On the Indifferentiability of the Grøstl Hash Function
- The Operational Meaning of Min- and Max-Entropy
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Improved Indifferentiability Security Analysis of chopMD Hash Function
- Randomness is linear in space
- Theory of Cryptography
- Confidentiality and Integrity: A Constructive Perspective
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- Title not available (Why is that?)
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC
- Constructing Confidential Channels from Authenticated Channels—Public-Key Encryption Revisited
- Sampling of Min-Entropy Relative to Quantum Knowledge
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
Cited In (10)
- Anonymous authenticated communication
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework)
- Sequential indifferentiability of confusion-diffusion networks
- Quantum Authentication with Key Recycling
- Composable and finite computational security of quantum message transmission
- A unified and composable take on ratcheting
- Title not available (Why is that?)
- Adaptive security of multi-party protocols, revisited
- Classical leakage resilience from fault-tolerant quantum computation
- Overcoming impossibility results in composable security using interval-wise guarantees
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)
