Results 141 to 150 of about 476 (169)

Efficient and Short Certificateless Signature

2008
A certificateless signature (CLS) scheme with short signature size is proposed in this paper. Our scheme is as efficient as BLS short signature scheme in both communication and computation, and therefore turns out to be more efficient than other CLS schemes proposed so far.
Raylin Tso, Xun Yi, Xinyi Huang 0001
openaire   +3 more sources

An efficient certificateless undeniable signature scheme

International Journal of Computer Mathematics, 2014
Certificateless cryptography addresses the private key escrow problem in identity-based systems, while overcoming the costly issues in traditional public key cryptography. Undeniable signature schemes were proposed with the aim of limiting the public verifiability of ordinary digital signatures. The first certificateless undeniable signature scheme was
Rouzbeh Behnia, Swee-Huay Heng, Che-Sheng Gan   +2 more
openaire   +2 more sources

Cryptanalysis of a certificateless aggregate signature scheme

IACR Cryptol. ePrint Arch., 2016
Recently, Nie et al.‎ proposed a certificateless aggregate signature scheme.‎ In the standard security model considered in certificateless cryptography, we are dealing with two types of adversaries.‎ In this paper, we show that Nie et al.‎'s scheme is insecure against the adversary of the first type.‎ In other words, although they claimed that their ...
Pakniat, Nasrollah, Noroozi, Mahnaz
openaire   +2 more sources

Strongly secure certificateless short signatures

Journal of Systems and Software, 2012
Highlights? We introduce a new efficient and secure short certificateless signature scheme. ? It is strongly unforgeable. ? The security is based on the CDH assumption. ? The proposed scheme is provably secure against a relatively stronger adversary. Short certificateless signatures have come into limelight in recent years.
Raylin Tso, Xinyi Huang 0001, Willy Susilo   +2 more
openaire   +2 more sources

Certificateless Designated Verifier Signature Schemes

20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06), 2006
Designated verifier signature schemes allow a signer to convince a designated verifier, in such a way that only the designated verifier will believe with the authenticity of such a signature. The previous constructions of designated verifier signature rely on the underlying Public Key Infrastructure, that requires both signer and verifier to verify the
Xinyi Huang 0001, Willy Susilo, Yi Mu 0001, Futai Zhang   +3 more
openaire   +1 more source

Two Notes on the Security of Certificateless Signatures

2007
We discuss two common pitfalls found in proofs of security of various certificateless signature (CLS) schemes. As a result of the first observation, we are able to show that a CLS scheme ([Goy06]), previously thought to be secure, is vulnerable to a key replacement attack.
Rafael Castro, Ricardo Dahab
openaire   +1 more source

Practical certificateless short signature scheme

International Journal of Electronic Security and Digital Forensics, 2014
Certificateless cryptography is an attractive paradigm for public key cryptography since it does not require certificates in traditional public key cryptography and also solves the inherent key escrow problem in identity-based cryptography. Currently, certificateless short signature is receiving significant attention from the public key cryptography ...
Miaomiao Tian 0001, Liusheng Huang, Wei Yang 0011   +2 more
openaire   +1 more source

On the Security of a Certificateless Aggregate Signature Scheme

IEEE Communications Letters, 2011
Certificateless cryptography eliminates the need of certificates in public key cryptosystems and solves the inherent key escrow problem in identity-based cryptosystems. An aggregate signature scheme is a signature scheme which allows to aggregate n signatures on n distinct messages from n distinct users into a single signature.
openaire   +1 more source

The insecurity of a certificateless undeniable signature scheme

2016 International Wireless Communications and Mobile Computing Conference (IWCMC), 2016
Duan proposed the first certificateless undeniable signature scheme in 2008. Later in 2012, Zhao and Ye proffered an efficient scheme which enjoys from a pairing-free sign algorithm. In this paper, we prove the insecurity of their efficient scheme by mounting two attacks on its invisibility and non-impersonation.
Rouzbeh Behnia, Swee-Huay Heng
openaire   +2 more sources

Batch Verification for Certificateless Signature Schemes

2009 International Conference on Computational Intelligence and Security, 2009
Batch verification is a practical and significant technique which is very useful for greatly reducing the computational cost of verifying many signatures simultaneously. This technique is very attractive for authentications in computation-limited applications such as sensor network and banking service.
Manman Geng, Futai Zhang
openaire   +1 more source