1 Ocak 2014 Dergi makalesi Açık Erişim

Damgard, Ivan; Pedersen, Thomas Brochmann; Salvail, Louis

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">How to re-use a one-time pad safely and almost optimally even if P = NP</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">NATURAL COMPUTING</subfield>
    <subfield code="v">13</subfield>
    <subfield code="n">4</subfield>
    <subfield code="c">469-486</subfield>
  </datafield>
  <controlfield tag="001">99691</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Assuming an insecure quantum channel, a quantum computer, and an authenticated classical channel, we propose an unconditionally secure scheme for encrypting classical messages under a shared key, where attempts to eavesdrop the ciphertext can be detected. If no eavesdropping is detected, we can securely re-use the entire key for encrypting new messages. If eavesdropping is detected, we must discard a number of key bits corresponding to the length of the message, but can re-use almost all of the rest. We show this is essentially optimal. Thus, provided the adversary does not interfere (too much) with the quantum channel, we can securely send an arbitrary number of message bits, independently of the length of the initial key. Moreover, the key-recycling mechanism only requires one-bit feedback. While ordinary quantum key distribution with a classical one time pad could be used instead to obtain a similar functionality, this would need more rounds of interaction and more communication.</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="2">opendefinition.org</subfield>
    <subfield code="a">cc-by</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">TUBITAK UEKAE, TR-41470 Gebze, Kocaeli, Turkey</subfield>
    <subfield code="a">Pedersen, Thomas Brochmann</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Univ Montreal DIRO, Montreal, PQ, Canada</subfield>
    <subfield code="a">Salvail, Louis</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="b">article</subfield>
    <subfield code="a">publication</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Aarhus Univ, DAIMI, Aarhus, Denmark</subfield>
    <subfield code="a">Damgard, Ivan</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2014-01-01</subfield>
  </datafield>
  <controlfield tag="005">20210316141555.0</controlfield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="o">oai:zenodo.org:99691</subfield>
    <subfield code="p">user-tubitak-adresli-yayinlar</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:a22193920f3c02460ad460d37fb599e1</subfield>
    <subfield code="s">155</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/99691/files/bib-b132e2cd-e530-42a7-bbe1-a4f996577f7e.txt</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
    <subfield code="a">Creative Commons Attribution</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s11047-014-9454-5</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
</record>