How to construct optimal one-time signatures

被引：15

作者：

Bicakci, K ^{[1
]}

Tsudik, G

Tung, B

机构：

[1] Middle E Tech Univ, Inst Informat, TR-06531 Ankara, Turkey

[2] Univ Calif Irvine, Dept Comp Sci, Irvine, CA 92612 USA

[3] Univ So Calif, Inst Informat Sci, Marina Del Rey, CA 90292 USA

来源：

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING | 2003年 / 43卷 / 03期

关键词：

one-time signature; digital signature; on-line/off-line digital signature; hash function; combinatorics;

D O I：

10.1016/S1389-1286(03)00285-8

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

One-time signature (OTS) offer a viable alternative to public key-based digital signatures. OTS security is typically based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of some mathematical problem. Although many OTS methods have been proposed in the past, no solid foundation exists for judging their efficiency or optimality. This paper develops a methodology for evaluating OTS methods and presents optimal OTS techniques for a single OTS or a tree with many OTS's. These techniques can be used in a seesaw mode to obtain the desired tradeoff between various parameters such as the cost of signature generation and its subsequent verification. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：339 / 349

页数：11

共 49 条

[31] How to construct sufficient conditions for hash functions
Sasaki, Yu
Naito, Yusuke
Yajima, Jun
Shimoyama, Takeshi
Kunihiro, Noboru
Ohta, Kazuo
PROGRESS IN CRYPTOLOGY - VIETCRYPT 2006, 2006, 4341 : 243 - +
[32] A fast color image encryption scheme using one-time S-Boxes based on complex chaotic system and random noise
Liu, Hongjun
Kadir, Abdurahman
Gong, Pijuan
OPTICS COMMUNICATIONS, 2015, 338 : 340 - 347
[33] Subversion in Practice: How to Efficiently Undermine Signatures
Baek, Joonsang
Susilo, Willy
Kim, Jongkil
Chow, Yang-Wai
IEEE ACCESS, 2019, 7 : 68799 - 68811
[34] How (Not) to design strong-RSA signatures
Marc Joye
Designs, Codes and Cryptography, 2011, 59 : 169 - 182
[35] How to construct efficient signcryption schemes on elliptic curves
Zheng, YL
Imai, H
INFORMATION PROCESSING LETTERS, 1998, 68 (05) : 227 - 233
[36] Dynamic forest of random subsets-based one-time signature-based capability enhancing security architecture for named data networking
Babu V.J.
Jose M.V.
International Journal of Information Technology, 2023, 15 (2) : 773 - 788
[37] Metered Signatures: How to Restrict the Signing Capability
Kim, Woo-Hwan
Yoon, Hyojin
Cheon, Jung Hee
JOURNAL OF COMMUNICATIONS AND NETWORKS, 2010, 12 (03) : 201 - 208
[38] How (Not) to design strong-RSA signatures
Joye, Marc
DESIGNS CODES AND CRYPTOGRAPHY, 2011, 59 (1-3) : 169 - 182
[39] Improved Merkle Hash Tree-Based One-Time Signature Scheme for Capability-Enhanced Security Enforcing Architecture for Named Data Networking
Babu, Varghese Jensy
Jose, M. Victor
WIRELESS PERSONAL COMMUNICATIONS, 2020, 115 (01) : 557 - 574
[40] Improved Merkle Hash Tree-Based One-Time Signature Scheme for Capability-Enhanced Security Enforcing Architecture for Named Data Networking
Varghese Jensy Babu
M. Victor Jose
Wireless Personal Communications, 2020, 115 : 557 - 574

← 1 2 3 4 5 →