Simulatability and security of certificateless threshold signatures

We analyze the relationship between the notion of certificateless public key cryptography (CL-PKC) and identity-based schemes without a trusted private key generator (PKG), formally define the security of certificateless threshold signatures, and propose a concrete implementation based on bilinear pairings. To exhibit the security of our proposal, we develop the theory of simulatability and relationship between the certificateless threshold signatures and the underlying (non-threshold) ID-based signatures. We show that the proposed scheme is robust and existentially unforgeable against adaptively chosen message attacks under CDH assumption in the random oracle model.     

一类无证书签名方案的构造方法

无证书密码体制(CL-PKC)是一类新型公钥密码体制.它保持了基于身份的密码体制(ID-PKC)不需要使用公钥证书的优点,又较好地解决了基于身份的公钥体制所固有的密钥托管问题.对无证书体制下安全高效的签名方案的设计方法的研究是受到高度关注的研究课题.文中给出了一类无证书签名方案的构造方法,并在一个很强的安全模型下对用该方法所构造的方案的安全性进行了证明.文中对新构造的方案与已有的一些同类方案的性能进行了比较.结果显示新方案在整体性能上有一定的优势.     

Delegation of signing rights using certificateless proxy signatures

A proxy signature scheme allows a proxy signer to sign messages on behalf of an original signer within a given context. It has lots of practical applications in distributed systems, grid computing, mobile agent applications, distributed shared object systems, global distribution networks, and mobile communications. In the last years, fruitful achievements have been seen in certificateless public key cryptography which has the advantages of no certificate management and no key escrow compared with traditional public key cryptography and identity-based public key cryptography respectively. However, the existing certificateless proxy signature schemes is either insecure or without formal security analysis. In this paper, we formalize the security model of certificateless proxy signature schemes and propose a provably secure certificateless proxy signature scheme with formal security proof under the computational Diffie–Hellman assumption.     

A new provably secure certificateless short signature scheme

Certificateless public key cryptography simplifies the complex certificate management in the traditional public key cryptography and resolves the key escrow problem in identity-based cryptography. In 2007, Huang et al. revisited the security models of certificateless signature scheme. They classified adversaries according to their attack power into normal, strong, and super adversaries (ordered by their attack power). Recently, Du and Wen proposed a short certificateless signature scheme and presented that their scheme is secure against the strong adversary in the random oracle model. In this paper, we show that their short signature scheme is insecure against the strong adversary. We then propose a new short certificateless signature scheme which is secure against the super adversary. Our scheme is the first certificateless signature scheme which satisfies both the strongest security level and the shortest signature length.     

一种新的无证书的代理环签名方案

在不失基于身份的公钥体制密钥管理简单的前提下,无证书公钥密码体制克服了其所固有的密钥托管缺陷,简化了传统公钥体制负担过重的密钥管理问题。鉴于无证书密码体制的优点,结合代理签名和环签名的优点,提出了一种新的高效的无证书的代理环签名方案。该方案没有密钥的托管问题,也不需要管理证书,并且满足代理环签名方案所有的安全性要求。与现有方案相比,新方案的有效性显著提高。     

Efficient and short certificateless signatures secure against realistic adversaries

The notion of certificateless cryptography is aimed to eliminate the use of certificates in traditional public key cryptography and also to solve the key-escrow problem in identity-based cryptography. Many kinds of security models have been designed for certificateless cryptography and many new schemes have been introduced based on the correspondence of the security models. In generally speaking, a stronger security model can ensure a certificateless cryptosystem with a higher security level, but a realistic model can lead to a more efficient scheme. In this paper, we focus on the efficiency of a certificateless signature (CLS) scheme and introduce an efficient CLS scheme with short signature size. On one hand, the security of the scheme is based on a realistic model. In this model, an adversary is not allowed to get any valid signature under false public keys. On the other hand, 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. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely the modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power.     

标准模型下的无证书代理环签名方案

由于无证书公钥密码体制是一种新型公钥密码体制,它既克服了密钥托管问题,又不需要使用公钥证书,而在标准模型下所构造的方案与在随机语言模型下所构造的方案相比,具有更高的可证安全性,因此,该文在标准模型下,提出了一个无证书代理环签名方案。与现有的代理环签名方案相比,它具有更高的执行效率和可证安全性,能够归约于CDH（computational diffie-Hellman）问题假定。分析结果表明：它既能有效抵制来自密钥生成中心和授权人的伪造攻击,又能满足代理环签名的其他安全性需求;并且,该方案具有更高的执行效率,只需要两次对运算。     

Efficient many-to-one authentication with certificateless aggregate signatures

Aggregate signatures allow an efficient algorithm to aggregate n signatures of n distinct messages from n different users into one single signature. The resulting aggregate signature can convince a verifier that the n users did indeed sign the n messages. This feature is very attractive for authentications in bandwidth-limited applications such as reverse multicasts and senor networks. Certificateless public key cryptography enables a similar functionality of public key infrastructure (PKI) and identity (ID) based cryptography without suffering from complicated certificate management in PKI or secret key escrow problem in ID-based cryptography. In this paper, we present a new efficient certificateless aggregate signature scheme which has the advantages of both aggregate signatures and certificateless cryptography. The scheme is proven existentially unforgeable against adaptive chosen-message attacks under the standard computational Diffie–Hellman assumption. Our scheme is also very efficient in both communication and computation and the proposal is practical for many-to-one authentication.     

Certificateless Threshold Ring Signature

We propose a t-out-of-n Certificateless Threshold Ring Signature (CL-TRS) scheme and prove its security under a new and stronger set of security models. The models capture a new adversarial capability called User Partial Key Replacement Attack, which has been considered practical and realistic but has never been formalized before. The new scheme requires only a constant number of bilinear pairing operations for signature verification. It also has a compact signature size which is linear to the number of non-signers (i.e. n − t) rather than that of actual signers. We also propose a 1-out-of-n CL-TRS (i.e. a certificateless ring signature scheme) which has the most efficient verification among all the certificateless ring signature schemes currently known.     

基于SM2的无证书加密算法

无证书密码系统中无需证书来管理公钥,同时没有标识密码系统中的密钥委托功能.本文描述一种基于SM2加密算法构造的无证书加密算法,并在随机谕示和代数群模型下证明其安全性可以规约到Gap-Diffie-Hellman复杂性假设.因此构造的算法具有可证明安全性,并可基于已有SM2算法部件快速部署等优势.采用该算法的密码系统具有简洁的密钥管理、高效的算法实现,非常适合物联网等需要轻量级公钥算法的应用场景.     

一类高效的无证书代理盲签名方案

已有的代理盲签名方案主要是基于传统公钥密码系统(PKI)以及基于身份的公钥密码系统(ID-PKC)提出的,它们分别存在看证书存储、管理以及密钥托管等问题.为避免上述问题,在无证书公钥密码系统上利用双线性对的知识提出了一种高效的无证书代理盲签名方案,该方案不仅具有较高的效率,满足代理盲签名要求的所有性质,而且克服了它们所...     

新的无证书的代理签名方案

已有的代理签名方案,大多是基于证书的密码体制或者基于身份的密码体制提出的,都存在证书的管理问题或密钥的托管问题。基于无证书密码体制的优点,在无证书公钥密码体制的基础上提出了一种新的代理签名方案。分析表明, 该方案不需要证书的管理,也没有密钥的托管问题,满足代理签名所要求的所有性质,且在效率上优于已有的基于身份的代理签名方案。     

部分盲签名综述

首先叙述了部分盲签名在传统公钥密码体制下的研究现状,并介绍了一个有代表性的部分盲签名方案;然后叙述了部分盲签名在基于身份的密码体制下的研究进展,同时介绍了一个典型的基于身份的部分盲签名方案;随后叙述了部分盲签名在无证书公钥密码体制下的研究现状,介绍了一个有代表性的无证书部分盲签名方案;最后说明了部分盲签名目前存在的问题,并指出了下一步的研究方向。     

A novel efficient (t, n) threshold proxy signature scheme

All previously proposed threshold proxy signature schemes have been based on discrete logarithms required for a protocol to generate and verify a shared secret among the proxy group. Therefore, it is necessary for the proxy signers to perform many expensive modular exponential computations and communications to obtain and verify a shared secret. Moreover, most of the existing threshold proxy signature schemes reveal that the receiver cannot find out who signed the proxy signatures. We propose an efficient (t, n) threshold proxy signature scheme based on Schnorr’s scheme. Compared with existing (t, n) threshold proxy signature schemes, our scheme can reduce the amount of computations and communications. In our method, not only the original signer can know who generated the proxy signature, but also the receiver can certify the actuality of the group signers who made the proxy signature. We offer convenience and fair distribution of auditing a document’s signers.     

An efficient certificateless undeniable signature scheme

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 put forth by Duan. The proposed scheme can be considered as the certificateless version of the identity-based undeniable signature scheme which was introduced by Libert and Quisquater. In this paper, we propose a new scheme which is much more efficient comparing to Duan's scheme. Our scheme requires only one pairing evaluation for signature generation and provides more efficient confirmation and disavowal protocols for both the signer and the verifier. We also prove the security of our scheme in the strong security model based on the intractability of some well-known pairing-based assumptions in the random oracle model.     

Certificateless multi-proxy signature

Multi-proxy signature is a scheme that an original signer authorizes a proxy group as his proxy agent and later only the cooperation of all proxy signers in the proxy group could sign messages on behalf of the original signer. To our best knowledge, most of the existing multi-proxy signature schemes are proposed in public key infrastructure or identity-based setting. However, due to avoiding the inherent escrow problem of identity-based cryptography and yet not requiring certificates to guarantee the authenticity of public keys, certificateless public key cryptography has become an attractive paradigm on which many cryptographical primitives are based. In this paper, a generic construction and a formal security model of certificateless multi-proxy signature (CLMPS) are firstly defined. A concrete CLMPS scheme is also proposed, which is proven to be existentially unforgeable against adaptively chosen warrant attacks and chosen message and identity attacks in the random oracle model under the computational Diffie-Hellman assumption.     

基于RSA的无证书广播多重代理签名方案

由于无证书密码体制可以避免证书管理和密钥托管问题,近年来成为密码学界研究的热点之一,很多无证书代理签名方案（CLPS）被提出。针对目前很多无证书代理签名方案都是基于双线性对设计的,具有效率低和应用中实现困难的问题,本文提出一种基于RSA的无证书广播多重代理签名方案。基于RSA问题,分析了方案的安全性,与已有方案的效率相比,新方案的效率更高。      

Certificateless signature scheme with security enhanced in the standard model

Certificateless cryptography is an attractive paradigm, which combines the advantages of identity-based cryptography (without certificate) and traditional public key cryptography (no escrow). Recently, to solve the drawbacks of the existing certificateless signature (CL-S) schemes without random oracles, Yu et al. proposed a new CL-S scheme, which possesses several merits including shorter system parameters and higher computational efficiency than the previous schemes. However, in this work, we will point out that their CL-S scheme is insecure against key replacement attack and malicious-but-passive KGC attack. We further propose an improved scheme that overcomes the security flaws without affecting the merits of the original scheme. We prove that our scheme is existentially unforgeable against adaptive chosen message attacks under the computational Diffie–Hellman assumption in the standard model.     

Lattice-based certificateless encryption scheme

Certificateless public key cryptography (CL-PKC) can solve the problems of certificate management in a public key infrastructure (PKI) and of key escrows in identity-based public key cryptography (ID-PKC). In CL-PKC, the key generation center (KGC) does not know the private keys of all users, and their public keys need not be certificated by certification authority (CA). At present, however, most certificateless encryption schemes are based on large integer factorization and discrete logarithms that are not secure in a quantum environment and the computation complexity is high. To solve these problems, we propose a new certificate-less encryption scheme based on lattices, more precisely, using the hardness of the learning with errors (LWE) problem. Compared with schemes based on large integer factorization and discrete logarithms, the most operations are matrixvector multiplication and inner products in our scheme, our approach has lower computation complexity. Our scheme can be proven to be indistinguishability chosen ciphertext attacks (IND-CPA) secure in the random oracle model.     

一个新的无证书的门限代理签名方案

结合无证书的密码体制,提出一个新的无证书的门限代理签名方案。经分析表明,方案满足代理签名的安全要求,具有强不可伪造性、强不可否认性、强可识别性、可区分性、防止滥用等性质,且门限值由原始签名人确定,还能抵抗鲁荣波等人提出的攻击。