An implementation of the hash-chain signature scheme for wireless sensor networks

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we present the first implementation of the Dahmen-Krauß Hash-Chain Signature Scheme (DKSS) for short messages on a Wireless Sensor Node. We point out one error in the originally proposed scheme concerning the specification of the employed pseudo-random number generator and provide a corrected specification. We also give a new time-memory trade-off between signing time and private key size. We present performance results for various message-lengths, which are a parameter of this scheme, for two different choices for the block cipher used to build the one-way functions employed in this scheme, allowing comparisons with previous implementations of other public-key signature schemes. Furthermore, we describe our implementation of a synchronization protocol, needed in practical applications of this scheme whenever a node lacks the predecessor of a signature. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Mourier, N., Stampp, R., & Strenzke, F. (2013). An implementation of the hash-chain signature scheme for wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8162 LNCS, pp. 68–80). https://doi.org/10.1007/978-3-642-40392-7_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free