One-time signatures revisited: Practical fast signatures using fractal Merkle tree traversal

Dalit Naor*, Amir Shenhav, Avishai Wool

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

One-time signatures have been known for more than two decades, and have been studied mainly due to their theoretical value. Recent works motivated us to examine the practical use of one-time signatures in high-performance applications. In this paper we describe FMTseq - a signature scheme that merges recent improvements in hash tree traversal into Merkle's one-time signature scheme. Implementation results show that the scheme provides a signature speed of up to 35 times faster than a 2048-bit RSA signature scheme, for about one million signatures, and a signature size of only a few kilobytes. We provide an analysis of practical parameter selection for the scheme, and improvements that can be applied in more specific scenarios.

Original languageEnglish
Title of host publication2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
Pages255-259
Number of pages5
DOIs
StatePublished - 2006
Event2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI - Eilat, Israel
Duration: 15 Nov 200617 Nov 2006

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2006 IEEE 24th Convention of Electrical and Electronics Engineers in Israel, IEEEI
Country/TerritoryIsrael
CityEilat
Period15/11/0617/11/06

Fingerprint

Dive into the research topics of 'One-time signatures revisited: Practical fast signatures using fractal Merkle tree traversal'. Together they form a unique fingerprint.

Cite this