The following pages link to (Q4249643):
Displaying 22 items.
- Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method (Q1648806) (← links)
- Revisiting AES-GCM-SIV: multi-user security, faster key derivation, and better bounds (Q1648810) (← links)
- A note on the chi-square method: a tool for proving cryptographic security (Q1749799) (← links)
- Analysis of the single-permutation encrypted Davies-Meyer construction (Q1801088) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- Building blockcipher from small-block tweakable blockcipher (Q2260794) (← links)
- Beyond-birthday secure domain-preserving PRFs from a single permutation (Q2416937) (← links)
- Beyond birthday bound secure fresh rekeying: application to authenticated encryption (Q2692358) (← links)
- How to build optimally secure PRFs using block ciphers (Q2692365) (← links)
- On the XOR of Multiple Random Permutations (Q2794522) (← links)
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC (Q2835585) (← links)
- Salvaging Weak Security Bounds for Blockcipher-Based Constructions (Q2958132) (← links)
- Building Blockcipher from Tweakable Blockcipher: Extending FSE 2009 Proposal (Q3104710) (← links)
- Tweak-Length Extension for Tweakable Blockciphers (Q3460099) (← links)
- Luby-Rackoff Ciphers from Weak Round Functions? (Q3593108) (← links)
- Cryptanalysis of Tweaked Versions of SMASH and Reparation (Q3644197) (← links)
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound (Q5452269) (← links)
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations (Q5502805) (← links)
- \textsf{LightMAC}: fork it and make it faster (Q6584328) (← links)
- A sponge-based PRF with good multi-user security (Q6619860) (← links)
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis (Q6636384) (← links)
- Information-theoretic security with asymmetries (Q6652930) (← links)
