A certificateless threshold public key encryption scheme

The decryption participant’s private key share for decryption is delegated by key generation center in the threshold IBE scheme.However,a key generation center which is absolutely trustworthy does not exist.So the author presents a certificateless threshold public key encryption scheme.Collaborating with an administrator,the decryption participant generates his whole private key share for decryption in the scheme.The administrator does not know the decryption participant’s private key share for decryption.Making use of q-SDH assumption,the author constructs a certificateless threshold public key encryption scheme.The security of the scheme is eventually reduced to the solving of Decisional Bilinear Diffie-Hellman problem.Moreover,the scheme is secure under the chosen ciphertext attack in the standard model.     

一个CCA安全的基于身份的门限加密方案

提出一个非交互的基于身份的门限加密方案,该方案在随机预言器模型下可证明是CCA安全的.首先利用一个简单的提高安全性的方法,得到一个将一般的基于身份加密方案的安全性从CPA提高至CCA的通用方法,接着运用该转化方法,构造了一个CCA安全的基于身份的门限加密方案实例且密文的传输效率较之前的方法有大幅提高.     

标准模型下高效的基于身份的加密方案

基于身份的加密是一类很重要的公钥加密.给出了一个高效的基于身份的加密方案,提出的方案在标准模型下是针对选择密文攻击完全安全的,并运用线性无关的思路基于q-ABDHE假设证明了方案的安全性.方案具有高效性、公钥参数较短及配对计算较少的特点.     

基于身份的接收门限环签密方案

签密能够以较低的通信成本同时完成认证和加密2种功能.为了同时实现匿名加密、认证和门限解密3种功能,提出了基于身份的接收门限环签密方案,并在随机预言模型下证明了其安全性.在这个方案中,任何人能任意选择n-1个成员,加上他自己构成一个群.然后代表这个群生成一个签密,把密文发送给特定m个人,只有至少其中t≤m个人合作才能恢复消息.本案在签密阶段只需要1次双线性对计算,解签密阶段也只需要3次双线性对计算.     

An Inner Product Encryption Scheme Based on Dual Systems

The inner product encryption scheme can achieve fine-grained access control on ciphertext. For the problem that the existing inner product encryption scheme has poor security and low decryption efficiency, this paper proposes an inner product encryption scheme with adaptive security based on the dual system encryption method. The scheme is based on bilinear mapping on prime order groups. In the secret key generation algorithm of the scheme, we propose a sharing technique of random vectors and generate a secret key for each component of the attribute vector. And an encryption algorithm with a constant size ciphertext is designed. Under the k-Lin assumption, the method of the experimental sequence is used to prove that the scheme is adaptively secure. The decryption algorithm of the scheme requires only six bilinear pairs. Compared with the existing schemes, the decryption efficiency has been greatly improved.     

Secure proxy re-encryption from CBE to IBE

In this paper, an efficient hybrid proxy re-encryption scheme that allows the transformation of the ciphertexts in a traditional public key cryptosystem into the ciphertexts in an identity-based system is proposed. The scheme is non-interactive, unidirectional and collude ＂safe＂. Furthermore, it is compatible with current IBE （identity-based encryption） deployments. The scheme has chosen ciphertext security in the random oracle model assuming the hardness of the Decisional Bilinear Diffie-Hellman problem.     

A Practical Approach to Attaining Chosen Ciphertext Security

Strong security in public key cryptography is not enongh; the encryption has to be achieved in an efficient way. OAEP or SAEP is only suitable for special applications （e. g. key transport）, and securely transporting message of any length is a challenge. Motivated by the hybrid encryption, we present a practical approach to achieve the （adaptively） chosen eiphertext security. The time cost of encryption/decryption of proposed scheme is similar to OAEP and the bandwidth of message recovery is 92% for standard security parameter, while RSA-OAEP is 84%. The scheme is also provably secure against adaptively chosen ciphertext attacks in the random oracle model. We conclude that the approach is practical in more extensive application.     

