License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6223
URL: http://drops.dagstuhl.de/opus/volltexte/2006/622/
Go to the corresponding Portal

Jakoby, Andreas ; Liskiewicz, Maciej ; Madry, Aleksander

Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment

pdf-format:
Document 1.pdf (278 KB)

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:DSP:2006:622,
  author =	{Andreas Jakoby and Maciej Liskiewicz and Aleksander Madry},
  title =	{Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment},
  booktitle =	{Complexity of Boolean Functions},
  year =	{2006},
  editor =	{Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek},
  number =	{06111},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/622},
  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

DROPS-Home | Fulltext Search | Imprint Published by LZI