<?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-07-29T10:04:51Z</responseDate>
  <request identifier="16483" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:16483</identifier>
        <datestamp>2024-03-06T10:57:36Z</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>From Privacy-Only to Simulatable OT: Black-Box, Round-Optimal, Information-Theoretic</dc:title>
          <dc:creator>Madathil, Varun</dc:creator>
          <dc:creator>Orsini, Chris</dc:creator>
          <dc:creator>Scafuro, Alessandra</dc:creator>
          <dc:creator>Venturi, Daniele</dc:creator>
          <dc:subject>Oblivious Transfer</dc:subject>
          <dc:subject>Black-Box compiler</dc:subject>
          <dc:subject>Malicious Security</dc:subject>
          <dc:subject>Plain Model</dc:subject>
          <dc:description>We present an information-theoretic transformation from any 2-round OT protocol with only game-based security in the presence of malicious adversaries into a 4-round (which is known to be optimal) OT protocol with simulation-based security in the presence of malicious adversaries.&#13;
Our transform is the first satisfying all of the following properties at the same time:  &#13;
- It is in the plain model, without requiring any setup assumption. &#13;
- It only makes black-box usage of the underlying OT protocol. &#13;
- It is information-theoretic, as it does not require any further cryptographic assumption (besides the existence of the underlying OT protocol).  Additionally, our transform yields a cubic improvement in communication complexity over the best previously known transformation.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Varun Madathil and Chris Orsini and Alessandra Scafuro and Daniele Venturi</dc:contributor>
          <dc:date>2022</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 230, 3rd Conference on Information-Theoretic Cryptography (ITC 2022)</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/LIPIcs.ITC.2022.5</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-164836</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.5</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>
