<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-11T21:21:21Z</responseDate>
  <request identifier="622" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:622</identifier>
        <datestamp>2024-03-06T11:06:47Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Using Quantum Oblivious Transfer to Cheat Sensitive Quantum Bit Commitment</dc:title>
          <dc:creator>Jakoby, Andreas</dc:creator>
          <dc:creator>Liskiewicz, Maciej</dc:creator>
          <dc:creator>Madry, Aleksander</dc:creator>
          <dc:subject>Two-Party Computations</dc:subject>
          <dc:subject>Quantum Protocols</dc:subject>
          <dc:subject>Bit Commitment</dc:subject>
          <dc:subject>Oblivious Transfer.</dc:subject>
          <dc:description>We define $(varepsilon,delta)$-secure quantum computations &#13;
between two parties that can play dishonestly to maximise &#13;
advantage $delta$, however keeping small the probability &#13;
$varepsilon$ that the computation fails in evaluating correct value. &#13;
We present a simple quantum protocol for computing &#13;
one-out-of-two oblivious transfer that is &#13;
$(O(sqrt{varepsilon}),varepsilon)$-secure.&#13;
Using the protocol as a black box we construct a scheme for&#13;
cheat sensitive quantum bit commitment which guarantee that &#13;
a mistrustful party has a nonzero probability of detecting a &#13;
cheating.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Andreas Jakoby and Maciej Liskiewicz and Aleksander Madry</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 6111, Complexity of Boolean Functions (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.06111.21</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-6223</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06111.21</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
