Cryptanalysis on Two Certificateless Signature Schemes

Zhang, Futai; Li, Sujuan; Miao, Shihai; Mu, Yi; Susilo, Willy; Huang, Xinyi

doi:10.15837/ijccc.2010.4.2517

Cited by 10 publications

(4 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Inspired by [30,31], a certain controller will sign the message sent to SDN switches using the aux information of other controllers. We define that the message is and the identity of the randomly chosen actual signer is of the identity ID .…”

Section: Sign Phasementioning

confidence: 99%

Cloud Based Data Protection in Anonymously Controlled SDN

Shen

Lai

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

Nowadays, Software Defined Network (SDN) develops rapidly for its novel structure which separates the control plane and the data plane of network devices. Many researchers devoted themselves to the study of such a special network. However, some limitations restrict the development of SDN. On the one hand, the single controller in the conventional model bears all threats, and the corruption of it will result in network paralysis. On the other hand, the data will be increasing more in SDN switches in the data plane, while the storage space of these switches is limited. In order to solve the mentioned issues, we propose two corresponding protocols in this paper. Specifically, one is an anonymous protocol in the control plane, and the other is a verifiable outsourcing protocol in the data plane. The evaluation indicates that our protocol is correct, secure, and efficient.

show abstract

Section: Sign Phasementioning

confidence: 99%

Cloud Based Data Protection in Anonymously Controlled SDN

Shen

Lai

et al. 2018

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…在文献 [37]中,Huang 等人指出了该方案存在的安全缺陷,即它不能抵抗公钥替换攻击.此后,Gorantla 和 Saxena [44] 给出了比文献[3]中方案更高效的方案.同样,由于没有形式化的安全性分析,其方案已被 Cao 等人 [45] 攻破.此外, Harn 等人 [46] 提出了一个无 Pairing 的无证书签名方案,称该方案安全性基于离散对数问题难解性,但并没有给出严格的形式化安全性证明.文献 [58]给出了对两个安全性证明存在较大漏洞的无证书签名方案的攻击.…”

Section: 无安全性证明的方案unclassified

Research on Certificateless Public Key Cryptography

Zhang¹,

Sun²,

Zhang³

et al. 2011

Journal of Software

View full text Add to dashboard Cite

Certificateless public key cryptography (CL-PKC for short) is a new type of public key cryptography, which is developed on the foundation of identity based cryptography (ID-PKC for short). CL-PKC elimilates the key escrow problem and the need for public key certificate. These two advantages are what makes it attractive to the research community and industrial world form the beginning of its birth. It has been a very active research hot topic in the field of cryptology and information security. In about seven years, the study of CL-PKC has advanced step by step, making its theories and techniques more and more enriching. This paper revisits, analyzes, compares, and briefly reviews some of the main results. Furthermore, this study discusses some existing problems in this research field that deserve further investigation.

show abstract

“…In 2011, Wen et al , pointed out a security drawback of the scheme in and proposed a new one, but the signature length of the new scheme linearly increases with the number of signers, resulting a significant verification cost. In 2012, Li et al , put forward a short and efficient scheme, based on schemes in and . Yu et al presented in an aggregate signature without any bilinear pairing operations.…”

Section: Introductionmentioning

confidence: 99%

NCLAS: a novel and efficient certificateless aggregate signature scheme

Nie

Chen

et al. 2016

Security Comm. Networks

View full text Add to dashboard Cite

Aggregate signature algorithms combine n signatures on n different messages from n distinct users into one aggregated signature. The aggregated signature allows the verifier to authenticate the n signatures simultaneously. Because the total signature length and authentication costs are significantly reduced, aggregate signature algorithms are attractive to applications with resource constraints and applications requiring efficient batch authentications. In this paper, we propose a novel aggregate signature scheme based on certificateless‐PKC. Under this novel scheme, the length of the aggregated signature and the pairing computation cost in the aggregate signature verification process are independent of the number of signatures being aggregated. We also prove that the proposed scheme is existentially unforgeable against adaptive chosen‐message and chosen‐identity attacks, based on the hardness assumption of the computational Diffie–Hellman problem. The new scheme will be suitable for resource‐constrained applications. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Cryptanalysis on Two Certificateless Signature Schemes

Cited by 10 publications

References 13 publications

Cloud Based Data Protection in Anonymously Controlled SDN

Cloud Based Data Protection in Anonymously Controlled SDN

Research on Certificateless Public Key Cryptography

NCLAS: a novel and efficient certificateless aggregate signature scheme

Contact Info

Product

Resources

About