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

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

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/99691</identifier>
  <creators>
    <creator>
      <creatorName>Damgard, Ivan</creatorName>
      <givenName>Ivan</givenName>
      <familyName>Damgard</familyName>
      <affiliation>Aarhus Univ, DAIMI, Aarhus, Denmark</affiliation>
    </creator>
    <creator>
      <creatorName>Pedersen, Thomas Brochmann</creatorName>
      <givenName>Thomas Brochmann</givenName>
      <familyName>Pedersen</familyName>
      <affiliation>TUBITAK UEKAE, TR-41470 Gebze, Kocaeli, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Salvail, Louis</creatorName>
      <givenName>Louis</givenName>
      <familyName>Salvail</familyName>
      <affiliation>Univ Montreal DIRO, Montreal, PQ, Canada</affiliation>
    </creator>
  </creators>
  <titles>
    <title>How To Re-Use A One-Time Pad Safely And Almost Optimally Even If P = Np</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2014</publicationYear>
  <dates>
    <date dateType="Issued">2014-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/99691</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1007/s11047-014-9454-5</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">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.</description>
  </descriptions>
</resource>