Commitments to quantum states
From MaRDI portal
Publication:6499324
DOI10.1145/3564246.3585198WikidataQ130909491 ScholiaQ130909491MaRDI QIDQ6499324FDOQ6499324
Authors: Sam Gunn, Nathan Ju, Fermi Ma, Mark Zhandry 
Publication date: 8 May 2024
quantum cryptographyquantum zero knowledgequantum rewindingquantum state commitmentsquantum succinct arguments
Cites Work
- Proof verification and the hardness of approximation problems
- Probabilistic checking of proofs
- A Pseudorandom Generator from any One-way Function
- Interactive proofs and the hardness of approximating cliques
- Title not available (Why is that?)
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- The detectability lemma and quantum gap amplification
- Cryptography from pseudorandom quantum states
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Title not available (Why is that?)
- Multi-collision resistance: a paradigm for keyless hash functions
- Pseudorandom quantum states
- Classical verification of quantum computations with efficient verifier
- Classical verification of quantum computations
- Succinct classical verification of quantum computation
- Quantum proofs of knowledge
- Computationally binding quantum commitments
- Title not available (Why is that?)
- Non-interactive zero-knowledge arguments for QMA, with preprocessing
- Quantum commitments and signatures without one-way functions
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Title not available (Why is that?)
- Classical binding for quantum commitments
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum rewinding for many-round protocols
Cited In (3)
This page was built for publication: Commitments to quantum states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499324)
