Results 1  10
of
102
An Efficient Existentially Unforgeable Signature Scheme and its Applications
 Journal of Cryptology
, 1994
"... A signature scheme is existentially unforgeable if, given any polynomial (in the security parameter) number of pairs (m 1 ; S(m 1 )); (m 2 ; S(m 2 )); : : : (m k ; S(m k )) where S(m) denotes the signature on the message m, it is computationally infeasible to generate a pair (m k+1 ; S(m k+1 )) fo ..."
Abstract

Cited by 49 (5 self)
 Add to MetaCart
A signature scheme is existentially unforgeable if, given any polynomial (in the security parameter) number of pairs (m 1 ; S(m 1 )); (m 2 ; S(m 2 )); : : : (m k ; S(m k )) where S(m) denotes the signature on the message m, it is computationally infeasible to generate a pair (m k+1 ; S(m k+1
Making ExistentialUnforgeable Signatures Strongly Unforgeable in the Quantum RandomOracle Model
"... Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature on a message for which the adversary has seen v ..."
Abstract
 Add to MetaCart
Strongly unforgeable signature schemes provide a more stringent security guarantee than the standard existential unforgeability. It requires that not only forging a signature on a new message is hard, it is infeasible as well to produce a new signature on a message for which the adversary has seen
Breaking Existential Unforgeability of a Signature Scheme from Asiacrypt 2014
"... We show how to compute an existential forgery after querying 4 signatures on chosen messages for a signature scheme presented at Asiacrypt 2014. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We show how to compute an existential forgery after querying 4 signatures on chosen messages for a signature scheme presented at Asiacrypt 2014.
Short Signatures without Random Oracles
, 2004
"... We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong RS ..."
Abstract

Cited by 393 (11 self)
 Add to MetaCart
We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Di#eHellman assumption. This assumption has similar properties to the Strong
Strongly unforgeable signatures based on computational diffiehellman
 In Public Key Cryptography
, 2006
"... Abstract. A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m, the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosenciphertext secure systems and gro ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
Abstract. A signature system is said to be strongly unforgeable if the signature is existentially unforgeable and, given signatures on some message m, the adversary cannot produce a new signature on m. Strongly unforgeable signatures are used for constructing chosenciphertext secure systems
Strongly Unforgeable Revocable Certificateless Signature
"... Certificateless publickey systems (CLPKS) were introduced to simultaneously solve the key escrow problem in IDbased publickey systems and eliminate the need of certificates in traditional publickey systems. Since certificates are not required in CLPKS settings, the existing user revocation mec ..."
Abstract
 Add to MetaCart
existential unforgeability by adopting Tseng and Tsai’s revocation mechanism for IDbased publickey systems. However, Sun et al.’s RCLS scheme lacks computation efficiency for both signing and verifying phases. In the article, we propose an efficient RCLS scheme while retaining the merits of Tseng and Tsai’s
Strongly Unforgeable Proxy ReSignature Schemes in the Standard model
"... Abstract. Proxy resignatures are generally used for the delegation of signatures to a semitrusted proxy which transforms the signatures between the users of the system. Its a handy primitive for network security and automated delegations in hierarchical organizations. Though proxy resignature sch ..."
Abstract
 Add to MetaCart
signature schemes that are secure in the standard model are available, none of them have addressed the security notion of strong existential unforgeability, where the adversary will not be able to forge even on messages for which signatures are already available. In this paper, we define the security model
Strongly Unforgeable Proxy ReSignature Schemes in the Standard model No Author Given
"... Abstract. Proxy resignatures are generally used for the delegation of signing rights of a user (delegator) to a semitrusted proxy and a delegatee. The proxy can convert the signature of one user on a message into the signature of another user on the same message by using the delegation information ..."
Abstract
 Add to MetaCart
information (rekey) provided by the delegator. This is a handy primitive for network security and automated delegations in hierarchical organizations. Though proxy resignature schemes that are secure in the standard model are available, none of them have addressed the security notion of strong existential
Strongly unforgeable signatures and hierarchical identitybased signatures from lattices without random oracles
 IN PQCRYPTO
, 2010
"... We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability dem ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers the same efficiency as the “bonsai tree” scheme but supports the stronger notion of strong unforgeability. Strong unforgeability
Secure hashandsign signatures without the random oracle
, 1999
"... We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on "signature trees", and instead it uses the so called "hashandsign" paradigm. It is unique in that the assu ..."
Abstract

Cited by 148 (10 self)
 Add to MetaCart
We present a new signature scheme which is existentially unforgeable under chosen message attacks, assuming some variant of the RSA conjecture. This scheme is not based on "signature trees", and instead it uses the so called "hashandsign" paradigm. It is unique
Results 1  10
of
102