基于IBE算法的无线传感器网络加密方法研究

由于无线传感器网络在电源、计算能力、内存容量和易受攻击等方面的局限性,传统的网络密钥分配和管理方法已不适用.目前人们提出了随机分配等基于对称密钥系统的加密方法.文中试图探讨基于非对称密钥系统的方法.从身份标识的密钥体系IBE(Identity-Based Encryption)出发,给出了一种适用于无线传感器网络的密钥分配和管理方法.首先简要介绍基于身份标识的密钥体系,特别是Boneh-Franklin算法,然后给出密钥分配和加密方法,并从算法的复杂性、安全性、健壮性和内存需求等方面,与随机算法、RAS算法等进行分析比较,应用仿真平台TinyOS的实验结果表明了文中推出方法的可行性和有效性,显示了良好的综合性能,为无线传感器网络的加密提供了新的手段.     

An efficient identity-based anonymous signcryption scheme

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step more efficiently than sign-then-encrypt approach. Till now, various kinds of signcryption schemes have been proposed. Among them, the requirement of signcrypter＇s privacy protection is needful in some practical applications. In this paper, a new identity-based anonymous signcryption scheme from hilinear pairings, which is the organic combination of identity-based ring signature and encryption scheme, is proposed. The proposed scheme is indistinguishable against the chosen ciphertext attack under the Decisional Bilinear Diffie-Hellman assumption in the random oracle model. Its unforgeability relies on the computational Diffieellman problem. Compared with the previous schemes, the new scheme is more efficient in computation.     

可验证外包数据访问控制方案的分析与改进

在双系统模型中,基于密钥封装机制,提出一个可验证的外包加密、解密方案。将计算量大的运算外包给加密服务提供者(ESP)和解密服务提供商(DSP),减少本地用户的计算量。同时引入防陷害功能;即若DSP返回正确结果,用户不能恶意指责DSP返回的结果为不正确;这可以有效解决用户和外包计算服务提供商之间的争议,服务提供者也将不会恶意给出错误的结果。提出的外包密钥生成算法,使得用户只进行一次指数运算,提高了转换密钥的生成效率。与同类的方案相比,本方案实现了细粒度的访问控制,增加了方案在实际应用中的可行性。     

云计算环境中基于属性的多权威访问控制方法

在云计算环境中,如何实现在不可信及动态变化的云计算环境中对加密数据的访问控制是云计算走向实际应用亟待解决的问题之一.文中提出了一种基于属性的访问控制方法,该方法将密文长度及加解密过程的计算量限制为固定值,提高了系统的计算效率,并且引入了层次化的授权结构,降低了单一权威授权的负担,提高了安全性.文中分析了方法的安全性、可扩展性和计算复杂性等性能,实验结果证明了该方法在域权威授权、用户授权及加解密等过程中的计算量上的优越性.     

完全安全匿名的身份型广播加密方案

针对现有的广播加密方案效率与安全性难以兼顾的事实,利用Waters双系统密码技术及混合阶群双线性运算的正交性,提出了一个双系统密码技术下的公钥匿名的身份型广播加密方案.该方案建立在标准模型下,具有尺寸固定的短的密文与密钥,更无需使用任何哈希函数及随机标签,具有较高的计算效率与存储效率,其安全性依赖于3个简单的静态假设.证明结果显示,所提出的方案达到了匿名性及完全安全性的高安全级别要求.     

混合云模式下数据安全存储方案

针对混合云模式下数据安全存储与共享使用的问题,提出一种适用于混合云模式下的高效数据安全共享方案,该方案采用密文策略的属性基加密机制加密数据,通过私有云将密文数据存储在公有云上;移动用户访问云数据时,采用匿名密钥协商技术和委托加解密方法,保证用户对数据的快速访问.实验结果表明,本方案能够保证公有云上数据的安全存储,支持细粒度的访问控制,同时将大部分解密计算委托给私有云,减少移动云用户访问云数据的处理时间,使得其加解密时间为恒定值,不会随着属性的增多而线性增长.      

