A lattice-based searchable encryption scheme with the validity period control of files

被引:0
作者
En Zhang
Yingying Hou
Gongli Li
机构
[1] Henan Normal University,College of Computer and Information Engineering
[2] Internet of Things of Henan Province,Lab of Intelligence Business
来源
Multimedia Tools and Applications | 2021年 / 80卷
关键词
Searchable encryption; Keyword search; LWE problem; Validity period control; Multimedia data;
D O I
暂无
中图分类号
学科分类号
摘要
In recent years, with the dramatic increase in the use of multimedia data, rapid retrieval and sharing of the multimedia data have become major trends. The validity period control function widely used in daily softwares, which enables multimedia data to be shared from a specific time and revokes the authorization of shared data at another specific time, thereby effectively enhancing the personalized experience of multimedia data users. At the same time, to protect privacy, databases usually store data in an encrypted form and use searchable encryption technology to retrieve keywords on the ciphertext to quickly extract the required multimedia data. However, the existing searchable encryption scheme cannot control the reading of multimedia data by using validity period. To solve this problem, we propose a lattice-based searchable encryption scheme with the validity period control of files. In order that the data owners have flexible and fine-grained control over the files, we convert the time information into a lattice vector for setting a different valid time for each file. Meanwhile, we embed the time information into the ciphertext, so that the data owner only needs to set the validity period once to automatically maintain the life cycle of the files over encrypted data, instead of manually withdrawing each expired file. Furthermore, we combine searchable encryption and time-distance so that our scheme returns valid files only if the keywords match correctly and the search time matches the file’s validity period. This scheme is a candidate for time-controlled searchable encryption technology in the post-quantum era because our scheme constructed on learning with error (LWE) problem which has been proven to resist quantum attacks.
引用
收藏
页码:4655 / 4672
页数:17
相关论文
共 67 条
  • [1] Alwen J(2011)Generating shorter bases for hard random lattices Theor Comput Syst 48 535-553
  • [2] Peikert C(2004)Public key encryption with keyword search[J] Eurocrypt 3027 506-522
  • [3] BONEH D(2011)Timed-release proxy re-encryption scheme[J] IEICE Trans Fundament Electron Commun Comput Sci 94 1682-1695
  • [4] CRESCENZO G D(2019)Provably secure public-key encryption with conjunctive and subset keyword search[J] Int J Inf Secur 18 533-548
  • [5] OSTROVSKY R(2003)Secure indexes[J] IACR Cryptol ePrint Arc 2003 216-10
  • [6] Emura K(2013)Public key encryption with keyword search from lattices[J] Int J Inform Technol 19 1-395
  • [7] Miyaji A(2018)Secure multi-keyword ranked search over encrypted cloud data for multiple data owners[J] J Syst Softw 137 380-5773
  • [8] Omote KA(2019)Searchable encryption: a survey on privacy-preserving search schemes on encrypted outsourced data[J] Concurr Comput Pract Exp 31 e5201-725
  • [9] Farràs O(2019)Privacy protection and integrity verification of aggregate queries in cloud computing[J] Clust Comput 22 5763-767
  • [10] Ribes-González J(2016)KSF-OABE: Outsourced attribute-based encryption with keyword search function for cloud storage[J] IEEE Trans Serv Comput 10 715-1007