Skip to main content
SpringerLink
Log in

Key-Policy Attribute-Based Encryption from Bilinear Maps

  • Conference paper
  • First Online:
Innovative Security Solutions for Information Technology and Communications (SecITC 2017)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 10543))

Included in the following conference series:

  • 585 Accesses

Abstract

The aim of this paper is to provide an overview on the newest results regarding the design of key-policy attribute-based encryption (KP-ABE) schemes from secret sharing and bilinear maps.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, pp. 784–796. ACM, New York (2012)

    Google Scholar 

  2. Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: IEEE Symposium on Security and Privacy, S&P 2007, pp. 321–334. IEEE Computer Society (2007)

    Google Scholar 

  3. Ţiplea, F.L., Drăgan, C.C.: Key-policy attribute-based encryption for boolean circuits from bilinear maps. In: Ors, B., Preneel, B. (eds.) BalkanCryptSec 2014. LNCS, vol. 9024, pp. 175–193. Springer, Cham (2015). doi:10.1007/978-3-319-21356-9_12

    Chapter  Google Scholar 

  4. Drăgan, C.C., Ţiplea, F.L.: Key-policy attribute-based encryption for general boolean circuits from secret sharing and multi-linear maps. In: Pasalic, E., Knudsen, L.R. (eds.) BalkanCryptSec 2015. LNCS, vol. 9540, pp. 112–133. Springer, Cham (2016). doi:10.1007/978-3-319-29172-7_8

    Chapter  Google Scholar 

  5. Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1–17. Springer, Heidelberg (2013). doi:10.1007/978-3-642-38348-9_1

    Chapter  Google Scholar 

  6. Garg, S., Gentry, C., Halevi, S., Sahai, A., Waters, B.: Attribute-based encryption for circuits from multilinear maps. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 479–499. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40084-1_27

    Chapter  Google Scholar 

  7. Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) STOC, pp. 545–554. ACM (2013)

    Google Scholar 

  8. Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encypted data. In: ACM Conference on Computer and Communications Security, pp. 89–98. ACM (2006)

    Google Scholar 

  9. Peng, H., Gao, H.: A key-policy attribute-based encryption scheme for general circuit from bilinear maps. Int. J. Network Secur. 19(5), 704–710 (2017)

    Google Scholar 

  10. Ostrovsky, R., Sahai, A., Waters, B.: Attribute-based encryption with non-monotonic access structures. In: ACM Conference on Computer and Communications Security, pp. 195–203. ACM (2007)

    Google Scholar 

  11. Simmons, G.J.: How to (Really) share a secret. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 390–448. Springer, New York (1990). doi:10.1007/0-387-34799-2_30

    Google Scholar 

  12. Stinson, D.R.: Cryptography: Theory and Practice, 3rd edn. Chapman and Hall/CRC, Boca Raton (2005)

    MATH  Google Scholar 

  13. Tassa, T.: Hierarchical threshold secret sharing. J. Cryptology 20(2), 237–264 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  14. Tassa, T., Dyn, N.: Multipartite secret sharing by bivariate interpolation. J. Cryptology 22(2), 227–258 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, “Alexandru Ioan Cuza” University of Iaşi, 700506, Iaşi, Romania

    Ferucio Laurenţiu Ţiplea & Anca-Maria Nica

  2. CNRS, LORIA, 54506, Vandoeuvre-lès-Nancy Cedex, France

    Constantin Cătălin Drăgan

Authors
  1. Ferucio Laurenţiu Ţiplea
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Constantin Cătălin Drăgan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anca-Maria Nica
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ferucio Laurenţiu Ţiplea .

Editor information

Editors and Affiliations

  1. École Normale Supérieure, Paris, France

    Pooya Farshim

  2. Polytechnic University of Bucharest, Bucharest, Romania

    Emil Simion

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ţiplea, F.L., Drăgan, C.C., Nica, AM. (2017). Key-Policy Attribute-Based Encryption from Bilinear Maps. In: Farshim, P., Simion, E. (eds) Innovative Security Solutions for Information Technology and Communications. SecITC 2017. Lecture Notes in Computer Science(), vol 10543. Springer, Cham. https://doi.org/10.1007/978-3-319-69284-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69284-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69283-8

  • Online ISBN: 978-3-319-69284-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation