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

Authors:
Takeshi Koshiba;Takanori Odaira
Affiliations:
Area of Informatics, Graduate School of Science and Engineering, Saitama University, Japan;Area of Informatics, Graduate School of Science and Engineering, Saitama University, Japan
Venue:
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
Year:
2009

Citing 13
Cited 0

Minimum disclosure proofs of knowledge

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
One-way functions are necessary and sufficient for secure signatures

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
Quantum bit escrow

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
How to Convert the Flavor of a Quantum Bit Commitment

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Statistically-hiding commitment from any one-way function

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
A New Interactive Hashing Theorem

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Reducing Complexity Assumptions for Statistically-Hiding Commitment

Journal of Cryptology
Perfectly concealing quantum bit commitment from any quantum one-way permutation

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any approximable-preimage-size quantum one-way function, which is a generalization of perfectly-hiding quantum bit commitment scheme based on quantum one-way permutation due to Dumais, Mayers and Salvail. In the classical case, statistically-hiding bit commitment scheme is constructible from any one-way function. However, it is known that the round complexity of the classical statistically-hiding bit commitment scheme is Ω(n/logn) for the security parameter n. Our quantum scheme as well as the Dumais-Mayers-Salvail scheme is non-interactive, which is advantageous over the classical schemes.