Computationally Binding Quantum Commitments
From MaRDI portal
Publication:5739213
DOI10.1007/978-3-662-49896-5_18zbMath1371.94660OpenAlexW2465235335MaRDI QIDQ5739213
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_18
Related Items (36)
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 ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ A review of quantum and hybrid quantum/classical blockchain protocols ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Cryptography from pseudorandom quantum states ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Succinct classical verification of quantum computation ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ A note on the post-quantum security of (ring) signatures ⋮ General properties of quantum bit commitments (extended abstract) ⋮ 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 ⋮ Semantic embedding for quantum algorithms ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ New constructions of collapsing hashes ⋮ Sponge-based authenticated encryption: security against quantum attackers ⋮ Post-quantum insecurity from LWE ⋮ Quantum rewinding for many-round protocols ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Publicly-verifiable deletion via target-collapsing functions ⋮ Lattice-based timed cryptography ⋮ Post-quantum resettably-sound zero knowledge ⋮ Relationships between quantum IND-CPA notions ⋮ Classical binding for quantum commitments ⋮ An efficient quantum digital signature for classical messages ⋮ Verifying quantum computations at scale: A cryptographic leash on quantum devices ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Quantum-access-secure message authentication via blind-unforgeability ⋮ The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more ⋮ Improved lattice-based mix-nets for electronic voting ⋮ \textsf{CSI-RAShi}: distributed key generation for CSIDH
This page was built for publication: Computationally Binding Quantum Commitments
