Collapse-binding quantum commitments without random oracles

DOI10.1007/978-3-662-53890-6_6MaRDI QIDQ2953776zbMATH OpenOpenAlexFDO

Authors Dominique Unruh

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

zbMATH Keywords

quantum cryptographyhash functionscommitments

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Computationally binding quantum commitments
• Classical binding for quantum commitments
• Theory of Cryptography
• Quantum commitments from complexity assumptions
• Quantum commitments from complexity assumptions

Cites work

• A Pseudorandom Generator from any One-way Function
• Advances in Cryptology – CRYPTO 2004
• Collapse-binding quantum commitments without random oracles
• Computationally binding quantum commitments
• Lossy trapdoor functions and their applications
• On the existence of statistically hiding bit commitment schemes and fail-stop signatures
• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• Practical and provably-secure commitment schemes from collision-free hashing
• Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
• Quantum proofs of knowledge
• Theory of Cryptography
• Two provers in isolation

Cited in

(27)

• Black-box separations for non-interactive classical commitments in a quantum world
• Collapseability of tree hashes
• \textsf{CSI-RAShi}: distributed key generation for CSIDH
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Unconditionally secure multi-party quantum commitment scheme
• Quantum-access-secure message authentication via blind-unforgeability
• 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
• Computationally binding quantum commitments
• A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions
• Threshold ring signatures: new definitions and post-quantum security
• Quantum rewinding for IOP-based succinct arguments
• Layering quantum-resistance into classical digital signature algorithms
• Publicly-verifiable deletion via target-collapsing functions
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
• Interactive oracle arguments in the QROM and applications to succinct verification of quantum computation
• Evaluating the security of CRYSTALS-Dilithium in the quantum random oracle model
• A review of quantum and hybrid quantum/classical blockchain protocols
• New constructions of collapsing hashes
• Quantum commitments and signatures without one-way functions
• 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
• General properties of quantum bit commitments (extended abstract)

This page was built for publication: Collapse-binding quantum commitments without random oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2953776)