scholarly journals Secure Certificateless Signature with Revocation in the Standard Model

2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Tung-Tso Tsai ◽  
Sen-Shan Huang ◽  
Yuh-Min Tseng
Keyword(s):  
Standard Model ◽  
Public Key Cryptography ◽  
Public Key ◽  
Key Generation ◽  
Security Model ◽  
Certificateless Public Key Cryptography ◽  
Random Oracles ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Certificateless Signature

Certificateless public key cryptography is very attractive in solving the key escrow problem which is inherent in identity- (ID-) based public key cryptography. In the past, a large number of certificateless cryptographic schemes and protocols were presented, but a secure certificateless signature in the standard model (without random oracles) is still not accessible until now. To the best of our knowledge, all the previously proposed certificateless signature schemes were insecure under a considerably strong security model in the sense that they suffered from outsiders’ key replacement attacks or the attacks from the key generation center (KGC). In this paper, we propose a certificateless signature scheme without random oracles. Moreover, our scheme is secure under the strong security model and provides a public revocation mechanism, called revocable certificateless signature (RCLS). Under the standard computational Diffie-Hellman assumption, we formally demonstrate that our scheme possesses existential unforgeability against adaptive chosen-message attacks.

New Constructions of Hierarchical Identity-Based Signature in the Standard Model

2011 ◽  
Vol 474-476 ◽  
pp. 1356-1361
Author(s):  
Qing Wu ◽  
Su Xia Sun
Keyword(s):  
Standard Model ◽  
Provable Security ◽  
Security Model ◽  
Private Key ◽  
Random Oracles ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Cdh Assumption ◽  
Identity Based ◽  
Provably Secure

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.

Key Replacement Attack on Two Certificateless Signature Schemes without Random Oracles

2010 ◽  
Vol 439-440 ◽  
pp. 1606-1611 ◽  
Author(s):  
Qi Xia ◽  
Chun Xiang Xu ◽  
Yong Yu
Keyword(s):  
Standard Model ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
The Public ◽  
Random Oracles ◽  
The Standard Model ◽  
Replacement Attack ◽  
Certificateless Signature

Liu et al. proposed the first certificateless signature scheme without random oracles in 2007. However, Xiong et al. showed that Liu et al.'s scheme is insecure against a malicious-but-passive KGC attack and proposed an improved scheme. In ISA 2009, Yuan et al. also proposed a new certificateless signature scheme without random oracles. Although they claimed that the two schemes are secure in the standard model, this paper shows that both Xiong et al.'s improved scheme and Yuan et al.'s new scheme are vulnerable to key replacement attack, where an adversary, obtaining a signature on a message and replacing the public key of a signer, can forge valid signatures on the same message under the replaced public key. We also give the corresponding modifications of the two schemes to resist key replacement attack.

Efficient Certificateless Signcryption in the Standard Model: Revisiting Luo and Wan’s Scheme from Wireless Personal Communications (2018)

2019 ◽  
Vol 62 (8) ◽  
pp. 1178-1193 ◽  
Author(s):  
Parvin Rastegari ◽  
Willy Susilo ◽  
Mohammad Dakhlalian
Keyword(s):  
Standard Model ◽  
Random Oracle Model ◽  
Personal Communication ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Research Literature ◽  
Public Key ◽  
Certificateless Public Key Cryptography ◽  
The Standard Model ◽  
Wireless Personal Communications

Abstract Certificateless public key cryptography (CL-PKC) promises a practical resolution in establishing practical schemes, since it addresses two fundamental issues, namely the necessity of requiring certificate managements in traditional public key infrastructure (PKI) and the key escrow problem in identity-based (ID-based) setting concurrently. Signcryption is an important primitive that provides the goals of both encryption and signature schemes as it is more efficient than encrypting and signing messages consecutively. Since the concept of certificateless signcryption (CL-SC) scheme was put forth by Barbosa and Farshim in 2008, many schemes have been proposed where most of them are provable in the random oracle model (ROM) and only a few number of them are provable in the standard model. Very recently, Luo and Wan (Wireless Personal Communication, 2018) proposed a very efficient CL-SC scheme in the standard model. Furthermore, they claimed that their scheme is not only more efficient than the previously proposed schemes in the standard model, but also it is the only scheme which benefits from known session-specific temporary information security (KSSTIS). Therefore, this scheme would indeed be very practical. The contributions of this paper are 2-fold. First, in contrast to the claim made by Luo and Wan, we show that unfortunately Luo and Wan made a significant error in the construction of their proposed scheme. While their main intention is indeed interesting and useful, the failure of their construction has indeed left a gap in the research literature. Hence, the second contribution of this paper is to fill this gap by proposing a CL-SC scheme with KSSTIS, which is provably secure in the standard model.

