Please use this identifier to cite or link to this item:
Title: Pushing the limits of one-time signatures
Authors: Bıçakcı, Kemal
Keywords: Authentication
Digital signatures
Hash collisions
One-time signatures
Wireless sensor networks
Issue Date: 2009
Source: 2nd International Conference on Security of Information and Networks, SIN'09, 6 October 2009 through 10 October 2009, Famagusta, 78334
Abstract: Computational and security advantages of one-time signatures come together with their length restrictions. In most applications, one-time signature should be accompanied with one-time public key(s) to enable multiple signing with a single certified public key. This is why most of the time decreasing the size of one-time signature at a cost of larger public key is not what we desire. In this paper, we show the most efficient one-time signature construction proposed so far in the sense that the total length of a signature and a public key is minimized. Requiring heavier offline computation while keeping the online computation cost both for signing and verification not changed, our improvement is a significant result especially for wireless sensor networks. This is because limited battery power puts stringent limitations on message sizes however heavy offline computation is acceptable and can be performed prior to the deployment of the sensor network. Copyright 2009 ACM.
ISBN: 9781605584126
Appears in Collections:Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Show full item record

CORE Recommender


checked on Sep 23, 2022

Page view(s)

checked on Feb 6, 2023

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.