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 / Description of output

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.
Original languageEnglish
Title of host publicationApplied Cryptography and Network Security
EditorsBart Preneel, Frederik Vercauteren
Place of PublicationCham
PublisherSpringer International Publishing AG
Pages143-162
Number of pages20
ISBN (Print)978-3-319-93387-0
DOIs
Publication statusPublished - 2018
EventThe 16th International Conference on Applied Cryptography and Network Security - Leuven, Belgium
Duration: 2 Jul 20184 Jul 2018
https://www.cosic.esat.kuleuven.be/events/acns2018/

Publication series

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

Conference

ConferenceThe 16th International Conference on Applied Cryptography and Network Security
Abbreviated titleACNS 2018
Country/TerritoryBelgium
CityLeuven
Period2/07/184/07/18
Internet address

Fingerprint

Dive into the research topics of 'Efficient Unconditionally Secure Signatures Using Universal Hashing'. Together they form a unique fingerprint.

Cite this