Commitments to quantum states
From MaRDI portal
Publication:6499324
DOI10.1145/3564246.3585198WikidataQ130909491 ScholiaQ130909491MaRDI QIDQ6499324
Fermi Ma, Nathan Ju, Mark Zhandry, Sam Gunn
Publication date: 8 May 2024
quantum cryptographyquantum zero knowledgequantum rewindingquantum state commitmentsquantum succinct arguments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudorandom quantum states
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Classical verification of quantum computations with efficient verifier
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Classical binding for quantum commitments
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Proof verification and the hardness of approximation problems
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- Probabilistic checking of proofs
- A Pseudorandom Generator from any One-way Function
- Interactive proofs and the hardness of approximating cliques
- Classical Verification of Quantum Computations
- The detectability lemma and quantum gap amplification
- Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
- Multi-collision resistance: a paradigm for keyless hash functions
- Computationally Binding Quantum Commitments
- QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge
- Cryptography from pseudorandom quantum states
- Quantum commitments and signatures without one-way functions
- Succinct classical verification of quantum computation
- Quantum rewinding for many-round protocols
This page was built for publication: Commitments to quantum states
