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

Takeshi Koshiba; Takanori Odaira

doi:10.1007/978-3-642-10698-9_4

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

Takeshi Koshiba^*, Takanori Odaira

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (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 language	English
Title of host publication	Theory of Quantum Computation, Communication, and Cryptography - 4th Workshop, TQC 2009, Revised Selected Papers
Pages	33-46
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-642-10698-9_4
Publication status	Published - 2009 Dec 1
Externally published	Yes
Event	4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009 - Waterloo, ON, Canada Duration: 2009 May 11 → 2009 May 13

Publication series

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

Other

Other	4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009
Country/Territory	Canada
City	Waterloo, ON
Period	09/5/11 → 09/5/13

Keywords

Non-interactive
One-way function
Quantum bit commitment

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

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 (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. 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 proceeding › Conference 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. 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. 2009. p. 33-46. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 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. 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",

month = dec,

day = "1",

doi = "10.1007/978-3-642-10698-9_4",

language = "English",

isbn = "3642106978",

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",

note = "4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009 ; Conference date: 11-05-2009 Through 13-05-2009",

}

TY - GEN

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

AU - Koshiba, Takeshi

AU - Odaira, Takanori

PY - 2009/12/1

Y1 - 2009/12/1

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

AN - SCOPUS:77951489269

SN - 3642106978

SN - 9783642106972

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

T2 - 4th Workshop on Theory of Quantum Computation, Communication, and Cryptography, TQC 2009

Y2 - 11 May 2009 through 13 May 2009

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this