为抵抗CL-PKE加密体制中因置换用户公钥产生的拒绝解密(denial of decryption)攻击,构建了一个没有使用椭圆曲线上双线性对运算的加密算法.该体制的安全模型选用了安全性较高的标准模型.此外该体制不但可以抵制外部攻击者的拒绝解密攻击...为抵抗CL-PKE加密体制中因置换用户公钥产生的拒绝解密(denial of decryption)攻击,构建了一个没有使用椭圆曲线上双线性对运算的加密算法.该体制的安全模型选用了安全性较高的标准模型.此外该体制不但可以抵制外部攻击者的拒绝解密攻击,而且可以抵制密钥生成中心(KGC)的拒绝解密攻击.在提高性能的同时,还保持了较高的计算效率.展开更多
Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents.It offers a perfect cryptographic solution to encrypted data retrieval in ...Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents.It offers a perfect cryptographic solution to encrypted data retrieval in encrypted data storage systems.Certificateless cryptography(CLC)is a novel cryptographic primitive that has many merits.It overcomes the key escrow problem in identity-based cryptosystems and the cumbersome certificate problem in conventional public key cryptosystems.Motivated by the appealing features of CLC,three certificateless encryption with keyword search(CLEKS)schemes were presented in the literature.However,all of them were constructed with the costly bilinear pairing and thus are not suitable for the devices that have limited computing resources and battery power.So,it is interesting and worthwhile to design a CLEKS scheme without using bilinear pairing.In this study,we put forward a pairing-free CLEKS scheme that does not exploit bilinear pairing.We strictly prove that the scheme achieves keyword ciphertext indistinguishability against adaptive chosen-keyword attacks under the complexity assumption of the computational Diffie-Hellman problem in the random oracle model.Efficiency comparison and the simulation show that it enjoys better performance than the previous pairing-based CLEKS schemes.In addition,we briefly introduce three extensions of the proposed CLEKS scheme.展开更多
文摘为抵抗CL-PKE加密体制中因置换用户公钥产生的拒绝解密(denial of decryption)攻击,构建了一个没有使用椭圆曲线上双线性对运算的加密算法.该体制的安全模型选用了安全性较高的标准模型.此外该体制不但可以抵制外部攻击者的拒绝解密攻击,而且可以抵制密钥生成中心(KGC)的拒绝解密攻击.在提高性能的同时,还保持了较高的计算效率.
基金Project supported by the National Natural Science Foundation of China(Nos.61772009 and U1736112)the Fundamental Research Funds for the Central Universities,China(Nos.2016B10114 and 2017B17014)the Natural Science Foundation of Jiangsu Province,China(No.BK20181304)
文摘Searchable public key encryption enables a storage server to retrieve the publicly encrypted data without revealing the original data contents.It offers a perfect cryptographic solution to encrypted data retrieval in encrypted data storage systems.Certificateless cryptography(CLC)is a novel cryptographic primitive that has many merits.It overcomes the key escrow problem in identity-based cryptosystems and the cumbersome certificate problem in conventional public key cryptosystems.Motivated by the appealing features of CLC,three certificateless encryption with keyword search(CLEKS)schemes were presented in the literature.However,all of them were constructed with the costly bilinear pairing and thus are not suitable for the devices that have limited computing resources and battery power.So,it is interesting and worthwhile to design a CLEKS scheme without using bilinear pairing.In this study,we put forward a pairing-free CLEKS scheme that does not exploit bilinear pairing.We strictly prove that the scheme achieves keyword ciphertext indistinguishability against adaptive chosen-keyword attacks under the complexity assumption of the computational Diffie-Hellman problem in the random oracle model.Efficiency comparison and the simulation show that it enjoys better performance than the previous pairing-based CLEKS schemes.In addition,we briefly introduce three extensions of the proposed CLEKS scheme.