scholarly journals Strongly Unforgeable Certificateless Signature Resisting Attacks from Malicious-But-Passive KGC

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Wenjie Yang ◽  
Jian Weng ◽  
Weiqi Luo ◽  
Anjia Yang
Keyword(s):  
Standard Model ◽  
Digital Signature ◽  
Theory And Practice ◽  
Key Generation ◽  
Random Oracles ◽  
The Standard Model ◽  
Certificateless Signature ◽  
Adversarial Model ◽  
Strong Unforgeability

In digital signature, strong unforgeability requires that an attacker cannot forge a new signature on any previously signed/new messages, which is attractive in both theory and practice. Recently, a strongly unforgeable certificateless signature (CLS) scheme without random oracles was presented. In this paper, we firstly show that the scheme fails to achieve strong unforgeability by forging a new signature on a previously signed message under its adversarial model. Then, we point out that the scheme is also vulnerable to the malicious-but-passive key generation center (MKGC) attacks. Finally, we propose an improved strongly unforgeable CLS scheme in the standard model. The improved scheme not only meets the requirement of strong unforgeability but also withstands the MKGC attacks. To the best of our knowledge, we are the first to prove a CLS scheme to be strongly unforgeable against the MKGC attacks without using random oracles.

scholarly journals A Short Server-Aided Certificateless Aggregate Multisignature Scheme in the Standard Model

2019 ◽  
Vol 2019 ◽  
pp. 1-14 ◽  
Author(s):  
Viet Cuong Trinh
Keyword(s):  
Standard Model ◽  
Public Key Cryptography ◽  
Public Key ◽  
Constant Size ◽  
Aggregate Signature ◽  
Diffie Hellman ◽  
Combination Scheme ◽  
The Standard Model ◽  
Identity Based ◽  
Short Signature

Aggregate signature scheme allows each signer to sign a different message and then all those signatures are aggregated into a single short signature. In contrast, multisignature scheme allows multisigners to jointly sign only one message. Aggregate multisignature scheme is a combination of both aforementioned signature schemes, where signers can choose to generate either a multisignature or an aggregate signature. This combination scheme has many concrete application scenarios such as Bitcoin blockchain, Healthcare, Multicast Acknowledgment Aggregation, and so on. On the other hand, to deal with the problems of expensive certificates in certified public key cryptography and key escrow in identity-based cryptography, the notion of certificateless public key cryptography has been introduced by Riyami and Paterson at Asiacrypt’03. In this paper, we propose the first certificateless aggregate multisignature scheme that achieves the constant-size of signature and is secure in the standard model under a generalization of the Diffie-Hellman exponent assumption. In our scheme, however, the signature is generated with the help of the authority.

On the Security of a Certificateless Signature Scheme

2014 ◽  
Vol 519-520 ◽  
pp. 965-968
Author(s):  
Lin Cheng ◽  
Qiao Yan Wen
Keyword(s):  
System Parameter ◽  
Public Key Cryptography ◽  
Public Key Infrastructure ◽  
Public Key ◽  
Signature Scheme ◽  
System Parameters ◽  
Certificateless Public Key Cryptography ◽  
The Standard Model ◽  
Identity Based ◽  
Certificateless Signature

Certificateless public key cryptography eliminates inherent key escrow problem in identity-based cryptography, and does not yet requires certificates as in the traditional public key infrastructure. Recently, Yu et al. propose a new certificateless signature scheme and their scheme offers shorter system parameters and higher computational efficiency than the previous schemes in the standard model. However, in this paper, we show Yu et al.'s certificateless signature scheme is vulnerable to malicious-but-passive KGC attack where a malicious KGC can forge valid signatures by embedding extra trapdoors in the system parameter.

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

Proxy Multi-Signature Scheme in the Standard Model

2012 ◽  
Vol 433-440 ◽  
pp. 2077-2085
Author(s):  
Hai Wei Fan ◽  
Yang Ming
Keyword(s):  
Standard Model ◽  
Security Model ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
The Standard Model ◽  
Provably Secure

Design of proxy multi-signature scheme that is efficient and provably secure in the standard model is suitable for applications. In this paper, we present a formal security model for proxy multi-signature schemes. We also firstly propose a concrete proxy multi-signature scheme based on Waters signature scheme in the standard model. The proposed scheme is proved secure under the computational Diffie-Hellman assumption.

Sign in / Sign up

Export Citation Format

Share Document