liu.seSök publikationer i DiVA
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
New Universal Hash Functions
Linköpings universitet, Institutionen för systemteknik, Informationskodning.
Linköpings universitet, Institutionen för systemteknik, Informationskodning.ORCID-id: 0000-0002-1082-8325
2012 (Engelska)Ingår i: Lecture Notes in Computer Science, Vol. 7242 / [ed] Frederik Armknecht and Stefan Lucks, Springer Berlin Heidelberg , 2012, s. 99-108Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of Almost Strongly Universal hash functions with much smaller description (or key) length than the Wegman-Carter construction. Unlike some other constructions, our new construction has a very short key length and a security parameter that is independent of the message length, which makes it suitable for authentication in practical applications such as Quantum Cryptography.

Ort, förlag, år, upplaga, sidor
Springer Berlin Heidelberg , 2012. s. 99-108
Serie
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 7242
Nationell ämneskategori
Annan elektroteknik och elektronik
Identifikatorer
URN: urn:nbn:se:liu:diva-84711DOI: 10.1007/978-3-642-34159-5_7ISBN: 978-3-642-34158-8 (tryckt)ISBN: 978-3-642-34159-5 (tryckt)OAI: oai:DiVA.org:liu-84711DiVA, id: diva2:561455
Konferens
4th Western European Workshop on Research in Cryptology, WEWoRC 2011, Weimar, Germany, July 20-22, 2011
Projekt
ICG QCTillgänglig från: 2012-10-18 Skapad: 2012-10-17 Senast uppdaterad: 2018-01-31
Ingår i avhandling
1. Authentication in Quantum Key Distribution: Security Proof and Universal Hash Functions
Öppna denna publikation i ny flik eller fönster >>Authentication in Quantum Key Distribution: Security Proof and Universal Hash Functions
2013 (Engelska)Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
Abstract [en]

Quantum Key Distribution (QKD) is a secret key agreement technique that consists of two parts: quantum transmission and measurement on a quantum channel, and classical post-processing on a public communication channel. It enjoys provable unconditional security provided that the public communication channel is immutable. Otherwise, QKD is vulnerable to a man-in-the-middle attack. Immutable public communication channels, however, do not exist in practice. So we need to use authentication that implements the properties of an immutable channel as well as possible. One scheme that serves this purpose well is the Wegman-Carter authentication (WCA), which is built upon Almost Strongly Universal2 (ASU2) hashing. This scheme uses a new key in each authentication attempt to select a hash function from an ASU2 family, which is then used to generate the authentication tag for a message.

The main focus of this dissertation is on authentication in the context of QKD. We study ASU2 hash functions, security of QKD that employs a computationally secure authentication, and also security of authentication with a partially known key. Specifically, we study the following.

First, Universal hash functions and their constructions are reviewed, and as well as a new construction of ASU2 hash functions is presented. Second, security of QKD that employs a specific computationally secure authentication is studied. We present detailed attacks on various practical implementations of QKD that employs this authentication. We also provide countermeasures and prove necessary and sufficient conditions for upgrading the security of the authentication to the level of unconditional security. Third, Universal hash function based multiple authentication is studied. This uses a fixed ASU2 hash function followed by one-time pad encryption, to keep the hash function secret. We show that the one-time pad is necessary in every round for the authentication to be unconditionally secure. Lastly, we study security of the WCA scheme, in the case of a partially known authentication key. Here we prove tight information-theoretic security bounds and also analyse security using witness indistinguishability as used in the Universal Composability framework.

Ort, förlag, år, upplaga, sidor
Linköping: Linköping University Electronic Press, 2013. s. 55
Serie
Linköping Studies in Science and Technology. Dissertations, ISSN 0345-7524 ; 1517
Nationell ämneskategori
Teknik och teknologier
Identifikatorer
urn:nbn:se:liu:diva-91265 (URN)978-91-7519-625-1 (ISBN)
Disputation
2013-05-17, Visionen, B-huset, Campus Valla, Linköpings universitet, Linköping, 13:15 (Engelska)
Opponent
Handledare
Projekt
ICG QC
Tillgänglig från: 2013-04-18 Skapad: 2013-04-18 Senast uppdaterad: 2019-12-03Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext

Personposter BETA

Abidin, AysajanLarsson, Jan-Åke

Sök vidare i DiVA

Av författaren/redaktören
Abidin, AysajanLarsson, Jan-Åke
Av organisationen
Informationskodning
Annan elektroteknik och elektronik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 1502 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf