Improved Online/Offline Signature Schemes

  title={Improved Online/Offline Signature Schemes},
  author={Adi Shamir and Yael Tauman Kalai},
The notion of on-line/off-line signature schemes was introduced in 1990 by Even, Goldreich and Micali. They presented a general method for converting any signature scheme into an on-line/off-line signature scheme, but their method is not very practical as it increases the length of each signature by a quadratic factor. In this paper we use the recently introduced notion of a trapdoor hash function to develop a new paradigm called hash-sign-switch, which can convert any signature scheme into a… 

Generic On-Line/Off-Line Threshold Signatures

This paper proposes generic on-line/off-line threshold signatures by applying the hash-sign-switch paradigm developed by Adi Shamir and Yael Tauman, and uses a Chameleon hash function based on bilinear parings, which proves that the scheme is existentially unforgeable against adaptive chosen message attack under the chosen-target computational Diffie-Hellman assumption.

Efficient generic on-line/off-line (threshold) signatures without key exposure

An Improved Secure Identity-Based On-Line/Off-Line Signature Scheme

A stronger attack is given which is able to make that any one can produce a forged signature on arbitrary a message in the absence of the private key of a signer and a valid signature of a message.

Improved On-Line/Off-Line Threshold Signatures

This paper presents an alternative solution to the generic threshold version of on-line/off-line signature schemes based on the "hash-sign-switch" paradigm, which can be based on any threshold signature scheme, combined with a chameleon hash function based on discrete log, and shows that it can be proven secure based only on the traditional discrete logarithm assumption.

An Efficient CDH-Based Signature Scheme with a Tight Security Reduction

This paper proposes a new signature scheme that also has a tight security reduction to CDH but whose resulting signatures are smaller than EDL signatures, and which represents to date the most efficient scheme of any signature scheme with a tightSecurity reduction in the discrete-log setting.

Efficient Generic On-Line/Off-Line Signatures Without Key Exposure

This paper introduces a special double-trapdoor hash family based on the discrete logarithm assumption and applies the "hash-sign-switch" paradigm to propose a much more efficient generic on-line/off-line signature scheme.

Off-Line/On-Line Signatures: Theoretical Aspects and Experimental Results

This paper unify the Shamir-Tauman and Even et al. approaches by showing that they can be considered different instantiations of the same paradigm, and proves that a special type of chameleon hashing is a fully secure one-time signature.

Generic On-Line/Off-Line Threshold Signatures

The “hash-sign-switch” paradigm of Shamir and Tauman and the distributed key generation protocol of Gennaro et al. are applied to convert any existing secure threshold digital signature scheme into a threshold on-line/off-line signature scheme to prove its signature scheme secure against a static adversary in the partially synchronous communication model.

An Online/Offline Signature Scheme Based on the Strong RSA Assumption

  • Ping YuS. Tate
  • Computer Science, Mathematics
    21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
  • 2007
We propose an efficient digital signature scheme, which is proved secure under the strong RSA assumption, and can operate in an online/offline manner, doing most of its work in the offline

The power of identification schemes

This paper proves an equivalence between non-interactive trapdoor commitment schemes and a natural class of identification schemes and proposes a more efficient on-line/off-line signature transformation than Shamir-Tauman.



A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks

A digital signature scheme based on the computational difficulty of integer factorization possesses the novel property of being robust against an adaptive chosen-message attack: an adversary who receives signatures for messages of his choice cannot later forge the signature of even a single additional message.

A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important

Riemann's Hypothesis and tests for primality

  • G. Miller
  • Computer Science, Mathematics
  • 1975
It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions.

Chameleon Signatures

Digitized Signatures as Intractable as Factorization

  • Technical Report MIT/LCS
  • 1979