Skip to main content
Top
Published in: Peer-to-Peer Networking and Applications 3/2021

29-01-2021

CP-ABSEL: Ciphertext-policy attribute-based searchable encryption from lattice in cloud storage

Authors: Uma Sankararao Varri, Syam Kumar Pasupuleti, K. V. Kadambari

Published in: Peer-to-Peer Networking and Applications | Issue 3/2021

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Ciphertext-policy attribute-based searchable encryption (CP-ABSE) is widely used in the cloud environment to provide data privacy and fine-grained access control over encrypted data. The existing CP-ABSE schemes are designed based on bilinear pairing hardness assumptions to prove their security. However, these schemes are vulnerable to quantum attacks, i.e., adversaries can break the security of these schemes with the use of quantum computers. To address this issue, in this paper, we propose a novel ciphertext-policy attribute-based searchable encryption from lattice (CP-ABSEL) in cloud storage, since lattice-based cryptography is quantum attacks free. In CP-ABSEL, we adopted learning with errors (LWE) hardness assumption to resist from quantum attacks. Further, CP-ABSEL is indistinguishable against the chosen keyword attack and indistinguishable against chosen plaintext attack. Moreover, CP-ABSEL allows only legitimate users to perform a keyword search over an encrypted index, and unauthorized users cannot get even the ciphertext form of documents. The performance analysis proves that CP-ABSEL is efficient and practical.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Chang V (2014) The business intelligence as a service in the cloud. Future Gener Comput Syst 37:512–534CrossRef Chang V (2014) The business intelligence as a service in the cloud. Future Gener Comput Syst 37:512–534CrossRef
2.
go back to reference Varri U, Pasupuleti S, Kadambari K (2019) A scoping review of searchable encryption schemes in cloud computing: taxonomy, methods, and recent developments. J Supercomput 76:1–30 Varri U, Pasupuleti S, Kadambari K (2019) A scoping review of searchable encryption schemes in cloud computing: taxonomy, methods, and recent developments. J Supercomput 76:1–30
3.
go back to reference Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE symposium on security and privacy. S&P 2000. IEEE, pp 44–55 Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE symposium on security and privacy. S&P 2000. IEEE, pp 44–55
4.
go back to reference Cash D, Jaeger J, Jarecki S, Jutla CS, Krawczyk H, Rosu MC, Steiner M (2014) Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS, Citeseer, vol 14, pp 23–26 Cash D, Jaeger J, Jarecki S, Jutla CS, Krawczyk H, Rosu MC, Steiner M (2014) Dynamic searchable encryption in very-large databases: data structures and implementation. In: NDSS, Citeseer, vol 14, pp 23–26
5.
go back to reference Goh EJ (2003) Secure indexes. IACR Cryptology ePrint Archive 2003:216 Goh EJ (2003) Secure indexes. IACR Cryptology ePrint Archive 2003:216
6.
go back to reference Du M, Wang Q, He M, Weng J (2018) Privacy-preserving indexing and query processing for secure dynamic cloud storage. IEEE Trans Inf Forensics Secur 13(9):2320–23352CrossRef Du M, Wang Q, He M, Weng J (2018) Privacy-preserving indexing and query processing for secure dynamic cloud storage. IEEE Trans Inf Forensics Secur 13(9):2320–23352CrossRef
7.
go back to reference Li J, Ma R, Guan H (2015) Tees: an efficient search scheme over encrypted data on mobile cloud. IEEE Trans Cloud Comput 5(1):126–139CrossRef Li J, Ma R, Guan H (2015) Tees: an efficient search scheme over encrypted data on mobile cloud. IEEE Trans Cloud Comput 5(1):126–139CrossRef
8.
go back to reference Zhang W, Lin Y, Qi G (2015) Catch you if you misbehave: ranked keyword search results verification in cloud computing. IEEE Trans Cloud Comput 6(1):74–86CrossRef Zhang W, Lin Y, Qi G (2015) Catch you if you misbehave: ranked keyword search results verification in cloud computing. IEEE Trans Cloud Comput 6(1):74–86CrossRef
9.
go back to reference Miao Y, Ma J, Jiang Q, Li X, Sangaiah AK (2018) Verifiable keyword search over encrypted cloud data in smart city. Comput Electric Eng 65:90–101CrossRef Miao Y, Ma J, Jiang Q, Li X, Sangaiah AK (2018) Verifiable keyword search over encrypted cloud data in smart city. Comput Electric Eng 65:90–101CrossRef
10.
go back to reference Liang K, Susilo W (2015) Searchable attribute-based mechanism with efficient data sharing for secure cloud storage. IEEE Trans Inf Forensics Secur 10(9):1981–1992CrossRef Liang K, Susilo W (2015) Searchable attribute-based mechanism with efficient data sharing for secure cloud storage. IEEE Trans Inf Forensics Secur 10(9):1981–1992CrossRef
11.
go back to reference Zheng Q, Xu S, Ateniese G (2014) Vabks: verifiable attribute-based keyword search over outsourced encrypted data. In: IEEE INFOCOM 2014-IEEE conference on computer communications. IEEE, pp 522–530 Zheng Q, Xu S, Ateniese G (2014) Vabks: verifiable attribute-based keyword search over outsourced encrypted data. In: IEEE INFOCOM 2014-IEEE conference on computer communications. IEEE, pp 522–530
12.
go back to reference Sun W, Yu S, Lou W, Hou YT, Li H (2016) Protecting your right: verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans Parallel Distrib Syst 27(4):1187–1198CrossRef Sun W, Yu S, Lou W, Hou YT, Li H (2016) Protecting your right: verifiable attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud. IEEE Trans Parallel Distrib Syst 27(4):1187–1198CrossRef
13.
go back to reference Khader D (2014) Attribute based search in encrypted data: Abse. In: Proceedings of the 2014 ACM workshop on information sharing & collaborative security. ACM, pp 31–40 Khader D (2014) Attribute based search in encrypted data: Abse. In: Proceedings of the 2014 ACM workshop on information sharing & collaborative security. ACM, pp 31–40
14.
go back to reference Han F, Qin J, Zhao H, Hu J (2014) A general transformation from kp-abe to searchable encryption. Future Gener Comput Syst 30:107–115CrossRef Han F, Qin J, Zhao H, Hu J (2014) A general transformation from kp-abe to searchable encryption. Future Gener Comput Syst 30:107–115CrossRef
15.
go back to reference Yang K, Zhang K, Jia X, Hasan MA, Shen XS (2017) Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms. Inf Sci 387:116–131MathSciNetCrossRef Yang K, Zhang K, Jia X, Hasan MA, Shen XS (2017) Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms. Inf Sci 387:116–131MathSciNetCrossRef
16.
go back to reference Li J, Lin X, Zhang Y, Han J (2016) Ksf-oabe: outsourced attribute-based encryption with keyword search function for cloud storage. IEEE Trans Serv Comput 10(5):715–725CrossRef Li J, Lin X, Zhang Y, Han J (2016) Ksf-oabe: outsourced attribute-based encryption with keyword search function for cloud storage. IEEE Trans Serv Comput 10(5):715–725CrossRef
17.
go back to reference Wang N, Fu J, Bhargava BK, Zeng J (2018) Efficient retrieval over documents encrypted by attributes in cloud computing. IEEE Trans Inf Forensics Secur 13(10):2653–2667CrossRef Wang N, Fu J, Bhargava BK, Zeng J (2018) Efficient retrieval over documents encrypted by attributes in cloud computing. IEEE Trans Inf Forensics Secur 13(10):2653–2667CrossRef
18.
go back to reference Miao Y, Ma J, Liu X, Li X, Liu Z, Li H (2017) Practical attribute-based multi-keyword search scheme in mobile crowdsourcing. IEEE Internet Things J 5(4):3008–3018CrossRef Miao Y, Ma J, Liu X, Li X, Liu Z, Li H (2017) Practical attribute-based multi-keyword search scheme in mobile crowdsourcing. IEEE Internet Things J 5(4):3008–3018CrossRef
19.
go back to reference Miao Y, Ma J, Liu X, Li X, Jiang Q, Zhang J (2020) Attribute-based keyword search over hierarchical data in cloud computing. IEEE Trans Serv Comput 13(6):985–998 Miao Y, Ma J, Liu X, Li X, Jiang Q, Zhang J (2020) Attribute-based keyword search over hierarchical data in cloud computing. IEEE Trans Serv Comput 13(6):985–998
20.
go back to reference Cui H, Wan Z, Deng RH, Wang G, Li Y (2016) Efficient and expressive keyword search over encrypted data in cloud. IEEE Trans Depend Secure Comput 15(3):409– 422CrossRef Cui H, Wan Z, Deng RH, Wang G, Li Y (2016) Efficient and expressive keyword search over encrypted data in cloud. IEEE Trans Depend Secure Comput 15(3):409– 422CrossRef
21.
go back to reference Wang H, Dong X, Cao Z (2020) Multi-value-independent ciphertext-policy attribute based encryption with fast keyword search. IEEE Trans Serv Comput 13(6):1142–1151CrossRef Wang H, Dong X, Cao Z (2020) Multi-value-independent ciphertext-policy attribute based encryption with fast keyword search. IEEE Trans Serv Comput 13(6):1142–1151CrossRef
22.
go back to reference Miao Y, Ma J, Liu X, Weng J, Li H, Li H (2019) Lightweight fine-grained search over encrypted data in fog computing. IEEE Trans Serv Comput 12:772–785CrossRef Miao Y, Ma J, Liu X, Weng J, Li H, Li H (2019) Lightweight fine-grained search over encrypted data in fog computing. IEEE Trans Serv Comput 12:772–785CrossRef
23.
go back to reference Escala A, Herold G, Kiltz E, Rafols C, Villar J (2017) An algebraic framework for diffie–hellman assumptions. J Cryptol 30(1):242–288MathSciNetCrossRef Escala A, Herold G, Kiltz E, Rafols C, Villar J (2017) An algebraic framework for diffie–hellman assumptions. J Cryptol 30(1):242–288MathSciNetCrossRef
24.
go back to reference Chen L, Chen L, Jordan S, Liu YK, Moody D, Peralta R, Perlner R, Smith-Tone D (2016) Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology Chen L, Chen L, Jordan S, Liu YK, Moody D, Peralta R, Perlner R, Smith-Tone D (2016) Report on post-quantum cryptography. US Department of Commerce, National Institute of Standards and Technology
25.
go back to reference Behnia R, Ozmen MO, Yavuz AA (2020) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Depend Secure Comput 17(6):1269–1282CrossRef Behnia R, Ozmen MO, Yavuz AA (2020) Lattice-based public key searchable encryption from experimental perspectives. IEEE Trans Depend Secure Comput 17(6):1269–1282CrossRef
26.
go back to reference Zhang X, Xu C, Mu L, Zhao J (2018) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164–178CrossRef Zhang X, Xu C, Mu L, Zhao J (2018) Identity-based encryption with keyword search from lattice assumption. China Commun 15(4):164–178CrossRef
27.
go back to reference Kuchta V, Markowitch O (2016) Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: International conference on cryptology in Malaysia. Springer, pp 409–435 Kuchta V, Markowitch O (2016) Multi-authority distributed attribute-based encryption with application to searchable encryption on lattices. In: International conference on cryptology in Malaysia. Springer, pp 409–435
28.
go back to reference Liu L, Wang S, He B, Zhang D (2019) A keyword-searchable abe scheme from lattice in cloud storage environment. IEEE Access 7:109038–109053CrossRef Liu L, Wang S, He B, Zhang D (2019) A keyword-searchable abe scheme from lattice in cloud storage environment. IEEE Access 7:109038–109053CrossRef
29.
30.
go back to reference Micciancio D (2011) Lattice-based cryptography. Encyclopedia of Cryptography and Security Micciancio D (2011) Lattice-based cryptography. Encyclopedia of Cryptography and Security
31.
go back to reference Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (h) ibe in the standard model. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 553–572 Agrawal S, Boneh D, Boyen X (2010) Efficient lattice (h) ibe in the standard model. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 553–572
32.
go back to reference Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on theory of computing. ACM, pp 197–206 Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on theory of computing. ACM, pp 197–206
33.
go back to reference Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the forty-first annual ACM symposium on theory of computing. ACM, pp 333–342 Peikert C (2009) Public-key cryptosystems from the worst-case shortest vector problem. In: Proceedings of the forty-first annual ACM symposium on theory of computing. ACM, pp 333–342
34.
go back to reference Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 523–552 Cash D, Hofheinz D, Kiltz E, Peikert C (2010) Bonsai trees, or how to delegate a lattice basis. In: Annual international conference on the theory and applications of cryptographic techniques. Springer, pp 523–552
35.
go back to reference Regev O (2006) Lattice-based cryptography. In: Annual international cryptology conference. Springer, pp 131–141 Regev O (2006) Lattice-based cryptography. In: Annual international cryptology conference. Springer, pp 131–141
36.
go back to reference Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM conference on Computer and communications security, pp 89–98 Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM conference on Computer and communications security, pp 89–98
37.
go back to reference Gür KD, Polyakov Y, Rohloff K, Ryan GW, Sajjadpour H, Savaş E (2018) Practical applications of improved gaussian sampling for trapdoor lattices. IEEE Trans Comput 68(4):570–584MathSciNetCrossRef Gür KD, Polyakov Y, Rohloff K, Ryan GW, Sajjadpour H, Savaş E (2018) Practical applications of improved gaussian sampling for trapdoor lattices. IEEE Trans Comput 68(4):570–584MathSciNetCrossRef
Metadata
Title
CP-ABSEL: Ciphertext-policy attribute-based searchable encryption from lattice in cloud storage
Authors
Uma Sankararao Varri
Syam Kumar Pasupuleti
K. V. Kadambari
Publication date
29-01-2021
Publisher
Springer US
Published in
Peer-to-Peer Networking and Applications / Issue 3/2021
Print ISSN: 1936-6442
Electronic ISSN: 1936-6450
DOI
https://doi.org/10.1007/s12083-020-01057-3

Other articles of this Issue 3/2021

Peer-to-Peer Networking and Applications 3/2021 Go to the issue

Premium Partner