Pages that link to "Item:Q5451041"
From MaRDI portal
The following pages link to Merkle-Damgård Revisited: How to Construct a Hash Function (Q5451041):
Displaying 35 items.
- How to Fill Up Merkle-Damgård Hash Functions (Q3600380) (← links)
- A Double-Piped Mode of Operation for MACs, PRFs and PROs: Security beyond the Birthday Barrier (Q3627438) (← links)
- Salvaging Merkle-Damgård for Practical Applications (Q3627446) (← links)
- Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders (Q3634491) (← links)
- On the Weak Ideal Compression Functions (Q3634496) (← links)
- A Three-Property-Secure Hash Function (Q3644203) (← links)
- A Scheme to Base a Hash Function on a Block Cipher (Q3644205) (← links)
- Modeling Random Oracles Under Unpredictable Queries (Q4639493) (← links)
- A new authentication procedure for client-server applications using HMAC (Q5035167) (← links)
- How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
- Boosting Merkle-Damgård Hashing for Message Authentication (Q5387101) (← links)
- Multi-property Preserving Combiners for Hash Functions (Q5445516) (← links)
- Extended Multi-Property-Preserving and ECM-Construction (Q5458224) (← links)
- A New Mode of Operation for Block Ciphers and Length-Preserving MACs (Q5458593) (← links)
- Faster Multicollisions (Q5504611) (← links)
- Public-Seed Pseudorandom Permutations (Q5738982) (← links)
- Building indifferentiable compression functions from the PGV compression functions (Q5963372) (← links)
- An efficient identity-based signature scheme with provable security (Q6066147) (← links)
- Hardening signature schemes via derive-then-derandomize: stronger security proofs for EdDSA (Q6070760) (← links)
- Classical and quantum security of elliptic curve VRF, via relative indifferentiability (Q6080897) (← links)
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls (Q6083137) (← links)
- Optimal security for keyed hash functions: avoiding time-space tradeoffs for finding collisions (Q6083138) (← links)
- Tight preimage resistance of the sponge construction (Q6111545) (← links)
- Block-cipher-based tree hashing (Q6111546) (← links)
- Security of truncated permutation without initial value (Q6132428) (← links)
- Random oracle combiners: breaking the concatenation barrier for collision-resistance (Q6145924) (← links)
- Redeeming reset indifferentiability and applications to post-quantum security (Q6157503) (← links)
- Double-block-length hash function for minimum memory size (Q6157555) (← links)
- Crooked indifferentiability of enveloped XOR revisited (Q6157572) (← links)
- Sequential indifferentiability of confusion-diffusion networks (Q6157575) (← links)
- Building blocks of sharding blockchain systems: concepts, approaches, and open problems (Q6158770) (← links)
- Augmented random oracles (Q6163941) (← links)
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives (Q6169365) (← links)
- Minimizing Even-Mansour ciphers for sequential indifferentiability (without key schedules) (Q6169461) (← links)
- Revisiting the indifferentiability of the sum of permutations (Q6186774) (← links)