An adaptive reprogramming theorem is established that accommodates quantum advice, and has a tighter overall security loss that only scales in the cubic-root of n , with an attack that matches the number of queries required in order to reach constant advantage.
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.
This work adapts the classically accessible random oracle model (CAROM) as in [BDF+11] and [AK22], in which adversaries are only allowed to classically query the random oracle, and shows that an efficient simulation-secure one-time memory (OTM) is possible under CAROM.
It is shown that security of the restricted model of computation, 1/2BQP_1, is built on not only classical hardness for factoring, but also conjectured circuit lowerbounds for rational reconstruction, which permits arbitrary circuits and system sizes.
S. A. Yadavalli, Joel Rajakumar, A. Schuckert et al.· 2 citations
This work reviews the HM-QCT protocol and its two-assumption model and introduces HM-PRF, a variant that replaces the short-term encryption with a pseudorandom function (PRF), evaluated locally and argues that the PRF-based assumption yields a more realistic adversary.
Jean Snyman, Ioana Boureanu, Daniel Gardham· Proceedings of the 2026 ACM...· 0 citations
A construction of quantum money whose asymptotic query security does not deteriorate as long as the number of banknotes available to a user remains below the scale required for state tomography.
Zi-Han Hao, Xing-Jian Li, Qi-Peng Liu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
