Skip to main content
Springer Nature Link
Log in

Multi-user search on the encrypted multimedia database: lattice-based searchable encryption scheme with time-controlled proxy re-encryption

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Multimedia cloud storage which saves the huge storage overhead of local devices has attracted considerable attention. However, due to the lack of physical control of data, the privacy protection of data on the multimedia cloud has become one of the main concerns of users. Public-key encryption with keywords search (PEKS) is a technique that can keep the privacy and searchability of data in the cloud. In this paper, we present a PEKS with time-controlled proxy re-encryption model which allows the data owner to delegate the access right of the encrypted multimedia database to other users, to achieve the time-controlled multi-user search. Furthermore, it is designed to resist keywords guessing attack and support conjunctive keywords search. Compared with previous works which require a time server to generate a time seal for the generation of the search token, this model embeds the time information of accessing the encrypted database into public and secret key pairs of data users, which saves the managing overhead and reduces the security risks resulting from an extra server. In addition, most existing PEKS schemes were constructed based on the hardness of classical mathematical problems which can be broken by quantum computers. To address this issue, a lattice-based PEKS scheme based on the above model is proposed, which can be considered as the candidate for protecting multimedia data security in the quantum era.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Agrawal S, Boneh D, Boyen X (2010) Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE. In: CRYPTO, pp 98–115

  2. Ajtai M (1996) Generating hard instances of lattice problems (extended abstract). In: ACM symposium on the theory of computing, pp 99–108

  3. Ajtai M (1999) Generating hard instances of the short basis problem. In: Proceedings of ICALP, pp 1–9

  4. Alwen J, Peikert C (2009) Generating shorter bases for hard random lattices. In: Proceedings of STACS, pp 75–86

  5. Behnia R, Ozmen MO, Yavuz AA (2018) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Dependable Secure Comput. https://doi.org/10.1109/TDSC.2018.2867462

  6. Boneh D, Crescenzo GD, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: EUROCRYPT, pp 506–522

  7. Brakerski Z, Langlois A, Peikert C, Regev O, Stehlė D (2013) Classical hardness of learning with errors. In: Symposium on theory of computing conference, STOC, pp 575–584

  8. Byun JW, Rhee HS, Park H, Lee DH (2006) Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Secure data management, third VLDB workshop, SDM, pp 75–83

  9. Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: EUROCRYPT, pp 523–552

  10. Chen R, Mu Y, Yang G, Guo F, Wang X (2015) A new general framework for secure public key encryption with keyword search. In: ACISP, pp 59–76

  11. Chen Y, Hu Y, Zhu M, Yang G (2018) Attribute-based keyword search with proxy re-encryption in the cloud. IEICE Trans 101-B(8):1798–1808

    Article  Google Scholar 

  12. Fang L, Susilo W, Ge C, Wang J (2013) Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf Sci 238:221–241

    Article  MathSciNet  Google Scholar 

  13. Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the ACM symposium on theory of computing, pp 197–206

  14. Gordon SD, Katz J, Vaikuntanathan V (2010) A group signature scheme from lattice assumptions. In: Advances in cryptology - ASIACRYPT, pp 395–412

  15. Gu C, Zheng Y, Kang F, Xin D (2015) Keyword search over encrypted data in cloud computing from lattices in the standard model. In: Cloud computing and big data - second international conference, CloudCom-Asia, pp 335–343

  16. Huang Q, Li H (2017) An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf Sci 403:1–14

    Article  Google Scholar 

  17. Li Y, Gai K, Ming Z, Zhao H, Qiu M (2016) Intercrossed access controls for secure financial services on multimedia big data in cloud systems. ACM Trans Multim Comput Commun Appl 12(4s):67:1–67:18

    Google Scholar 

  18. Regev O (2009) On lattices, learning with errors, random linear codes, and cryptography. J ACM 56(6):34:1–34:40

    Article  MathSciNet  Google Scholar 

  19. Rhee HS, Park JH, Susilo W, Lee DH (2010) Trapdoor security in a searchable public-key encryption scheme with a designated tester. J Syst Softw 83(5):763–771

    Article  Google Scholar 

  20. Shao J, Cao Z, Liang X, Lin H (2010) Proxy re-encryption with keyword search. Inf Sci 180(13):2576–2587

    Article  MathSciNet  Google Scholar 

  21. Sood SK (2020) Mobile fog based secure cloud-iot framework for enterprise multimedia security. Multim Tools Appl 79(15-16):10717–10732

    Article  Google Scholar 

  22. Sun L, Xu C, Zhang M, Chen K, Li H (2018) Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation, SCIENCE, CHINA. Inf Sci 61(3):038106:1–038106:3

    Google Scholar 

  23. Wang H, Wu S, Chen M, Wang W (2014) Security protection between users and the mobile media cloud. IEEE Commun Mag 52(3):73–79

    Article  Google Scholar 

  24. Wang XA, Huang X, Yang X, Liu L, Wu X (2012) Further observation on proxy re-encryption with keyword search. J Syst Softw 85(3):643–654

    Article  Google Scholar 

  25. Xu L, Li J, Chen X, Li W, Tang S, Wu H (2019) Tc-pedcks: Towards time controlled public key encryption with delegatable conjunctive keyword search for internet of things. J Netw Comput Appl 128:11–20

    Article  Google Scholar 

  26. Xu L, Yuan X, Steinfeld R, Wang C, Xu C (2019) Multi-writer searchable encryption: An lwe-based realization and implementation. In: Asia conference on computer and communications security, AsiaCCS, pp 122–133

  27. Yang Y, Ma M (2016) Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds. IEEE Trans Inf Forensic Secur 11(4):746–759

    Google Scholar 

  28. Yang Y, Zheng X, Chang V, Tang C (2017) Semantic keyword searchable proxy re-encryption for postquantum secure cloud storage. Concurr Comput 29(19)

  29. Yang Y, Zheng X, Chang V, Ye S, Tang C (2018) Lattice assumption based fuzzy information retrieval scheme support multi-user for secure multimedia cloud. Multimedia Tools Appl 77(8):9927–9941

    Article  Google Scholar 

  30. Zhang X, Xu C (2018) Trapdoor security lattice-based public-key searchable encryption with a designated cloud server. Wirel Pers Commun 100 (3):907–921

    Article  MathSciNet  Google Scholar 

  31. Zhang X, Xu C, Wang H, Zhang Y, Wang S (2019) Fs-peks: lattice-based forward secure public-key encryption with keyword search for cloud-assisted industrial internet of things. IEEE Trans Dependable Secure Comput. https://doi.org/10.1109/TDSC.2019.2914117

Download references

Acknowledgment

The authors would like to thank the support from Fundamental Research Funds for the Central Universities (No.30918012204), China. The authors also gratefully acknowledge the helpful comments and suggestions of other researchers for improving the presentation.

Author information

Authors and Affiliations

  1. School of Science, Nanjing University of Science and Technology, Nanjing, 210094, China

    Xiaoling Yu, Chungen Xu & Bennian Dou

  2. School of Information Science, Security and Networks, Japan Advanced Institute of Science and Technology, Ishikawa, 9231292, Japan

    Yuntao Wang

Authors
  1. Xiaoling Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chungen Xu
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Bennian Dou
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Yuntao Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Chungen Xu.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, X., Xu, C., Dou, B. et al. Multi-user search on the encrypted multimedia database: lattice-based searchable encryption scheme with time-controlled proxy re-encryption. Multimed Tools Appl 80, 3193–3211 (2021). https://doi.org/10.1007/s11042-020-09753-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-09753-1

Keywords