Collapse-Binding Quantum Commitments Without Random Oracles
From MaRDI portal
Publication:2953776
DOI10.1007/978-3-662-53890-6_6zbMath1407.94156OpenAlexW2551186327MaRDI QIDQ2953776
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53890-6_6
Related Items
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Unconditionally secure multi-party quantum commitment scheme ⋮ Collapseability of Tree Hashes ⋮ Classical proofs for the quantum collapsing property of classical hash functions ⋮ Layering quantum-resistance into classical digital signature algorithms ⋮ A review of quantum and hybrid quantum/classical blockchain protocols ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Quantum commitments and signatures without one-way functions ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ New constructions of collapsing hashes ⋮ Publicly-verifiable deletion via target-collapsing functions ⋮ Post-quantum resettably-sound zero knowledge ⋮ Classical binding for quantum commitments ⋮ Quantum-access-secure message authentication via blind-unforgeability ⋮ Threshold ring signatures: new definitions and post-quantum security ⋮ \textsf{CSI-RAShi}: distributed key generation for CSIDH
Cites Work
- Unnamed Item
- On the existence of statistically hiding bit commitment schemes and fail-stop signatures
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Collapse-Binding Quantum Commitments Without Random Oracles
- Two Provers in Isolation
- Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- Lossy trapdoor functions and their applications
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology – CRYPTO 2004
- Computationally Binding Quantum Commitments
- Theory of Cryptography