The first complete post-quantum security proof of the textbook Fujisaki-Okamoto transformation is presented, i.e, without adjustments to facilitate the proof, including concrete security bounds, including concrete security bounds.
Jelle Don, S. Fehr, Christian Majenz et al.· 0 citations
Pseudorandom permutations are ubiquitous in theoretical and applied cryptography. PRPs that offer security even against adversaries making quantum queries are of increasing interest, and used in applications ranging from constructing pseudorandom unitaries to separating SZK from BQP. A successful framework for construc...
G. Alagic, J. Carolan, Christian Majenz et al.· arXiv.org· 0 citations
The compressed permutation oracle has been used to analyze the quantum security of a number of cryptographic constructions which resisted prior techniques. However, these analyses were fundamentally limited by the poor soundness of the method: the technique was proven sound only up to $O(N^{1/12})$ queries to permutati...
J. Carolan, Christian Majenz· 3 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.