Computationally binding quantum commitments
From MaRDI portal
Recommendations
- Collapse-binding quantum commitments without random oracles
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Classical binding for quantum commitments
- Quantum commitments from complexity assumptions
- Quantum commitments from complexity assumptions
Cited in
(67)- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Quantum commitments from complexity assumptions
- Improved lattice-based mix-nets for electronic voting
- An efficient quantum digital signature for classical messages
- Black-box separations for non-interactive classical commitments in a quantum world
- Another round of breaking and making quantum money: how to not build it from lattices, and more
- From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
- Collapseability of tree hashes
- Oblivious transfer from zero-knowledge proofs. Or how to achieve round-optimal quantum oblivious transfer and zero-knowledge proofs on quantum states
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Post-quantum insecurity from LWE
- Quantum IND-CPA security notions for AEAD
- Succinct classical verification of quantum computation
- \textsf{CSI-RAShi}: distributed key generation for CSIDH
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Quantum commitments from complexity assumptions
- Rewindable quantum computation and its equivalence to cloning and adaptive postselection
- Unconditionally secure multi-party quantum commitment scheme
- Quantum-access-secure message authentication via blind-unforgeability
- Dispelling myths on superposition attacks: formal security model and attack analyses
- A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
- Classical proofs for the quantum collapsing property of classical hash functions
- Theory of Cryptography
- Collapse-binding quantum commitments without random oracles
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Advances in Cryptology – CRYPTO 2004
- Sponge-based authenticated encryption: security against quantum attackers
- VSS from distributed ZK proofs and applications
- Semantic embedding for quantum algorithms
- A note on the post-quantum security of (ring) signatures
- Quantum rewinding for many-round protocols
- Universal reductions: reductions relative to stateful oracles
- Towards compressed permutation oracles
- Cryptography from pseudorandom quantum states
- On digital signatures based on group actions: QROM security and ring signatures
- Almost-total puzzles and their applications
- MicroCrypt assumptions with quantum input sampling and pseudodeterminism: constructions and separations
- Quantum rewinding for IOP-based succinct arguments
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based timed cryptography
- Publicly-verifiable deletion via target-collapsing functions
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
- Practical robust DKG protocols for CSIDH
- One-wayness in quantum cryptography
- Straight-line knowledge extraction for multi-round protocols
- Quantum state group actions
- On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
- Quantum one-time protection of any randomized algorithm
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation
- A review of quantum and hybrid quantum/classical blockchain protocols
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- New constructions of collapsing hashes
- Unconditionally secure quantum commitments with preprocessing
- Unconditionally secure commitments with quantum auxiliary inputs
- Non-Observable Quantum Random Oracle Model
- On quantum money and evasive obfuscation
- Commitments to quantum states
- Relationships between quantum IND-CPA notions
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Classical binding for quantum commitments
- Post-quantum resettably-sound zero knowledge
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- Quantum bit commitment with cheat sensitive binding and approximate sealing
- General properties of quantum bit commitments (extended abstract)
This page was built for publication: Computationally binding quantum commitments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739213)
