基于BDH问题的支持多服务器连接关键词可搜索加密方案

doi:10.11959/j.issn.1000-0801.2020049

Telecommunications Science ›› 2020, Vol. 36 ›› Issue (2): 13-23.doi: 10.11959/j.issn.1000-0801.2020049

• Research and Development • Previous Articles Next Articles

Multi-server conjunctive keyword searchable encryption scheme based on BDH problem

Yanhua LU^1,^2,⁴,Youliang TIAN^2,^3,⁴,Chen LIU^2,^3,⁴

¹ College of Mathematics ＆Statistics,Guizhou University,Guiyang 550025,China
² Guizhou Province Key Laboratory of Public Big Data,Guiyang 550025,China
³ College of Computer Science ＆Technology,Guizhou University,Guiyang 550025,China
⁴ Institute of Cryptography ＆Data Security,Guizhou University,Guiyang 550025,China

Revised:2019-12-22 Online:2020-02-20 Published:2020-05-19
Supported by:
The National Natural Science Foundation of China(61662009);Guizhou Provincial Department of Education Science and Technology Top Talent Support Project([2016]060);Science and Technology Major Support Program of Guizhou Province of China(2018300);Science and Technology Program of Guizhou Province of China([2017]5788);Ministry of Education-China Mobile Research Fund Project(MCM20170401);Guizhou University Cultivation Project of China([2017]5788);Key Project Supported by the Joint Fund of the National Natural Science Foundation of China(U1836205);Science and Technology Program of Guizhou Province of China([2019]1098)

Abstract

Abstract:

Searchable encryption is a cryptographic primitive that supports users to search for keywords on ciphertext.In view of the low efficiency of traditional single-server searchable encryption schemes,it was based on the advantages of identity management in certificate management.In the multi-serve environment,a bilinear mapping was used to construct an identity-based encryption scheme that supports conjunctive keyword search.In this scheme,the storage and query of the encrypted data were allocated to different servers,and the retrieval efficiency of the user storage and keyword was improved by cooperation.Re-use the encryption and search ability of the connection keywords by using the identity of multi-server and user.At the same time,combine with the searchable encryption method of conjunctive keyword,a new security model was constructed based on bilinear pairing.And under the bilinear Diffie-Hellman problem,the scheme satisfies the ciphertext indistinguishability under selected message attack.

Key words: multi-server, conjunctive keyword, ID-based encryption, bilinear Diffie-Hellman

CLC Number:

TP309.7

Yanhua LU,Youliang TIAN,Chen LIU. Multi-server conjunctive keyword searchable encryption scheme based on BDH problem[J]. Telecommunications Science, 2020, 36(2): 13-23.

Figures/Tables 3

References 19

[1]	吴国威, 樊宁, 汪来富 . 云环境下基于属性加密体制算法加速方案[J]. 电信科学, 2019,35(11): 101-107.
	WU G W , FAN N , WANG L F . Algorithm acceleration scheme based on attribute encryption system in cloud environment[J]. Telecommunication Science, 2019,35(11): 101-107.
[2]	SONG D X , WAGNER D , PERRIG A . Practical techniques for searches on encrypted data[C]// 2000 IEEE Symposium on Security and Privacy,May 14-17,2000,Berkeley,CA,USA. Piscataway:IEEE Press, 2000: 44-55.
[3]	BONEH D , CRESCENZO G D , OSTROVSKY R ,et al. Public key encryption with keyword search[C]// Advances in Cryptology - EUROCRYPT 2004,International Conference on the Theory and Applications of Cryptographic Techniques,Interlaken,May 2-6,2004,Switzerland. Berlin:Springer-Verlag, 2004: 506-522.
[4]	PARKD , KIM K , LEE P . Public key encryption with conjunctive field keyword search[C]// International Conference on Information Security Applications,Sep 27-29,Palo Alto,CA,USA. Berlin:Springer-Verlag, 2004: 73-86.
[5]	HWANG Y H , LEE P J . Public key encryption with conjunctive keyword search and its extension to a multi-user system[C]// Pairing-Based Cryptography - Pairing 2007,First International Conference,July 2-4,2007,Tokyo,Japan. Berlin:Springer-Verlag, 2007: 2-22.
[6]	DAN B , WWTERS B . Conjunctive,subset,and range queries on encrypted data[J]. Tcc, 2007,4392: 535-554.
[7]	宋衍, 韩臻, 陈栋 ,等. 支持关键词任意连接搜索的属性加密方案[J]. 通信学报, 2016,37(8): 77-85.
	SONG Y , HAN Z , CHEN D ,et al. Attribute-based encryption supporting arbitrary conjunctive key word search[J]. Journal on Communications, 2016,37(8): 77-85.
