Indifferentiability for public key cryptosystems
From MaRDI portal
Publication:2096477
Recommendations
Cites work
- A domain extender for the ideal cipher
- A method for obtaining digital signatures and public-key cryptosystems
- A Provable-Security Treatment of the Key-Wrap Problem
- Careful with composition: limitations of the indifferentiability framework
- Communication Theory of Secrecy Systems*
- Deterministic and Efficiently Searchable Encryption
- How to build an ideal cipher: the indifferentiability of the Feistel construction
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Indifferentiability for public key cryptosystems
- Indifferentiability of confusion-diffusion networks
- Indifferentiable authenticated encryption
- Merkle-Damgård Revisited: How to Construct a Hash Function
- New directions in cryptography
- Non-interactive key exchange
- On the indifferentiability of key-alternating ciphers
- On the Security of Supersingular Isogeny Cryptosystems
- Salvaging indifferentiability in a multi-stage setting
- Salvaging Merkle-Damgård for Practical Applications
- Secure integration of asymmetric and symmetric encryption schemes
- Security definitions for hash functions: combining UCE and indifferentiability
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- The random oracle methodology, revisited.
- Theory of Cryptography
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
Cited in
(15)- Indifferentiability for public key cryptosystems
- Careful with composition: limitations of the indifferentiability framework
- From Indifferentiability to Constructive Cryptography (and Back)
- scientific article; zbMATH DE number 177022 (Why is no real title available?)
- On the Indifferentiability of Key-Alternating Feistel Ciphers with No Key Derivation
- Theory of Cryptography
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Implicit rejection in Fujisaki-Okamoto: framework and a novel realization
- Redeeming reset indifferentiability and applications to post-quantum security
- Augmented random oracles
- The relationship between idealized models under computationally bounded adversaries
- Limits of black-box anamorphic encryption
- On the relationship between public key primitives via indifferentiability
- On the complexity of cryptographic groups and generic group models
- Attention is still what you need: another round of exploring Shoup's GGM
This page was built for publication: Indifferentiability for public key cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096477)