<?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-22T21:03:49Z</responseDate>
  <request identifier="1016" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1016</identifier>
        <datestamp>2024-03-06T11:07:16Z</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>Tightness of the Security Bound of CENC</dc:title>
          <dc:creator>Iwata, Tetsu</dc:creator>
          <dc:subject>Encryption mode</dc:subject>
          <dc:subject>blockcipher</dc:subject>
          <dc:subject>CENC</dc:subject>
          <dc:subject>provable security</dc:subject>
          <dc:description>This talk presents an overview of recently developed &#13;
encryption mode for blockciphers, called CENC.&#13;
CENC has the following advantages: &#13;
(1) beyond the birthday bound security, &#13;
(2) security proofs with the standard PRP assumption, &#13;
(3) highly efficient, &#13;
(4) single blockcipher key, &#13;
(5) fully parallelizable, &#13;
(6) allows precomputation of keystream, and &#13;
(7) allows random access.&#13;
Then we discuss the tightness of its security bound, &#13;
and give a partial answer to the open problem posed &#13;
at FSE 2006.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Tetsu Iwata</dc:contributor>
          <dc:date>2007</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 7021, Symmetric Cryptography (2007)</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.07021.10</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-10169</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07021.10</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>
