Pushing the limits of one-time signatures

Authors:
Kemal Bicakci
Affiliations:
TOBB University of Economics and Technology, Ankara, Turkey
Venue:
Proceedings of the 2nd international conference on Security of information and networks
Year:
2009

Citing 16
Cited 1

On-line/off-line digital signatures

CRYPTO '89 Proceedings on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
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
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
Provably Unforgeable Signatures

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
How to Sign Digital Streams

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On the Efficiency of One-Time Digital Signatures

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
PayWord and MicroMint: Two Simple Micropayment Schemes

Proceedings of the International Workshop on Security Protocols
How to construct optimal one-time signatures

Computer Networks: The International Journal of Computer and Telecommunications Networking
The Full Cost of Cryptanalytic Attacks

Journal of Cryptology
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks

PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
An efficient broadcast authentication scheme in wireless sensor networks

ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Strengthening digital signatures via randomized hashing

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology

Communication/computation tradeoffs for prolonging network lifetime in wireless sensor networks: The case of digital signatures

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.