Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
10,837
New Short Signature Scheme with Weil Pairing
"... Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature.. In this paper we propose a new short signature scheme with weil pairing. Also we analyze security and efficiency of our scheme. Sec ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Short signature is an essential component in cryptography. Short digital signatures are needed in environments where a human is asked to manually key in the signature.. In this paper we propose a new short signature scheme with weil pairing. Also we analyze security and efficiency of our scheme
Short Signature Scheme From Bilinear Pairings?
"... Abstract. The first short signature scheme is proposed by Boneh, Lynn, and Shacham (BLS) in [8]. This scheme uses the properties of bilinear pairings on certain elliptic curves. The main problem in BLS scheme is the use of special hash function [3, 5, 8]. To deal with this problem, many cryptographi ..."
Abstract
- Add to MetaCart
Abstract. The first short signature scheme is proposed by Boneh, Lynn, and Shacham (BLS) in [8]. This scheme uses the properties of bilinear pairings on certain elliptic curves. The main problem in BLS scheme is the use of special hash function [3, 5, 8]. To deal with this problem, many
Cryptanalysis of Provably Secure Certicateless Short Signature Scheme
"... Abstract. Recently, Choi et al. proposed certificateless short signature scheme in random oracle model and the author claims that it is provably secure. Certificateless Public Key Cryptography is a new paradigm, where it allows resolving the inherent key escrow and key management problem. Attack to ..."
Abstract
- Add to MetaCart
Abstract. Recently, Choi et al. proposed certificateless short signature scheme in random oracle model and the author claims that it is provably secure. Certificateless Public Key Cryptography is a new paradigm, where it allows resolving the inherent key escrow and key management problem. Attack
A New Short Signature Scheme from Weil Pairing
"... Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. In this paper, a short signature scheme is proposed from weil pairing. The proposed scheme is efficient as lesser number of cost effective pairing operations inv ..."
Abstract
- Add to MetaCart
Currently, short signature is receiving significant attention since it is particularly useful in low-bandwidth communication environments. In this paper, a short signature scheme is proposed from weil pairing. The proposed scheme is efficient as lesser number of cost effective pairing operations
A Short Signature Scheme in the Standard Model
"... Abstract. In this paper, by elaborately choosing the parameters of Waters Hash function, we propose a new efficient signature scheme. It is shown that the scheme is secure against strongly unforgeable chosen-message attacks in the standard model under Computational Diffie-Hellman (CDH) assumption. F ..."
Abstract
- Add to MetaCart
. Further, among all the known secure signatures in the standard model, our scheme is the shortest one and has the efficient security reduction as well. Key Words: Short signature, Strongly unforgeable, CDH 1
Research Article A Secure and Efficient Certificateless Short Signature Scheme
"... Certificateless public key cryptography combines advantage of traditional public key cryptography and identity-based public key cryptography as it avoids usage of certificates and resolves the key escrow problem. In 2007, Huang et al. classified adversaries against certificateless signatures accordi ..."
Abstract
- Add to MetaCart
according to their attack power into normal, strong and super adversaries (ordered by their attack power). In this paper, we propose a new certificateless short signature scheme and prove that it is secure against both of the super type I and the super type II adversaries. Our new scheme not only achieves
Short signatures from the Weil pairing
, 2001
"... We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures ar ..."
Abstract
-
Cited by 755 (25 self)
- Add to MetaCart
We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the size of a DSA signature for a similar level of security. Our short signature scheme is designed for systems where signatures
1A Provably Secure Short Signature Scheme from Coding Theory
"... Abstract—Signatures with partially message recovery in which some parts of messages are not transmitted with signatures to make them shorter are useful where bandwidth is one of the crucial concern and especially in case of signing short messages in applications such as time stamping, certified emai ..."
Abstract
- Add to MetaCart
email services and identity-based cryptosystems. In this paper, to have quantum-attack-resistant short signatures, a signature scheme with partially message recovery from coding theory is proposed. The security of the proposed scheme is proved under Goppa Parametrized Bounded Decoding and the Goppa Code
Cryptanalysis and fixed of short signature scheme without random oracle from bilinear parings
- International Journal of Network Security
, 2011
"... We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and public key attacks. We also propose a new signature scheme without random oracle using bilinear pairing that is existentia ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and public key attacks. We also propose a new signature scheme without random oracle using bilinear pairing
A new short signature scheme without random oracles from bilinear pairings
- IN: VIETCRYPT 2006, LNCS 4341
, 2005
"... To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the k+1 square ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
To date, there exist three short signature schemes from bilinear pairings. In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new complexity assumption called the k+1 square
Results 1 - 10
of
10,837
