Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantum Attacks on Classical Proof Systems - The Hardness of Quantum
  Rewinding   Quantum zero-knowledge proofs and quantum proofs of knowledge are inherently
difficult to analyze because their security analysis uses rewinding. Certain
cases of quantum rewinding are handled by the results by Watrous (SIAM J
Comput, 2009) and Unruh (Eurocrypt 2012), yet in general the problem remains
elusive. We show that this is not only due to a lack of proof techniques:
relative to an oracle, we show that classically secure proofs and proofs of
knowledge are insecure in the quantum setting.
  More specifically, sigma-protocols, the Fiat-Shamir construction, and
Fischlin's proof system are quantum insecure under assumptions that are
sufficient for classical security. Additionally, we show that for similar
reasons, computationally binding commitments provide almost no security
guarantees in a quantum setting.
  To show these results, we develop the "pick-one trick", a general technique
that allows an adversary to find one value satisfying a given predicate, but
not two.

35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
15
The categories of this paper are: nucl-ex
18
The categories of this paper are: econ
27
The categories of this paper are: comp-gas
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
6
The categories of this paper are: astro-ph
7
The categories of this paper are: hep-th
14
The categories of this paper are: math-ph
19
The categories of this paper are: eess
0
The categories of this paper are: hep-ph
33
The categories of this paper are: plasm-ph
29
The categories of this paper are: funct-an