Digital signatures for flows and multicasts
IEEE/ACM Transactions on Networking (TON)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
The BiBa one-time signature and broadcast authentication protocol
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Performance analysis of elliptic curve cryptography for SSL
WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
SPINS: security protocols for sensor networks
Wireless Networks
Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
How to construct optimal one-time signatures
Computer Networks: The International Journal of Computer and Telecommunications Networking
Seven cardinal properties of sensor network broadcast authentication
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
WIMOB '08 Proceedings of the 2008 IEEE International Conference on Wireless & Mobile Computing, Networking & Communication
Fractal Merkle tree representation and traversal
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
| Hi-index | 0.00 |
One Time Signatures are based on the idea of committing a secret key via one-way functions, decreasing dramatically the signing and verification times when compared to asymmetric primitives. This important feature made them attractive for application fields (like wireless and sensor networks) that have limited memory or computing resources at disposal, but which require fast response times for security operations. In this paper, we describe and evaluate two one-time signature schemes - named FMTseq and Log-Logseq - appropriate for sensor networks, which exploit Merkle hash tree-based one time signature scheme and recent techniques proposed to traverse Merkle trees efficiently so that to save space and/or time when signing several messages at a time. Through experiments, we compare the performance of these schemes with the approach in which multiple signatures are calculated with traditional asymmetric algorithms, e.g. RSA, ECDSA and DSA, and we discuss the pros and cons of the schemes considered in our approach.