Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428739 | Information Processing Letters | 2008 | 7 Pages |
Abstract
A one-time signature scheme using run-length encoding is presented, that in the random oracle model offers security against chosen-message attacks. For parameters of interest, the proposed scheme enables about 33% faster verification with a comparable signature size than a construction of Merkle and Winternitz. The public key size remains unchanged (1 hash value). The main price for the faster verification is an increase of the time for signing messages and for key generation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics