Indifferentiability for public key cryptosystems
From MaRDI portal
Publication:2096477
DOI10.1007/978-3-030-56784-2_3zbMath1503.94046OpenAlexW2941154644MaRDI QIDQ2096477
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_3
Related Items (4)
Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization ⋮ Augmented random oracles ⋮ Indifferentiability for public key cryptosystems
Cites Work
- Unnamed Item
- Unnamed Item
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- Indifferentiable authenticated encryption
- Security definitions for hash functions: combining UCE and indifferentiability
- Secure integration of asymmetric and symmetric encryption schemes
- Indifferentiability for public key cryptosystems
- On the Indifferentiability of Key-Alternating Ciphers
- On the Security of Supersingular Isogeny Cryptosystems
- Careful with Composition: Limitations of the Indifferentiability Framework
- The random oracle methodology, revisited
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- A Domain Extender for the Ideal Cipher
- A Provable-Security Treatment of the Key-Wrap Problem
- Deterministic and Efficiently Searchable Encryption
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- Salvaging Merkle-Damgård for Practical Applications
- Communication Theory of Secrecy Systems*
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Non-Interactive Key Exchange
- Salvaging Indifferentiability in a Multi-stage Setting
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Indifferentiability of Confusion-Diffusion Networks
- Theory of Cryptography
This page was built for publication: Indifferentiability for public key cryptosystems
