Efficient unconditionally secure signatures using universal hashing

Ryan Amiri, Aysajan Abidin, Petros Wallden, Erika Andersson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature length and high generation efficiency, to name two. In particular, we extend symmetric-key message authentication codes (MACs) based on universal hashing to make them transferable, a property absent from traditional MAC schemes. Our main results are summarised as follows. We construct an unconditionally secure signature scheme which, unlike prior schemes, does not rely on a trusted third party or anonymous channels.We prove information-theoretic security of our scheme against forging, repudiation, and non-transferability.We compare our scheme with existing both “classical” (not employing quantum mechanics) and quantum unconditionally secure signature schemes. The comparison shows that our new scheme, despite requiring fewer resources, is much more efficient than all previous schemes.Finally, although our scheme does not rely on trusted third parties, we discuss this, showing that having a trusted third party makes our scheme even more attractive.

Original languageEnglish
Title of host publicationApplied Cryptography and Network Security
EditorsBart Preneel, Frederik Vercauteren
PublisherSpringer
Pages143-162
Number of pages20
ISBN (Electronic)9783319933870
ISBN (Print)9783319933863
DOIs
Publication statusPublished - 10 Jun 2018
Event16th International Conference on Applied Cryptography and Network Security 2018 - Leuven, Belgium
Duration: 2 Jul 20184 Jul 2018

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume10892
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Applied Cryptography and Network Security 2018
Abbreviated titleACNS 2018
CountryBelgium
CityLeuven
Period2/07/184/07/18

Fingerprint

Hashing
Authentication
Signature
Electronic document identification systems
Quantum theory
Security of data
Forging
Signature Scheme
Message Authentication Code
Information-theoretic Security
Short Signature
Digital Signature
Quantum Mechanics
Resources

Keywords

  • Digital signatures
  • Information-theoretic security
  • Transferable MAC
  • Universal hashing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Amiri, R., Abidin, A., Wallden, P., & Andersson, E. (2018). Efficient unconditionally secure signatures using universal hashing. In B. Preneel, & F. Vercauteren (Eds.), Applied Cryptography and Network Security (pp. 143-162). (Lecture Notes in Computer Science; Vol. 10892). Springer. https://doi.org/10.1007/978-3-319-93387-0_8
Amiri, Ryan ; Abidin, Aysajan ; Wallden, Petros ; Andersson, Erika. / Efficient unconditionally secure signatures using universal hashing. Applied Cryptography and Network Security. editor / Bart Preneel ; Frederik Vercauteren. Springer, 2018. pp. 143-162 (Lecture Notes in Computer Science).
@inproceedings{ac7adcd80165493ebad6cda423bea7b2,
title = "Efficient unconditionally secure signatures using universal hashing",
abstract = "Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature length and high generation efficiency, to name two. In particular, we extend symmetric-key message authentication codes (MACs) based on universal hashing to make them transferable, a property absent from traditional MAC schemes. Our main results are summarised as follows. We construct an unconditionally secure signature scheme which, unlike prior schemes, does not rely on a trusted third party or anonymous channels.We prove information-theoretic security of our scheme against forging, repudiation, and non-transferability.We compare our scheme with existing both “classical” (not employing quantum mechanics) and quantum unconditionally secure signature schemes. The comparison shows that our new scheme, despite requiring fewer resources, is much more efficient than all previous schemes.Finally, although our scheme does not rely on trusted third parties, we discuss this, showing that having a trusted third party makes our scheme even more attractive.",
keywords = "Digital signatures, Information-theoretic security, Transferable MAC, Universal hashing",
author = "Ryan Amiri and Aysajan Abidin and Petros Wallden and Erika Andersson",
year = "2018",
month = "6",
day = "10",
doi = "10.1007/978-3-319-93387-0_8",
language = "English",
isbn = "9783319933863",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "143--162",
editor = "Bart Preneel and Frederik Vercauteren",
booktitle = "Applied Cryptography and Network Security",

}

Amiri, R, Abidin, A, Wallden, P & Andersson, E 2018, Efficient unconditionally secure signatures using universal hashing. in B Preneel & F Vercauteren (eds), Applied Cryptography and Network Security. Lecture Notes in Computer Science, vol. 10892, Springer, pp. 143-162, 16th International Conference on Applied Cryptography and Network Security 2018, Leuven, Belgium, 2/07/18. https://doi.org/10.1007/978-3-319-93387-0_8

Efficient unconditionally secure signatures using universal hashing. / Amiri, Ryan; Abidin, Aysajan; Wallden, Petros; Andersson, Erika.

Applied Cryptography and Network Security. ed. / Bart Preneel; Frederik Vercauteren. Springer, 2018. p. 143-162 (Lecture Notes in Computer Science; Vol. 10892).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient unconditionally secure signatures using universal hashing

AU - Amiri, Ryan

AU - Abidin, Aysajan

AU - Wallden, Petros

AU - Andersson, Erika

PY - 2018/6/10

Y1 - 2018/6/10

N2 - Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature length and high generation efficiency, to name two. In particular, we extend symmetric-key message authentication codes (MACs) based on universal hashing to make them transferable, a property absent from traditional MAC schemes. Our main results are summarised as follows. We construct an unconditionally secure signature scheme which, unlike prior schemes, does not rely on a trusted third party or anonymous channels.We prove information-theoretic security of our scheme against forging, repudiation, and non-transferability.We compare our scheme with existing both “classical” (not employing quantum mechanics) and quantum unconditionally secure signature schemes. The comparison shows that our new scheme, despite requiring fewer resources, is much more efficient than all previous schemes.Finally, although our scheme does not rely on trusted third parties, we discuss this, showing that having a trusted third party makes our scheme even more attractive.

AB - Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature length and high generation efficiency, to name two. In particular, we extend symmetric-key message authentication codes (MACs) based on universal hashing to make them transferable, a property absent from traditional MAC schemes. Our main results are summarised as follows. We construct an unconditionally secure signature scheme which, unlike prior schemes, does not rely on a trusted third party or anonymous channels.We prove information-theoretic security of our scheme against forging, repudiation, and non-transferability.We compare our scheme with existing both “classical” (not employing quantum mechanics) and quantum unconditionally secure signature schemes. The comparison shows that our new scheme, despite requiring fewer resources, is much more efficient than all previous schemes.Finally, although our scheme does not rely on trusted third parties, we discuss this, showing that having a trusted third party makes our scheme even more attractive.

KW - Digital signatures

KW - Information-theoretic security

KW - Transferable MAC

KW - Universal hashing

UR - http://www.scopus.com/inward/record.url?scp=85049102319&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-93387-0_8

DO - 10.1007/978-3-319-93387-0_8

M3 - Conference contribution

SN - 9783319933863

T3 - Lecture Notes in Computer Science

SP - 143

EP - 162

BT - Applied Cryptography and Network Security

A2 - Preneel, Bart

A2 - Vercauteren, Frederik

PB - Springer

ER -

Amiri R, Abidin A, Wallden P, Andersson E. Efficient unconditionally secure signatures using universal hashing. In Preneel B, Vercauteren F, editors, Applied Cryptography and Network Security. Springer. 2018. p. 143-162. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-93387-0_8