支持撤销的多授权中心访问控制方案

为了缓解单授权中心的计算压力,近些年提出了多授权中心的访问控制方案.这些方案对于用户及属性的撤销问题并没有有效地解决.本文提出了一种基于CP-ABE的支持用户和属性撤销的多授权中心访问控制方案.通过引入密钥加密密钥（key encryption key,KEK）树实现用户和属性层级的撤销,同时将计算压力分散给多个授权中心,并将部分解密交给云服务器,减少了用户的计算消耗.通过安全性证明和实验结果表明,方案可以抵御合谋攻击,同时有效地降低撤销过程中密文和密钥更新的消耗时间.￣      

一种基于椭圆曲线的强可验证门限阈下信道方案

基于椭圆曲线离散对数问题,提出一种(t,n)-(k,m)强可验证门限阈下信道方案.该方案中n个阈下子信息拥有者中至少t个合作才能得到阈下信息进而生成有效的签名,而m个接收者中至少k个合作才能提取阈下信息.接收者不需要和发送者共享其私钥.通过采用一种可验证门限秘密共享技术,每个接收者可以对提取的子信息有效性进行验证,同时又可以防止接收者对签名进行联合攻击和广义伪造攻击.     

ECDSA可公开验证广播签密

给出了广播签密的模型与定义,以ECDSA方案为基础,提出了一种可公开验证的广播签密方案ECBSC.方案能向多个用户广播认证单个消息;在不增加系统计算量的前提下,ECBSC还能同时向多个用户广播多个签密消息,用户只能从签密文中提取与自己相应的明文.在协议双方发生争议时,第3方可在ECDSA的模式下公开验证.ECBSC比重复使用SC-BLS的trivial n-recipient方案具有更高的效率,在组播通信中具有广阔的应用前景.     

Information-Theoretic Secure Verifiable Secret Sharing over RSA Modulus

The well-known non-interactive and information-theoretic secure verifiable secret sharing scheme presented by Pedersen is over a large prime. In this paper, we construct a novel non-interactive and information-theoretic verifiable secret sharing over RSA （Rivest, Shamir, Adleman） modulus and give the rigorous security proof. It is shown how to distribute a secret among a group such that any set of k parties get no information about the secret. The presented scheme is generally applied to constructions of secure distributed multiplication and threshold or forward-secure signature protocols.     

可公开验证的秘密分享机制

背包公钥密码体制具有快速加密和解密的优点.利用新的背包算法,提出了一个可公开验证的动态秘密分享方案,该秘密分享方案在保持各成员子秘密不变的情况下可以分享多个秘密,并且每个参与者可以对自己的子秘密及其他成员提供的信息进行验证;不但能有效阻止敌手窃取秘密信息,也能有效地防止内部成员之间的互相欺诈.     

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

门限代理签名是代理签名与门限签名结合产生的签名体制,具有分配代理签名权力和分散代理密钥的优点.无证书密码体制既保持基于身份的密码体制不需要使用公钥证书的优点,又较好解决基于身份公钥体制所固有的密钥托管问题.文章将无证书签名方案和门限代理签名方案结合,提出一个新的无证书门限代理签名方案,新方案具有安全、高效的特性.     

Threshold Decryption Scheme with Multiple Policies

Based on the difficulty in computing discrete logarithm and square root on some special conditions, we propose a basic threshold secret sharing scheme for muhiple secrets with muhiple policies, which allows a group of users to share muhiple secret keys and only one secret shadow to be kept by each user. An efficient threshold decryption scheme with multiple policies is designed on the basis of the basic threshold scheme. This decryption scheme allows muhiple secret keys to be shared among a group of users, and each user to keep only one secret shadow. Different public keys can be used to encrypt documents. If and only if the number of cooperated users who keep the secret shadows is greater than or equal to the threshold value of the corresponding secret key, they can cooperate to decrypt the documents. It is proved that the proposed scheme has very strong security, unless the at tackers can solve the discrete logarithm problem and the square root problem.