Classical binding for quantum commitments

DOI10.1007/978-3-030-90459-3_10MaRDI QIDQ2695637zbMATH OpenOpenAlexFDO

Authors Nir Bitansky, Zvika Brakerski

Publication date 31 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90459-3_10

Mathematics Subject Classification ID

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

Recommendations

• Computationally binding quantum commitments
• Collapse-binding quantum commitments without random oracles
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Quantum commitments from complexity assumptions
• Non-malleable commitments against quantum attacks

Cites work

• scientific article; zbMATH DE number 2086396 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
• Bit commitment using pseudorandomness
• Collapse-binding quantum commitments without random oracles
• Computationally binding quantum commitments
• Oblivious transfer is in MiniQCrypt
• One-way functions imply secure computation in a quantum world
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
• Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
• Quantum proofs of knowledge
• Secure identity-based encryption in the quantum random oracle model
• Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
• The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
• Theory of Cryptography

Cited in

(11)

• Black-box separations for non-interactive classical commitments in a quantum world
• From the hardness of detecting superpositions to cryptography: quantum public key encryption and commitments
• Collapse-binding quantum commitments without random oracles
• Computationally binding quantum commitments
• Cryptography from pseudorandom quantum states
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
• Non-malleable commitments against quantum attacks
• Certified everlasting zero-knowledge proof for QMA
• Commitments to quantum states
• Quantum commitments and signatures without one-way functions
• General properties of quantum bit commitments (extended abstract)

This page was built for publication: Classical binding for quantum commitments

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