How to construct optimal one-time signatures

Download

index.pdf

Date

2003-10-22

Author

Bicakci, K
Tsudik, G
Tung, B

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

147
views

0
downloads

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.

Subject Keywords

Computer Networks and Communications

URI

https://hdl.handle.net/11511/66666

Journal

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING

DOI

https://doi.org/10.1016/s1389-1286(03)00285-8

Collections

Graduate School of Informatics, Article

Suggestions

OpenMETU
Core

A Semantic-Based Solution for UBL Schema Interoperability Yarimagan, Yalin; Doğaç, Asuman (Institute of Electrical and Electronics Engineers (IEEE), 2009-05-01) The Universal Business Language (UBL) is an initiative to develop common business document schemas for interoperability. However, businesses operate in different industry, geopolitical, and regulatory contexts and have different rules and requirements for the information they exchange. So, several trading communities are tailoring UBL schemas to their needs, requiring that these schemas translate to each other. In this article, the authors describe how to enhance UBL with semantics-based translation mechani...
Frame-counter scheduler: A novel QoS scheduler for real-time traffic Schmidt, Şenan Ece (Elsevier BV, 2006-08-04) Real-time traffic communication has Quality of Service (QoS) requirements such as end-to-end bandwidth and delay guarantees.
A time-evolution model for the privacy degree of information disseminated in online social networks Othmane, Lotfi Ben; Weffers, Harold; Angın, Pelin; Bhargava, Bharat (Inderscience Publishers, 2013-01-01) People tend to share private information with their friends on online social networks (OSNs). The common position is that the shared information eventually reaches all users of the network since OSNs exhibit the small-world property. However, dissemination of private information in an OSN exhibits a set of factors that need to be accounted for in order to create more realistic models of the evolution of the privacy degree of information disseminated in an OSN. Among these factors are relationship strength b...
Design and analysis of hash functions Koçak, Onur; Doğanaksoy, Ali; Department of Cryptography (2009) Hash functions are cryptographic tools that are used in various applications like digital signature, message integrity checking, password storage and random number generation. These cryptographic primitives were, first, constructed using modular arithmetical operations which were popular at that time because of public key cryptography. Later, in 1989, Merkle and Damgard independently proposed an iterative construction method. This method was easy to implement and had a security proof. MD-4 was the first has...
Cache-Based Query Processing for Search Engines Cambazoglu, B. Barla; Altıngövde, İsmail Sengör; Ozcan, Rifat; Ulusoy, Ozgur (Association for Computing Machinery (ACM), 2012-11-01) In practice, a search engine may fail to serve a query due to various reasons such as hardware/network failures, excessive query load, lack of matching documents, or service contract limitations (e.g., the query rate limits for third-party users of a search service). In this kind of scenarios, where the backend search system is unable to generate answers to queries, approximate answers can be generated by exploiting the previously computed query results available in the result cache of the search engine. In...

Citation Formats

K. Bicakci, G. Tsudik, and B. Tung, “How to construct optimal one-time signatures,” COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, pp. 339–349, 2003, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66666.