NISQ security and complexity via simple classical reasoning
From MaRDI portal
Cites work
- A new framework for quantum oblivious transfer
- A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
- A strong direct product theorem for quantum query complexity
- Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF
- Classical vs quantum random oracles
- Generalized hybrid search with applications to blockchains and hash function security
- How to construct quantum random functions
- How to record quantum queries, and applications to quantum indifferentiability
- Improved quantum lifting by coherent measure-and-reprogram
- On the (in)security of the BUFF transform
- Online-extractability in the quantum random-oracle model
- Post-quantum resettably-sound zero knowledge
- Post-quantum security of key encapsulation mechanism against CCA attacks with a single decapsulation query
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Quantum oracle interrogation: getting all information for almost half the price
- Random oracles in a quantum world
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Strong direct product theorems for quantum communication and query complexity
- The bitcoin backbone protocol: analysis and applications
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- The NISQ complexity of collision finding
- Tight adaptive reprogramming in the QROM
- Tight quantum time-space tradeoffs for function inversion
- Verifiable quantum advantage without structure
This page was built for publication: NISQ security and complexity via simple classical reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233221)
