The following pages link to Theory of Cryptography (Q5901763):
Displaying 50 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)
- Separating invertible key derivations from non-invertible ones: sequential indifferentiability of 3-round Even-Mansour (Q306057) (← links)
- A simple variant of the Merkle-Damgård scheme with a permutation (Q431787) (← links)
- Improved elliptic curve hashing and point representation (Q510463) (← links)
- Optimal collision security in double block length hashing with single length key (Q522211) (← links)
- An analysis of the blockcipher-based hash functions from PGV (Q604636) (← links)
- Robust multi-property combiners for hash functions (Q744343) (← links)
- Uniform encodings to elliptic curves and indistinguishable point representation (Q782846) (← links)
- Open problems in hash function security (Q887443) (← links)
- A measure of dependence for cryptographic primitives relative to ideal functions (Q888120) (← links)
- Improved domain extender for the ideal cipher (Q892511) (← links)
- A synthetic indifferentiability analysis of some block-cipher-based hash functions (Q1009050) (← links)
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- Pseudorandomness analysis of the (extended) Lai-Massey scheme (Q1944043) (← links)
- Simple hash function using discrete-time quantum walks (Q1993832) (← links)
- The Oribatida v1.3 family of lightweight authenticated encryption schemes (Q2040556) (← links)
- Password hashing and preprocessing (Q2056723) (← links)
- Compactness of hashing modes and efficiency beyond Merkle tree (Q2056724) (← links)
- Handling adaptive compromise for practical encryption schemes (Q2096475) (← 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)
- On the concrete security of TLS 1.3 PSK mode (Q2170074) (← links)
- Improved indifferentiability security proof for 3-round tweakable Luby-Rackoff (Q2232120) (← links)
- Obfuscation for cryptographic purposes (Q2267356) (← links)
- Beyond conventional security in sponge-based authenticated encryption modes (Q2318091) (← links)
- Beyond-birthday secure domain-preserving PRFs from a single permutation (Q2416937) (← links)
- The most efficient indifferentiable hashing to elliptic curves of \(j\)-invariant 1728 (Q2680379) (← links)
- Just tweak! Asymptotically optimal security for the cascaded LRW1 tweakable blockcipher (Q2692967) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← links)
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation (Q2827742) (← 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)
- Towards Understanding the Known-Key Security of Block Ciphers (Q2946886) (← links)
- Query-Complexity Amplification for Random Oracles (Q2947529) (← links)
- Simpira v2: A Family of Efficient Permutations Using the AES Round Function (Q2958116) (← links)
- On the Indifferentiability of Fugue and Luffa (Q3011314) (← links)
- On the Security of Hash Functions Employing Blockcipher Postprocessing (Q3013082) (← links)
- On chosen target forced prefix preimage resistance (Q3075866) (← links)
- Security Analysis of SIMD (Q3084266) (← links)
- Security of Practical Cryptosystems Using Merkle-Damgård Hash Function in the Ideal Cipher Model (Q3092365) (← links)
- From Indifferentiability to Constructive Cryptography (and Back) (Q3179350) (← links)
- A Domain Extender for the Ideal Cipher (Q3408200) (← links)
- Asynchronous Multi-Party Computation with Quadratic Communication (Q3519524) (← links)
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (Q3519537) (← links)
- Robust Multi-property Combiners for Hash Functions Revisited (Q3519540) (← links)