[8]	FAIROUZ S A , LU S F . Searchable encryption with conjunctive field free keyword search scheme[C]// 2016 International Conference on Network and Information Systems for Computers (ICNISC),April 15-17,2016.Wuhan,China. Piscataway:IEEE Press, 2016: 260-264.
[9]	LU Y , WANG G , LI J G ,et al. Efficient designated server identity-based encryption with conjunctive keyword search[J]. Annals of Telecommunications, 2017,72(5-6): 359-370.
[10]	BYUN J W , RHEE H S , PARK H A ,et al. Off-Line keyword guessing attacks on recent keyword search schemes over encrypted data[C]// Secure Data Management,Third VLDB Workshop,SDM 2006,September 10-11,2006,Seoul,Korea.[S.l.:s.n]. 2006: 75-83.
[11]	BAEK J , SAFAVI-NAINI R , SUSILO W . Public key encryption with keyword search revisited[C]// Computational Science and Its Applications-ICCSA 2008,International Conference,June 30-July 3,2008,Perugia,Italy. Berlin:Springer-Verlag, 2008: 1249-1259.
[12]	SHAMIR A , . Identity-based cryptosystems and signature schemes[C]// Workshop on the Theory and Application of Cryptographic Techniques,April 9-11,1984,Paris.France. Heidelberg Springer, 1984: 47-53.
[13]	BONEH D , FRANKLIN M . Identity-based encryption from the weil pairing[C]// The 21st Annual International Cryptology Conference on Advances in Cryptology,Aug 19-23,2001,Santa Barbara,California,USA. Heidelberg Springer, 2001: 213-229.
[14]	WU T Y , TSAI T T , TSENG Y M . Efficient searchable ID-based encryption with a designated server[J]. Annals of Telecommunications-Annales Des Télécommunications, 2013,69(7-8): 391-402.
[15]	王少辉, 韩志杰, 肖甫 ,等. 指定测试者的基于身份可搜索加密方案[J]. 通信学报, 2014,35(7): 22-32.
	WANG S H , HAN Z J , XIAO P ,et al. Identity-based searchable encryption scheme with a designated tester[J]. Journal on Communications, 2014,35(7): 22-32.
[16]	MOHAMAD M S , CHIN J J , POH G S . On the security advantages of block-based multiserver searchable symmetric encryption[C]// 2016 14th Annual Conference on Privacy,Security and Trust (PST),Dec 12-14,2016,Auckland,New Zealand. Piscataway:IEEE Press, 2016: 349-352.
[17]	HUANG H P , DU J P , DAI H ,et al. Multi-sever multi-keyword searchable encryption scheme based on cloud storage[J]. Journal of Electronics ＆ Information Technology, 2017,39(2): 389-396.
[18]	张玉磊, 刘祥震, 郎晓丽 ,等. 云环境下基于无证书的多服务器可搜索加密方案[J]. 信息网络安全, 2019,219(3): 78-86.
	ZHANG Y L , LIU X Z , LANG X L ,et al. Certificateless multi-server searchable encryption scheme in cloud environment[J]. Information Network Security, 2019,219(3): 78-86.
[19]	GUO F C , SUSILO W , MU Y . Introduction to security reduction\|\| Identity-based encryption with random oracles[J].2018.doi:10.1007/978-3-319-93049-7(Chapter 9):215-227. doi:10.1007/978-3-319-93049-7(Chapter 9), 2018: 215-227.

Metrics

Recommended 0

No Suggested Reading articles found!

对比项	密钥生成代价	密文生成代价	测试代价
WANG ^[14]	2h+2x	q+ (2j+2)(h+x)	(3+2m)(h+x)+(2+m)q
ZHANG^[17]	3h+3x	3j(h+x)+2qj	(m+3)(h+x)+mq
本文方案	(i+1)(h+x)	(4 j+1)(h+x)+qj	(6m+1)(h+x)+3mq

对比项	连接关键词	IND-CPA	IBE	多服务器
WANG^[14]	No	?es	?es	No
MOESFA ^[15]	No	No	No	?es
HUANG ^[16]	No	No	No	?es
ZHANG^[17]	No	?es	?es	?es
本文方案	?es	?es	?es	?es

Multi-server conjunctive keyword searchable encryption scheme based on BDH problem

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 3

References 19

Related Articles 1

Metrics

Recommended 0