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

  title={An Online/Offline Signature Scheme Based on the Strong RSA Assumption},
  author={Ping Yu and Stephen R. Tate},
  journal={21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)},
  • Ping Yu, S. Tate
  • Published 21 May 2007
  • Computer Science, Mathematics
  • 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
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 precomputation phase. The online phase, which is performed after the message to be signed is known, is very efficient, requiring only a single modular multiplication. Online/offline signatures are useful in settings in which signatures need to be produced quickly either when there is a large volume of… 

Improved Identity Based Online/Offline Signature Scheme

  • Yang MingYumin Wang
  • Computer Science
    2010 7th International Conference on Ubiquitous Intelligence & Computing and 7th International Conference on Autonomic & Trusted Computing
  • 2010
A security analysis shows that the proposed identity-based online/offline signature scheme is proved secure against existential forgery on an adaptively chosen message attack under the assumption of Computational Diffie Hellman in the random oracle model.

Direct Online/Offline Digital Signature Schemes.

The experimental results demonstrate that the SGE and SGS schemes are the most efficient techniques for embedded device authentication and bursty server authentication, respectively.

Efficient On-line/Off-line Signature Schemes Based on Multiple-Collision Trapdoor Hash Families

This paper proposes multiple-collision trapdoor hash families based on discrete logarithm and factoring assumptions, and provides formal proofs of their security, and introduces an efficient on-line/off-line signature scheme based on the proposed trapdoorHash families.

Efficient multiple-collision trapdoor hash family

A multiple-collision trapdoor hash family under both integer factoring and discrete logarithm problems, and a pair of secret keys is employed for generating digital signature for online and off-line signature schemes.

Reformed RSA Algorithm Based on Prime Number

A new algorithm concept is suggested to presents the modified form of RSA algorithm in order to speed up the implementation of RSAgorithm during data exchange over the network through the use of third prime number.

Divisible On-Line/Off-Line Signatures

A new notion is introduced: divisible on-line/off-line signatures, in which exposure of off-line signature tokens in off-lines phase is allowed and an efficient construction of this type of signatures is proposed.

Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?

An On-line/Off-line signature scheme is constructed, which is secure under the ordinary security model whilst it is insecure in the new model, and a security proof under the old model and a concrete attack of the scheme under thenew model are presented.



New Online/Offline Signature Schemes Without Random Oracles

A new natural intractability assumption for hash functions is introduced, which can be interpreted as a generalization of second pre-image collision resistance, and is able to construct new signature schemes provably secure under the strong RSA assumption without random oracles.

Improved Online/Offline Signature Schemes

The recently introduced notion of a trapdoor hash function is used to develop a new paradigm called hash-sign-switch, which can convert any signature scheme into a highly efficient on-line/off-line signature scheme and enhances the security of the original signature scheme.

The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin

An RSA-based signing scheme which combines essentially optimal efficiency with attractive security properties and a second scheme which maintains all of the above features and in addition provides message recovery is provided.

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 Signature Scheme with Efficient Protocols

This paper proposes a practical and provably secure signature scheme and shows protocols for issuing a signature on a committed value (so the signer has no information about the signed value), and for proving knowledge of a signing on a commit value.

Secure Hash-and-Sign Signatures Without the Random Oracle

A new signature scheme is presented which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture, and is unique in that the assumptions made on the cryptographic hash function in use are well defined and reasonable.

Signature schemes based on the strong RSA assumption

A new digital signature scheme is described that is quite efficient, does not require the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called strong RSA assumption.

Efficient signature generation by smart cards

  • C. Schnorr
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2004
An efficient algorithm that preprocesses the exponentiation of a random residue modulo p is presented, which improves the ElGamal signature scheme in the speed of the procedures for the generation and the verification of signatures and also in the bit length of signatures.

On-line/off-line digital signatures

A new type of signature scheme, which consists of two phases, which is supposed to be very fast, is proposed, which uses one-time signature schemes, which are very fast for the on-line signing and an ordinary signature scheme is used for the off-line stage.

A public key cryptosystem and a signature scheme based on discrete logarithms

  • Taher El Gamal
  • Computer Science, Mathematics
    IEEE Trans. Inf. Theory
  • 1984
A new signature scheme is proposed, together with an imple- mentation of the Diffie-Hellman key distribution scheme that achieves a public key cryptosystem that relies on the difficulty of computing discrete logarithms over finite fields.