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 条
  • [41] How to Construct State Registries-Matching Undeniability with Public Security
    Kubiak, Przemyslaw
    Kutylowski, Miroslaw
    Shao, Jun
    INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT I, PROCEEDINGS, 2010, 5990 : 64 - +
  • [42] Efficient many-to-one authentication with certificateless aggregate signatures
    Zhang, Lei
    Qin, Bo
    Wu, Qianhong
    Zhang, Futai
    COMPUTER NETWORKS, 2010, 54 (14) : 2482 - 2491
  • [43] How to generate universally verifiable signatures in ad-hoc networks
    Lee, KyungKeun
    Oh, JoongHyo
    Moon, SangJae
    SECURE MOBILE AD-HOC NETWORKS AND SENSORS, 2006, 4074 : 118 - 131
  • [44] Uniform hashing in constant time and optimal space
    Pagh, Anna
    Pagh, Rasmus
    SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 85 - 96
  • [45] Forward-Secure Signatures for Unbounded Time Periods in Mobile Computing Applications
    Sunitha, N. R.
    Amberker, B. B.
    Koulgi, Prashant
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (05): : 208 - 212
  • [46] EVEREST: An efficient method for verification of digital signatures in real-time teleradiology
    Bicakci, K
    Baykal, N
    MEDINFO 2004: PROCEEDINGS OF THE 11TH WORLD CONGRESS ON MEDICAL INFORMATICS, PT 1 AND 2, 2004, 107 : 1241 - 1245
  • [47] HMAC BASED ONE TIME PASSWORD GENERATOR
    Yakut, Selman
    Ozer, A. Bedri
    2014 22ND SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2014, : 1563 - 1566
  • [48] Sandwich is indeed secure: How to authenticate a message with just one hashing
    Yasuda, Kan
    Information Security and Privacy, Proceedings, 2007, 4586 : 355 - 369
  • [49] Zero Knowledge One Time Digital Signature Scheme
    Datta, Nivedita
    2012 IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND COMPUTING RESEARCH (ICCIC), 2012, : 479 - 482