Perfectly concealing quantum bit commitment from any quantum one-way permutation

DMCA

Perfectly concealing quantum bit commitment from any quantum one-way permutation (2000)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Paul Dumais , Dominic Mayers , Louis Salvail

Citations:

43 - 8 self

BibTeX

@INPROCEEDINGS{Dumais00perfectlyconcealing,
    author = {Paul Dumais and Dominic Mayers and Louis Salvail},
    title = {Perfectly concealing quantum bit commitment from any quantum one-way permutation},
    booktitle = {},
    year = {2000},
    pages = {300--315},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

Abstract. We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing and computationally binding. Unlike the classical reduction of Naor, Ostrovski, Ventkatesen and Young, our protocol is non-interactive and has communication complexity O(n) qubits for n a security parameter. 1

Keyphrases

quantum one-way permutation quantum bit commitment security parameter classical reduction communication complexity resulting scheme secure quantum bit commitment

DMCA