Pages that link to "Item:Q3003399"
From MaRDI portal
The following pages link to Careful with Composition: Limitations of the Indifferentiability Framework (Q3003399):
Displaying 27 items.
- How to build an ideal cipher: the indifferentiability of the Feistel construction (Q271585) (← links)
- Improved indifferentiability security bound for the JH mode (Q285241) (← links)
- Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier (Q293718) (← links)
- Optimal collision security in double block length hashing with single length key (Q522211) (← links)
- Open problems in hash function security (Q887443) (← links)
- Improved domain extender for the ideal cipher (Q892511) (← links)
- Short variable length domain extenders with beyond birthday bound security (Q1633453) (← links)
- State separation for code-based game-playing proofs (Q1710673) (← links)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Indifferentiability for public key cryptosystems (Q2096477) (← links)
- Quantifying the security cost of migrating protocols to practice (Q2096478) (← links)
- Incompressible encodings (Q2096497) (← links)
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability (Q2119003) (← links)
- Functional broadcast encryption with applications to data sharing for cloud storage (Q2224865) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
- Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications (Q2889879) (← links)
- Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles (Q2889880) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- Extracts from the SHA-3 Competition (Q3455489) (← links)
- Provable Security of BLAKE with Non-ideal Compression Function (Q3455508) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
- Strengthening the Known-Key Security Notion for Block Ciphers (Q4639495) (← links)
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves (Q4911913) (← links)
- Public-Seed Pseudorandom Permutations (Q5738982) (← links)
- Building indifferentiable compression functions from the PGV compression functions (Q5963372) (← links)