The following pages link to (Q4249345):
Displaying 22 items.
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- Optimal forgeries against polynomial-based MACs and GCM (Q1648808) (← links)
- How many queries are needed to distinguish a truncated random permutation from a random function? (Q1747661) (← 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)
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 (Q2055608) (← links)
- Leakage resilient value comparison with application to message authentication (Q2056738) (← links)
- The summation-truncation hybrid: reusing discarded bits for free (Q2096483) (← links)
- On the streaming indistinguishability of a random permutation and a random function (Q2119020) (← links)
- Tight security of cascaded LRW2 (Q2188969) (← links)
- Beyond-birthday secure domain-preserving PRFs from a single permutation (Q2416937) (← links)
- The advantage of truncated permutations (Q2656968) (← 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)
- 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)
- Theory of Cryptography (Q5898374) (← links)
- Multi-user security of the sum of truncated random permutations (Q6132432) (← links)
- Luby-Rackoff backwards with more users and more security (Q6157554) (← links)
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis (Q6636384) (← links)
- Information-theoretic security with asymmetries (Q6652930) (← links)
