It is shown that in the absence of inner collisions, the probability of finding x preimages decreases exponentially with x, which means that increasing x strengthens security only while direct multi-preimage search remains the dominant attack strategy.
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...
This work introduces an operator-norm approach for non-uniform security in the quantum random oracle and random permutation models, and proves an optimal generic salting theorem for decision games.
A central question in the theory of quantum advantage is whether there are quantum advantage protocols with similar resource requirements as random circuit sampling that are also verifiable just from the classical outputs of the quantum computation. Here, we develop the idea of simulation secrets for verifiable advanta...
Markus Bläser, M. Gullans, Dominik Hangleiter et al.· 1 citation
We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the adversary learns nothing about the message unless the receiver aborts. Neither the sender nor the receiver holds a secret key, and no computa...
Anne Broadbent, Upendra S. Kapshikar, Denis Rochette· 0 citations
We provide the first evidence relative to a classical oracle that pseudorandom unitaries (PRUs) can exist without quantum-computable one-way functions. To obtain this result, we first prove that five independent random diagonal phase layers interleaved with Hadamard transforms \[ U=F_5HF_4HF_3HF_2HF_1 \] form a strong...
