A New Forward-Secure Digital Signature Scheme

By Michel Abdalla, Leonid Reyzin. International Conference on the Theory and Application of Cryptology and Information Security, 2000

296 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption (2012, methodology): “K (1) j = g ∑l j′=2 Aj [j ′]u[j′] (g−αU (gαX2))Aj [1] Zj ·u2 2 T rj ρ(j)Wj , K((2)) j = gVj • The Challenge Ciphertext.”
A Forward-Secure Public-Key Encryption Scheme (2003, methodology): “This is somewhat similar to prior forward-secure signature schemes [6, 1 ,27], except that we utilize all the nodes in the tree, rather than only the leaves.”
Multi-signatures in the plain public-Key model and a general forking lemma (2006, background): “The ﬁrst is a standard fact which one can derive from Jensen’s inequality, or as a consequence of the fact that the variance of any random variable is non-negative: & ’ The next lemma is actually a consequence of the above although it appears in [2] with a di ﬀ erent proof: Lemma 3.”
Key-Insulated Public Key Cryptosystems (2002, background): “Many improved constructions of forward-secure signatures have subsequently appeared [ 1 , 28, 25, 31].”