TL;DR
This work considers a generalization of prover-adversary games to many standard proof systems and shows that some of the major proof complexity lower bounds are constructive in the sense that they yield efficient algorithms computing winning strategies of adversaries in the generalized 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...
A new lower bound is given on any attack on this scheme, in particular proving nearly-linear quantum gate lower bounds on the attacker, even when allowing the attacker to declare a transmission loss of up to $50\%$, allowing for the challenges prepared by the referee to be imperfect, and allowing the quantum messages u...
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.
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...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
