The strongest security guarantees for routing protocols can be obtained by the use of signatures on information in routing messages. The goal of digital signature mechanisms is to be...

for the random oracle model, and then replacing oracle accesses by the computation of an "appropriately chosen" function h. This paradigm yields protocols much more efficient than standard ones while retaining many of the advantages of provable security. We illustrate these gains for problems including

In this paper we formalize the notion of a ring signature, which makes it possible to specify a set of possible signers without revealing which member actually produced the signature. Unlike group signatures, ring signatures have no group managers, no setup procedures, no revocation procedures

public key of C* is an n-tuple of quadratic n-variate polynomials over GF(2'") and can be used for both verifying signatures and encrypting plaintexts. This paper also shows that for C* it is practically infeasible to extract the n-tuple of n-variate polynomials representing the inverse

in this paper the class of birational permutations f over k-tuples of numbers, in which both f and f;1 are low degree rational functions. We develop two new families of birational permutations, and showhowto transform them into new public key signature schemes which are much faster than the known schemes. 1.

Signature matching is a performance critical operation in intrusionpreventionsystems. Modernsystemsexpresssignatures as regular expressions and use Deterministic Finite Automata (DFAs) to efficiently match them against the input. In principle, DFAs can be combined so that all signatures can

, in which the compromised forwarders can inject polluted or forged messages into networks. Existing schemes addressing pollution attacks either require an extra secure channel or incur high computation overhead. In this paper, we propose an efficient signature-based scheme to detect and filter pollution

We present a new short signature scheme based on a variant of the Boneh-Boyen’s short signatures schemes. Our short signature scheme is secure without requiring the random oracle model. We show how to prove a committed value embedded in our short signature. Using this primitive, we construct

We describe an RSA-based signing scheme called PSS which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing,

Signature files have been studied extensively as an access method for textual databases. Many approaches have been proposed for searching signatures files efficiently. However, different methods make different assumptions and use different performance measures, making it difficult to compare