Improved Online/Offline Signature Schemes

By Adi Shamir, Yael Tauman Kalai. Annual International Cryptology Conference, 2001

385 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Information Systems

View Paper: https://www.semanticscholar.org/paper/912eb9207b92abe5dbd670ec70f1204ae4f424a1

How researchers see this paper

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

In Artificial Intelligence

In Computational Theory and Mathematics

In Information Systems

Citations in the corpus

A Survey on Recent Advances in Vehicular Network Security, Trust, and Privacy (2019, methodology): “In the improved IBOOS [49] for VANETs, the signing process is separated into an online phase and an offline phase.”
Bonsai Trees, or How to Delegate a Lattice Basis (2010, background): “Furthermore, the construction results in an online/offline signature scheme; see [54].”
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, methodology): “It is instructive to consider the relation between the full signature scheme of Section 4.1 and an elegant signature construction based on the Strong RSA assumption due to Gennaro, Halevi, and Rabin (GHR) [23].”
New Algorithms for Secure Outsourcing of Modular Exponentiations (2012, background): “In this section, we focus on simultaneous modular exponentiations u1u b 2 mod p, which play an important role in many cryptographic primitives such as chameleon hashing [5], [6], [23], [24], [38], [48] and trapdoor commitment [9], [44], [34].”
On the Security of Joint Signature and Encryption (2002, background): “We also show that the newCtESd)… Commit(m), and hence Lemma 2 — true for any commitment scheme — implies that this modi£ed signature scheme is indeed secure (more detailed proof is given in [ 30 ]).”
Redactable Blockchain – or – Rewriting History in Bitcoin and Friends (2017, background): “as public-coin ones, in particular for constructing chameleon signatures [34] and online/offline signatures [50]; the only difference is that one needs to store the check value ξ (instead of the randomness r) in order to verify a hash value, and the hash verification does not in general consist of r”
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks (2002, background): “Some other approaches provide efficient on-line signature generation but assume off-line preparation [22, 82, 83].”
Trustworthy Whole-System Provenance for the Linux Kernel (2015, background): “An alternative to DSA signing would be HMAC [9], which offers better performance but requires pairwise keying and sacrifices the non-repudiation policy; BLS, which approaches the theoretical maximum security parameter per byte of signature [12]; or online/offline signature schemes [15, 23, 26, 55].”