Skip to main content

Key Policy-Attribute Based Fully Homomorphic Encryption (KP-ABFHE) Scheme for Securing Cloud Application in Multi-users Environment

  • Conference paper
  • First Online:
9th International Conference on Robotic, Vision, Signal Processing and Power Applications

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 398))

Abstract

Recently, cloud technologies has become a cost-effective data solution among the small and medium-sized enterprises (SMEs). However, there is a raising concern on its security. This paper proposed the Key Policy-Attribute Based Fully Homomorphic Encryption (KP-ABFHE) scheme for providing an end-to end data protection in multi-users cloud environments. The proposed KP-ABFHE scheme is able to perform the computation while providing fine-grained access on the encrypted data. The proposed scheme is able to handle a monotonic access structure over a set of authorized attributes, without sacrificing the computation capabilities of homomorphic encryption. In addition, this paper proves that the proposed scheme is secure under a selective-set model with the hardness of Decision Ring-LWE\({_{d,q, \chi } }\) problem.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Rivest R (1978) On data banks and privacy homomorphisms. Found Sec Comput 4:169–180

    MathSciNet  Google Scholar 

  2. Gentry C (2009) A Fully Homomorphic encryption scheme. Phd Thesis. Standford University

    Google Scholar 

  3. Xiao L, Bastani O, Yen I (2012) An efficient homomorphic encryption protocol for multi-user systems. IACR Crypt. ePrint Arch

    Google Scholar 

  4. Lopez-Alt A, Tromer E, Vaikuntanathan V (2012) On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: 44th symposium on Theory of Computing. ACM press, New York, pp 12–19

    Google Scholar 

  5. Brakerski Z, Vaikuntanathan V (2011) Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Rogaway P (ed) CRYPTO 2011, vol 6841, LNCS. Springer, Heidelberg, pp 505–524

    Google Scholar 

  6. Gentry C, Sahai A, Waters B (2013) Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Ca-netti R, Garay JA (eds) CRYPTO 2013, vol 8042, LNCS. Springer, Heidelberg, pp 75–92

    Google Scholar 

  7. Clear M, McGoldrick C (2013) Policy-based non-interactive outsourcing of com-putation using multikey FHE and CP-ABE. In: 10th international conference on security and cryptography (SECRYPT). IEEE Press, Reykjavik, pp 444–452

    Google Scholar 

  8. Clear M, McGoldrick C (2013) Bootstrappable identity-based fully homomorphic encryption. In: Gritzalis D, Kiayias A, Askoxylakis I (eds) CANS 2013, vol 8831, LNCS. Springer, Switzerland, pp 1–19

    Google Scholar 

  9. Beimel A (1996) Secure schemes for secret sharing and key distribution. Phd Thesis. Israel Institute of Technology, Haifa, Israel

    Google Scholar 

  10. Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Gilbert H (ed) EUROCRYPT 2010, vol 6110, LNCS. Springer, Heidelberg, pp 1–23

    Google Scholar 

  11. Lyubashevsky V, Peikert C, Regev O (2013) A toolkit for ring-LWE cryptography. In: JohanssonT, Nguyen PQ (eds) EUROCRYPT 2013, vol. 7881, LNCS. Springer, Heidelberg, pp 35–54

    Google Scholar 

  12. Soo Fun T, Azman S (2015) Lattice ciphertext-policy attribute-based encryption from ring-LWE. In: 2nd international symposium on technology management and emerging technologies (ISTMET). IEEE Press, Langkawi, pp 282–286

    Google Scholar 

  13. Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: 13th ACM conference on Computer and communications security (CCS). ACM Press. New York, pp 89–98

    Google Scholar 

  14. Koo D, Hur J, Yoon H (2013) Secure and efficient data retrieval over encrypted data using attribute-based encryption in cloud storage. Comp. Elect. Eng. 39:34–46

    Article  Google Scholar 

  15. Weiling Z, Jianping Y, Ting W, Peng Z, Weixin X (2014) Efficient attribute-based encryption from R-LWE. Chin. J. Elect. 23:4

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Soo Fun Tan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Tan, S.F., Samsudin, A. (2017). Key Policy-Attribute Based Fully Homomorphic Encryption (KP-ABFHE) Scheme for Securing Cloud Application in Multi-users Environment. In: Ibrahim, H., Iqbal, S., Teoh, S., Mustaffa, M. (eds) 9th International Conference on Robotic, Vision, Signal Processing and Power Applications. Lecture Notes in Electrical Engineering, vol 398. Springer, Singapore. https://doi.org/10.1007/978-981-10-1721-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-1721-6_9

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-1719-3

  • Online ISBN: 978-981-10-1721-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics