Efficient and Provably Secure Multi-Recipient Signcryption from Bilinear Pairings

Signcryption is a cryptographic primitive that performs signature and encryption simultaneously, at lower computational costs and communication overheads than the signature-then- encryption approach. In this paper, we propose an efficient multi-recipient signcryption scheme based on the bilinear pairings, which broadcasts a message to multiple users in a secure and authenticated manner. We prove its semantic security and unforgeability under the Gap Diffie-Hellman problem assumption in the random oracle model. The proposed scheme is more efficient than re-signcrypting a message n times using a signcryption scheme in terms of computational costs and communication overheads.

WiBPA:An Efficient Data Integrity Auditing Scheme Without Bilinear Pairings

The security of cloud data has always been a concern.Cloud server provider may maliciously tamper or delete user’s data for their own benefit,so data integrity audit is of great significance to verify whether data is modified or not.Based on the general three-party audit architecture,a dynamic auditing scheme without bilinear pairings is proposed in this paper.It utilizes exponential operation instead of bilinear mapping to verify the validity of evidence.By establishing the mapping relation between logic index and tag index of data block with index transformation table,our scheme can easily support dynamic data operation.By hiding random numbers in the integrity evidence,our scheme can protect users’privacy information.Detailed security analysis shows that our scheme is secure against attacks such as forgery,replaying and substitution.Further experiments demonstrate that our scheme has lower computational overhead.

A new improved ID-based proxy ring signature scheme from bilinear pairings

Ring signature and proxy signature are of vital importance to secure electronic commerce. Recently, the bilinear pairing such as Well pairing or Tate pairing on elliptic curves and hyperelliptic curves is playing an important role in security solutions. Several ID-based signature schemes have been put forward, many of which are based on bilinear pairings. In key management and moderate security demand scenarios, ID-based public key cryptosystem is more preferable than other public key infrastructure based systems. In this paper, an improved ID-based proxy ring signature scheme from bilinear pairings is proposed which combines the advantages of proxy signature and of ring signatures. Our scheme can guarantee the profits of the proxy signer via preventing the original signer form generating the proxy ring signature. Furthermore, bilinear pairings are introduced to minimize the computation overhead and to improve the related performance of our scheme. In contrast with Zhang＇s scheme, our scheme is a computational efficiency improvement for signature verification because the computational cost of bilinear pairings required is reduced from O（n） to O（ 1 ）. In addition, the proxy ring signature presented in this paper can perfectly satisfy all the security requirements of proxy ring signature, i. e. signer-ambiguity, non-forgeability, verification, non-deniability and distinguishability.

A NEW MULTI-PROXY SIGNATURE FROM BILINEAR PAIRING

Proxy signatures are very useful tools when one needs to delegate his/her signing capability to other parties. In this paper,a new multi-proxy signature scheme is proposed. The new scheme is constructed from bilinear pairings using Boneh,Lynn,and Shacham’s (BLS) short signatures. The proxy key for the proxy group is just a short signature on the proxy warrant generated by the original signer. Due to the use of short signatures,our scheme is not only efficient,but also satisfies all the security requirements of the strong proxy signature.

Identity Based Group Key Agreement from Bilinear Pairing

We present a provably secure authenticated tree based key agreement scheme for multicast. There is a wide variety of applications that can benefit from using our scheme, e. g. , pay-Tv, teleconferencing, software updates. Compared with the previous published schemes, our scheme provides group member authentication without introducing additional mechanism. Future, we give the security proof of our scheme under the random oracle model.

A PROVABLY SECURE PROXY SIGNATURE SCHEME FROM BILINEAR PAIRINGS

A proxy signature allows an entity, called original signer, to delegate its signing power to another entity, called proxy signer, to sign messages on its behalf. Proxy signatures have many practical applications and are very important cryptographic protocol. In this paper, we propose an efficient proxy signature scheme from bilinear pairings. We prove it secure in the random oracle model and analyze computation cost of our scheme. Our scheme satisfies all the properties required for proxy signatures.

New Multisignature Scheme Based on Bilinear Pairings

Two digital multisignature schemes based on bilinear pairings were proposed. One of them is the sequential digital multisignature, and the other is the broadcasting digital multisignature. The scheme has the same security as JI and LIs multisignature scheme, but the new scheme has the lower computation. So the new scheme is the multisignature which has high security and low computation. It has the theory meaning and extensive application under the condition of SmartCard, etc.

Cryptanalysis and improvement of a certificateless signcryption scheme without bilinear pairing

As an improtant cryptographic scheme, signcryption scheme has been widely used in applications since it could provide both of signature and encryption. With the development of the certificateless public key cryptography （CLPKC）, many certificatelss signcryption （CLSC） schemes using bilinear pairing hve been proposed. Comparated other operations, the bilinear pairing operaion is much more compulicated. Therefore, CLSC scheme without bilinear pairing is more suitable for applications. Recently, Jing et al. proposed a CLSC scheme without bilinear pairing and claimed their scheme is secure against two types of adversaries. In this paper, we will show their scheme provide neither unforgeability property nor confidentiality property. To improve security, we also propose a new CLSC scheme without pairing and demonstrate it is provably secure in the random oracle model.

A new threshold proxy signature scheme from bilinear pairings

Based on the GDH signature (short signature scheme) a probabilistic signature scheme is proposed in this paper with security proof.Then a new threshold proxy signature from bilinear pairings is proposed as well by us ing the new probabilistic signature scheme and the properties of the Gap Diffie-Hellman (GDH)group (where the Computational Diffie-Hellman problem is hard but the Decisional Diffie-Hellman problem is easy to solve).Our constructions are based on the recently proposed GDH signature scheme of Bonel et al.s article.Bilinear pairings could be built from Weil pairing or Tate pairing.So most our constructions would be simpler,but still with high security.The proposed threshold proxy signature is the first one which is built from bilinear pairings.At the end of this paper security and performance of the threshold proxy signature scheme is also analyzed.

Research on k-anonymity privacy protection scheme based on bilinear pairings

Aimed at enhancing privacy protection of location-based services（ LBS） in mobile Internet environment,an improved privacy scheme of high service quality on the basis of bilinear pairings theory and k-anonymity is proposed. In circular region of Euclidian distance,mobile terminal evenly generates some false locations,from which half optimal false locations are screened out according to position entropy,location and mapping background information. The anonymity obtains the effective guarantee,so as to realize privacy protection. Through security analyses,the scheme is proved not only to be able to realize such security features as privacy,anonymity and nonforgeability,but also able to resist query tracing attack. And the result of simulation shows that this scheme not only has better evenness in selecting false locations,but also improves efficiency in generating and selecting false nodes.

Efficient identity-based threshold decryption scheme from bilinear pairings

Using Shamir＇s secret sharing scheme to indi- rectly share the identity-based private key in the form of a pairing group element, we propose an efficient identity-based threshold decryption scheme from pairings and prove its se- curity in the random oracle model. This new paring-based scheme features a few improvements compared with other schemes in the literature. The two most noticeable features are its efficiency, by drastically reducing the number of pair- ing computations, and the ability it gives the user to share the identity-based private key without requiring any access to a private key generator. With the ability it gives the user to share the identity-based private key, our ID-based threshold decryption （IBTD） scheme, the second of its kind, is signif- icantly more efficient than the first scheme, which was de- veloped by Baek and Zheng, at the expense of a slightly in- creased ciphertext length. In fact, our IBTD scheme tries to use as few bilinear pairings as possible, especially without depending on the suite of Baek-Zheng secret sharing tools based on pairings.

Conditional privacy protection authentication scheme based on bilinear pairings for VANET

To solve the problem of security and efficiency of anonymous authentication in the vehicle Ad-hoc network(VANET), a conditional privacy protection authentication scheme for vehicular networks is proposed based on bilinear pairings. In this scheme, the tamper-proof device in the roadside unit(RSU) is used to complete the message signature and authentication process together with the vehicle, which makes it more secure to communicate between RSU and trusted authority(TA) and faster to update system parameters and revoke the vehicle. And this is also cheaper than installing tamper-proof devices in each vehicle unit. Moreover, the scheme provide provable security proof under random oracle model(ROM), which shows that the proposed scheme can meet the security requirements such as conditional privacy, unforgeability, traceability, etc. And the results of simulation experiment demonstrate that this scheme not only of achieves high efficiency, but also has low message loss rate.

基于匿名批量认证和会话密钥交互的安全协议

由于以无线方式完成车间通信和车与路边设施通信,车联网易遭受多类安全攻击。为此,提出基于批量匿名认证和会话密钥交互的安全协议(ABKS)。ABKS协议采用匿名相互认证策略,提高车间通信的安全性。同时,ABKS协议采用批量认证策略,降低路边设施的认证负担。此外,ABKS协议维护消息的完整性,避免了消息在传输过程中被篡改。性能分析表明,提出的ABKS协议能够防御潜在的攻击。相比于同类协议,ABKS协议降低了算法的复杂度。

Efficient Certificateless Authenticated Key Agreement Protocol from Pairings

In the area of secure Web information system, mutual authentication and key agreement are essential between Web clients and servers. An efficient certificateless authenticated key agreement protocol for Web client/server setting is proposed, which uses pairings on certain elliptic curves. We show that the newly proposed key agreement protocol is practical and of great efficiency, meanwhile, it satisfies every desired security require ments for key agreement protocols.

NEW ID-BASED GROUP SIGNATURE FROM PAIRINGS

We argue that traditional identity-based systems from pairings seem unsuitable for designing group signature schemes due to the problem of key escrow. In this paper we first propose new ID-based public key systems without trusted PKG (Private Key Generator) from bilinear pairings. In our new ID-based systems, if the dishonest PKG impersonates an honest user to communicate with others, the user can provide a proof of treachery of the PKG afterwards, which is similar to certificate-based systems. Therefore, our systems reach the Girault’s trusted level 3. We then propose a group signature scheme under the new ID-based systems, the security and performance of which rely on the new systems. The size of the group public key and the length of the signature are independent on the numbers of the group.

基于合数阶双线性群的多用户陷门不可区分可搜索加密方案

可搜索加密是云存储环境下密文检索的主要技术。针对以去除安全信道构造的公共密钥可搜索加密方案SCF-PEKS加密时依赖用户公钥导致搜索服务限于单一用户,及无安全信道的可搜索加密方式容易遭受外部敌手的关键字猜测攻击等问题,分析并证明了现有多用户可搜索加密方案存在关键字陷门易遭受攻击的安全缺陷,在使用合数阶双线性对基础上提出一种多用户可搜索加密方案,并基于判定性子群假设和DBDH假设证明论文算法满足关键字陷门不可区分性的安全要求,可以抵御外部敌手选择关键字攻击。对比文献分析显示,在没有明显增加计算复杂度的前提下,提出的加密方案陷门尺寸及密文尺寸良好、安全性更高。

基于商密SM9算法同态加密方案

同态加密(homomorphic encryption,HE)被认为是隐私保护应用中最重要的密码技术之一.SM9算法是我国发布的商用密码算法标准,但SM9算法并不满足同态的属性.以SM9的算法为基础,设计一种基于PKI体制且具有同态性质的加密方案,使得新设计的算法同时具备加法和乘法同态性质,即满足任意次密文加法运算和1次密文乘法运算,且密文经过乘法运算后仍然满足加法同态性质以及标量乘,适合2次多项式的隐私计算.该方案具备选择明文攻击(IND-CPA)安全性.

基于pairings的自认证多接收者代理签密方案

结合代理签密和自认证签密的理论,构造了一个基于pairings的自认证多接收者代理签密方案.由于用户公钥具有自认证性,无需权威机构签发证书,同时用户私钥也只有自己知道,因此,与已有文献相比,此方案具有很好的安全性和实用性.

一种新的基于身份的代理多重盲签名方案

代理签名是解决签名权利委托的一种方案,代理签名可以结合其他特殊的签名方案生成一些新的代理签名方案.代理多重签名可以解决一个签名人代替多个原始签名人签名的问题,盲签名用于隐藏原始消息.结合代理多重签名和盲签名的特性,从双线性对的角度提出一种基于身份的代理多重盲签名方案,私钥生成器利用每个签名人本人身份生成不同的密钥.通过对方案的安全性分析,发现该方案可以抵抗原始签名者内部攻击,防止代理签名权的滥用,具有不可伪造性、不可否认性、不可链接性、盲性和计算效率高的特点.

Authenticated Privacy Preserving Pairing-Based Scheme for Remote Health Monitoring Systems

The digitization of patient health information has brought many benefits and challenges for both the patients and physicians. However, security and privacy preservation have remained important challenges for remote health monitoring systems. Since a patient’s health information is sensitive and the communication channel (i.e. the Internet) is insecure, it is important to protect them against unauthorized entities. Otherwise, failure to do so will not only lead to compromise of a patient’s privacy, but will also put his/her life at risk. How to provide for confidentiality, patient anonymity and un-traceability, access control to a patient’s health information and even key exchange between a patient and her physician are critical issues that need to be addressed if a wider adoption of remote health monitoring systems is to be realized. This paper proposes an authenticated privacy preserving pairing-based scheme for remote health monitoring systems. The scheme is based on the concepts of bilinear paring, identity-based cryptography and non-interactive identity-based key agreement protocol. The scheme also incorporates an efficient batch signature verification scheme to reduce computation cost during multiple simultaneous signature verifications.