Quantum bit-commitment for small storage based on quantum one-way permutations

DOI10.1007/BF03037308MaRDI QIDQ1880339zbMATH OpenFDO

Authors Keisuke Tanaka

Publication date 22 September 2004

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

Bit-CommitmentError Correcting CodeOne-Way PermutationQuantum ComputationQuantum Protocol

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Network protocols (68M12)

Recommendations

• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• scientific article; zbMATH DE number 1302858
• An arbitrarily concealing and practically binding quantum bit commitment protocol
• Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
• Quantum bit commitment with cheat sensitive binding and approximate sealing

Cites work

• scientific article; zbMATH DE number 1722671 (Why is no real title available?)
• scientific article; zbMATH DE number 1006115 (Why is no real title available?)
• Class of constructive asymptotically good algebraic codes
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Perfectly concealing quantum bit commitment from any quantum one-way permutation

Cited in

(2)

• Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
• Perfectly concealing quantum bit commitment from any quantum one-way permutation

This page was built for publication: Quantum bit-commitment for small storage based on quantum one-way permutations

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