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

Takeshi Koshiba, Takanori Odaira

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationTheory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers
Pages33-46
Number of pages14
Volume5906 LNCS
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009 - Waterloo, ON, Canada
Duration: 2009 May 112009 May 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5906 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009
CountryCanada
CityWaterloo, ON
Period09/5/1109/5/13

Fingerprint

One-way Function
Constructible
Commitment
Permutation

Keywords

  • Non-interactive
  • One-way function
  • Quantum bit commitment

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Koshiba, T., & Odaira, T. (2009). Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. In Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers (Vol. 5906 LNCS, pp. 33-46). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5906 LNCS). https://doi.org/10.1007/978-3-642-10698-9_4

Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. / Koshiba, Takeshi; Odaira, Takanori.

Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers. Vol. 5906 LNCS 2009. p. 33-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5906 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Koshiba, T & Odaira, T 2009, Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. in Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers. vol. 5906 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5906 LNCS, pp. 33-46, 4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009, Waterloo, ON, Canada, 09/5/11. https://doi.org/10.1007/978-3-642-10698-9_4
Koshiba T, Odaira T. Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. In Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers. Vol. 5906 LNCS. 2009. p. 33-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-10698-9_4
Koshiba, Takeshi ; Odaira, Takanori. / Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function. Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers. Vol. 5906 LNCS 2009. pp. 33-46 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5d4b1789fb3642658b8287729e4feeac,
title = "Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function",
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.",
keywords = "Non-interactive, One-way function, Quantum bit commitment",
author = "Takeshi Koshiba and Takanori Odaira",
year = "2009",
doi = "10.1007/978-3-642-10698-9_4",
language = "English",
isbn = "3642106978",
volume = "5906 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "33--46",
booktitle = "Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers",

}

TY - GEN

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

AU - Koshiba, Takeshi

AU - Odaira, Takanori

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Non-interactive

KW - One-way function

KW - Quantum bit commitment

UR - http://www.scopus.com/inward/record.url?scp=77951489269&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77951489269&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10698-9_4

DO - 10.1007/978-3-642-10698-9_4

M3 - Conference contribution

SN - 3642106978

SN - 9783642106972

VL - 5906 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 33

EP - 46

BT - Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers

ER -