Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function

DOI10.1007/978-3-642-10698-9_4MaRDI QIDQ5189225zbMATH OpenOpenAlexFDO

Authors Takeshi Koshiba, Takanori Odaira

Publication date 9 March 2010

Published in Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10698-9_4

zbMATH Keywords

non-interactiveone-way functionquantum bit commitment

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• Quantum bit-commitment for small storage based on quantum one-way permutations
• scientific article; zbMATH DE number 1722671
• Reducing complexity assumptions for statistically-hiding commitment
• Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)

Cited in

(10)

• Quantum bit-commitment for small storage based on quantum one-way permutations
• Classical binding for quantum commitments
• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• Discrete-time interacting quantum walks and quantum hash schemes
• Quantum commitments and signatures without one-way 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
• Commitments to quantum states
• Unconditionally secure commitments with quantum auxiliary inputs

This page was built for publication: Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function

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