Attribute-based encryption with keyword search(ABEKS)is a novel cryptographic paradigm that can be used to implementfine-grained access control and retrieve ciphertexts without disclosing the sensitive information.It i...Attribute-based encryption with keyword search(ABEKS)is a novel cryptographic paradigm that can be used to implementfine-grained access control and retrieve ciphertexts without disclosing the sensitive information.It is a perfect combination of attribute-based encryption(ABE)and public key encryption with keyword search(PEKS).Nevertheless,most of the existing ABEKS schemes have limited search capabilities and only support single or simple conjunctive keyword search.Due to the weak search capability and inaccurate search results,it is difficult to apply these schemes to practical applications.In this paper,an effi-cient expressive ABEKS(EABEKS)scheme supporting unbounded keyword uni-verse over prime-order groups is designed,which supplies the expressive keyword search function supporting the logical connectives of“AND”and“OR”.The proposed scheme not only leads to low computation and communica-tion costs,but also supports unbounded keyword universe.In the standard model,the scheme is proven to be secure under the chosen keyword attack and the cho-sen plaintext attack.The comparison analysis and experimental results show that it has better performance than the existing EABEKS schemes in the storage,com-putation and communication costs.展开更多
The existing search engines are lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose.By analyzing user's dynamic...The existing search engines are lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose.By analyzing user's dynamic search behavior,the paper introduces a new method of using a keyword query graph to express user's dynamic search behavior,and uses Bayesian network to construct the prior probability of keyword selection and the migration probability between keywords for each user.To reflect the dynamic changes of the user's preference,the paper introduces non-lineal gradual forgetting collaborative filtering strategy into the personalized search recommendation model.By calculating the similarity between each two users,the model can do the recommendation based on neighbors and be used to construct the personalized search engine.展开更多
基金supported in part by the National Natural Science Foundation of China under Grant No.61772009the Natural Science Foundation of Jiangsu Province under Grant No.BK20181304.
文摘Attribute-based encryption with keyword search(ABEKS)is a novel cryptographic paradigm that can be used to implementfine-grained access control and retrieve ciphertexts without disclosing the sensitive information.It is a perfect combination of attribute-based encryption(ABE)and public key encryption with keyword search(PEKS).Nevertheless,most of the existing ABEKS schemes have limited search capabilities and only support single or simple conjunctive keyword search.Due to the weak search capability and inaccurate search results,it is difficult to apply these schemes to practical applications.In this paper,an effi-cient expressive ABEKS(EABEKS)scheme supporting unbounded keyword uni-verse over prime-order groups is designed,which supplies the expressive keyword search function supporting the logical connectives of“AND”and“OR”.The proposed scheme not only leads to low computation and communica-tion costs,but also supports unbounded keyword universe.In the standard model,the scheme is proven to be secure under the chosen keyword attack and the cho-sen plaintext attack.The comparison analysis and experimental results show that it has better performance than the existing EABEKS schemes in the storage,com-putation and communication costs.
基金supported by the National Natural Science Foundation of China(60432010)the National Basic Research Program of China(2007CB307103)+1 种基金the Fundamental Research Funds for the Central Universities(2009RC0507)Important Science&Technology Specific Project of Guizhou Province(【2007】6017)
文摘The existing search engines are lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose.By analyzing user's dynamic search behavior,the paper introduces a new method of using a keyword query graph to express user's dynamic search behavior,and uses Bayesian network to construct the prior probability of keyword selection and the migration probability between keywords for each user.To reflect the dynamic changes of the user's preference,the paper introduces non-lineal gradual forgetting collaborative filtering strategy into the personalized search recommendation model.By calculating the similarity between each two users,the model can do the recommendation based on neighbors and be used to construct the personalized search engine.
