scientific article; zbMATH DE number 1302860
From MaRDI portal
Publication:4249345
Recommendations
Cited in
(45)- Optimal forgeries against polynomial-based MACs and GCM
- How many queries are needed to distinguish a truncated random permutation from a random function?
- A note on the chi-square method: a tool for proving cryptographic security
- Analysis of the single-permutation encrypted Davies-Meyer construction
- Mind the composition: birthday bound attacks on EWCDMD and SoKAC21
- Leakage resilient value comparison with application to message authentication
- The summation-truncation hybrid: reusing discarded bits for free
- On the streaming indistinguishability of a random permutation and a random function
- Tight security of cascaded LRW2
- Beyond-birthday secure domain-preserving PRFs from a single permutation
- The advantage of truncated permutations
- How to build optimally secure PRFs using block ciphers
- scientific article; zbMATH DE number 1583802 (Why is no real title available?)
- On the XOR of multiple random permutations
- EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
- Hardness preserving constructions of pseudorandom functions
- Equivalence between MAC, WCR and PRF for blockcipher based constructions
- The sum of PRPs is a secure PRF
- Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs
- scientific article; zbMATH DE number 1303128 (Why is no real title available?)
- A Generic Method to Design Modes of Operation Beyond the Birthday Bound
- A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
- Theory of Cryptography
- Keyed sum of permutations: a simpler RP-based PRF
- Proof of mirror theory for a wide range of \(\xi_{\max }\)
- Multi-user security of the sum of truncated random permutations
- Improved multi-user security using the squared-ratio method
- Luby-Rackoff backwards with more users and more security
- Quantum attacks on PRFs based on public random permutations
- Revisiting the indifferentiability of the sum of permutations
- Tight indistinguishability bounds for the XOR of independent random permutations by Fourier analysis
- Information-theoretic security with asymmetries
- Minimizing beyond-birthday-bound secure permutation-based pseudorandom function
- Plinko: single-server PIR with efficient updates via invertible PRFs
- Combining outputs of a random permutation: new constructions and tight security bounds by Fourier analysis
- \textsc{ChiLow} and \textsc{ChiChi}: new constructions for code encryption
- Forking sums of permutations for highly secure and efficient PRFs
- Proving the security of the extended summation-truncation hybrid
- Mind the bad norms. Revisiting compressed oracle-based quantum indistinguishability proofs
- Upper bound on information-theoretic security of permutation-based pseudorandom functions
- How to build a short-input random oracle from public random permutations
- Fault-tolerant verifiable dynamic SSE with forward and backward privacy
- On TRP-RF switch in the quantum query model
- Sequential indifferentiability of STH and EDM
- Performance improvement for the GGM-construction of pseudorandom functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249345)
