Jakoby, Andreas ;
Liskiewicz, Maciej ;
Madry, Aleksander
Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment
Abstract
We define $(varepsilon,delta)$-secure quantum computations
between two parties that can play dishonestly to maximise
advantage $delta$, however keeping small the probability
$varepsilon$ that the computation fails in evaluating correct value.
We present a simple quantum protocol for computing
one-out-of-two oblivious transfer that is
$(O(sqrt{varepsilon}),varepsilon)$-secure.
Using the protocol as a black box we construct a scheme for
cheat sensitive quantum bit commitment which guarantee that
a mistrustful party has a nonzero probability of detecting a
cheating.
BibTeX - Entry
@InProceedings{jakoby_et_al:DagSemProc.06111.21,
author = {Jakoby, Andreas and Liskiewicz, Maciej and Madry, Aleksander},
title = {{Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment}},
booktitle = {Complexity of Boolean Functions},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {6111},
editor = {Matthias Krause and Pavel Pudl\'{a}k and R\"{u}diger Reischuk and Dieter van Melkebeek},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/622},
URN = {urn:nbn:de:0030-drops-6223},
doi = {10.4230/DagSemProc.06111.21},
annote = {Keywords: Two-Party Computations, Quantum Protocols, Bit Commitment, Oblivious Transfer.}
}
|
Keywords: |
|
Two-Party Computations, Quantum Protocols, Bit Commitment, Oblivious Transfer. |
|
Seminar: |
|
06111 - Complexity of Boolean Functions
|
|
Issue date: |
|
2006 |
|
Date of publication: |
|
30.11.2006 |
30.11.2006
