Skip to main content
SpringerLink
Log in

Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata

  • Conference paper
  • First Online:
Cryptology and Network Security (CANS 2019)

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

Included in the following conference series:

  • 829 Accesses

Abstract

Cellular automata (CA) has attracted the attention of research communities for its applications in the design of symmetric and public-key cryptosystems. The strength of cellular automata lies in its inherent data parallelism, which can help accelerate access control mechanisms, and its information scrambling capabilities, which can enhance the security of the system. Also, the cryptosystems designed using CA do not involve number-theoretic methodologies that incur large computational overhead like traditional cryptosystems. However, existing CA-based cryptosystems encompass a limited set from the set of all possible transition rules indicating the existence of CA cryptosystems which are possibly unbreakable but have not been explored sufficiently. Thus, they have not yet been considered for applications involving fine-grained access control for heterogeneous access to the data. In this paper, we propose a secure distributed multi-authority attribute-based encryption using CA, which has potential applications in cloud systems. Our cryptosystem adopts the concept of multi-authority attribute-based access control where the encryption and attribute distribution use reversible CA, and policy satisfiability is achieved by Turing-complete CA in a distributed environment. We illustrate the practical usability of our proposed cryptosystem, in terms of efficiency and security, by extensive experimental results.

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

Notes

  1. 1.

    A prototype access structure is a Boolean representation of the access policy which is to be satisfied by the user’s attributes in order to access the data.

  2. 2.

    Tokenising CA is a CA that converts an attribute into its intermediate token.

  3. 3.

    Detokenizing CA is a CA that converts a final token into its actual attribute.

  4. 4.

    Encryption CA is a CA that is responsible for encryption of a message into its ciphertext.

  5. 5.

    Decryption CA is a CA that is responsible for converting the ciphertext back to its original message.

References

  1. Schiff, J.: Introduction to Cellular Automata, 1st edn. Wiley, Hoboken

    Google Scholar 

  2. Wolfram, S.: Computation theory of cellular automata. Commun. Math. Phys. 96, 15–57 (1984). https://doi.org/10.1007/BF01217347

    Article  MathSciNet  MATH  Google Scholar 

  3. Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Neary, T., Woods, D.: P-completeness of cellular automaton rule 110. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 132–143. Springer, Heidelberg (2006). https://doi.org/10.1007/11786986_13

    Chapter  Google Scholar 

  5. Rennard, J.P.: Implementation of logical functions in the game of life. In: Adamatzky, A. (ed.) Collision-Based Computing, pp. 491–512. Springer, London (2002). https://doi.org/10.1007/978-1-4471-0129-1_17

    Chapter  Google Scholar 

  6. Kari, J.: Reversible cellular automata. In: Proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, pp. 57–68 (2005)

    Chapter  Google Scholar 

  7. Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 457–473. Springer, Heidelberg (2005). https://doi.org/10.1007/11426639_27

    Chapter  Google Scholar 

  8. Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security - CCS 2006, pp. 89–98 (2006). https://doi.org/10.1145/1180405.1180418

  9. Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: Proceedings of the 2007 IEEE Symposium on Security and Privacy, pp. 321–334 (2007). https://doi.org/10.1109/SP.2007.11

  10. Lewko, A., Sahai, A., Waters, B.: Revocation systems with very small private keys. In: Proceedings of the 2010 IEEE Symposium on Security and Privacy, pp. 273–285 (2010). https://doi.org/10.1109/SP.2010.23

  11. Waters, B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 53–70. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-19379-8_4

    Chapter  Google Scholar 

  12. Wolfram, S.: Random sequence generation by cellular Automata. In: Advances in Applied Mathematics, vol. 7, no. 2, pp. 123–169 (1986). https://doi.org/10.1016/0196-8858(86)90028-X

    Article  MathSciNet  Google Scholar 

  13. Meier, W., Staffelbach, O.: Analysis of pseudo random sequences generated by cellular automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186–199. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-46416-6_17

    Chapter  Google Scholar 

  14. Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and applications of cellular automata in cryptography. IEEE Trans. Comput. 43(12), 1346–1357 (1994). https://doi.org/10.1109/12.338094

    Article  MathSciNet  Google Scholar 

  15. Paterson, K., Blackburn, S., Murphy, S.: Comments on theory and applications of cellular automata in cryptography. IEEE Trans. Comput. 46, 637–638 (1997). https://doi.org/10.1109/12.589245

    Article  MathSciNet  Google Scholar 

  16. Tomassini, M., Perrenoud, M.: Cryptography with cellular automata. Appl. Soft Comput. 1(2), 151–160 (2001). https://doi.org/10.1016/S1568-4946(01)00015-1

    Article  MATH  Google Scholar 

  17. Santos, T.: Cellular automata and cryptography. In: Dissertacao de Mestrado apresentada a Faculdade de Ciencias da Universidade do Porto em Ciencia de Computadores (2014)

    Google Scholar 

  18. Bouchkaren, S., Lazaar, S.: A fast cryptosystem using reversible cellular automata. Int. J. Adv. Comput. Sci. Appl. 5(5), 207–210 (2014)

    Google Scholar 

  19. Sakai, R., Kasahara, M.: ID-based cryptosystems with pairing on elliptic curves. IACR Cryptology ePrint Archive, vol. 03 (2003)

    Google Scholar 

  20. Guan, P.: Cellular automaton public-key cryptosystem. Complex Syst. 1, 51–57 (1987)

    MathSciNet  MATH  Google Scholar 

  21. Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn, pp. 109–111. Cambridge University Press, Cambridge (2007)

    MATH  Google Scholar 

  22. Amoroso, S., Patt, Y.: Decision procedures for surjectivity and injectivity of parallel maps for tesselation structures. J. Comput. Syst. Sci. 6(5), 448–464 (1972). https://doi.org/10.1016/S0022-0000(72)80013-8

    Article  MATH  Google Scholar 

  23. Seredynski, M., Bouvry, P.: Block cipher based on reversible cellular automata. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753), Portland, OR, USA, vol. 2, pp. 2138–2143 (2004). https://doi.org/10.1109/CEC.2004.1331161

  24. Maiti, S., Roy Chowdhury, D.: Achieving better security using nonlinear cellular automata as a cryptographic primitive. In: Ghosh, D., Giri, D., Mohapatra, R.N., Savas, E., Sakurai, K., Singh, L.P. (eds.) ICMC 2018. CCIS, vol. 834, pp. 3–15. Springer, Singapore (2018). https://doi.org/10.1007/978-981-13-0023-3_1

    Chapter  Google Scholar 

  25. Wei, J., Liu, W., Hu, X.: Secure and efficient attribute-based access control for multiauthority cloud storage. IEEE Syst. J. 12(2), 1731–1742 (2018). https://doi.org/10.1109/JSYST.2016.2633559

    Article  Google Scholar 

  26. Zhang, K., Li, H., Ma, J., Liu, X.: Efficient large-universe multi-authority ciphertext-policy attribute-based encryption with white-box traceability. In: Science China Information Sciences, pp. 2895–2903 (2017). https://doi.org/10.1007/s11432-016-9019-8

  27. de Souza Brito, A., Soares, S.S.R.F., Villela, S.M.: Metaheuristics in the project of cellular automata for key generation in stream cipher algorithms. In: 2018 IEEE Congress on Evolutionary Computation (CEC), Rio de Janeiro, pp. 1–8 (2018). https://doi.org/10.1109/CEC.2018.8477658

  28. Chase, M.: Multi-authority attribute based encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 515–534. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-70936-7_28

    Chapter  Google Scholar 

  29. Hinek, M.J., Jiang, S., Safavi-Naini, R., Shahandashti, S.F.: Attribute-based encryption with key cloning protection. Cryptology ePrint Archive, Report 2008/478 (2008). https://doi.org/10.1504/IJACT.2012.045587

    Article  MathSciNet  Google Scholar 

  30. Rouselakis, Y., Waters, B.: Efficient statically-secure large-universe multi-authority attribute-based encryption. In: Böhme, R., Okamoto, T. (eds.) FC 2015. LNCS, vol. 8975, pp. 315–332. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47854-7_19

    Chapter  Google Scholar 

  31. Sloot, P.M.A.: BLAS: basic linear algebra subsystems. In: Psychometrika, January 1993

    Google Scholar 

  32. Steinhart, E.: An Introduction to Conway’s The Game of Life, in YouTube. www.youtube.com/watch?v=ouipbDkwHWA

  33. Toffoli, T., Margolus, N.: Invertible cellular automata. Physica D 45, 229–253 (1990)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian Institute of Technology, Bhubaneswar, India

    Ankit Pradhan, Kamalakanta Sethi, Shrohan Mohapatra & Padmalochan Bera

Authors
  1. Ankit Pradhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kamalakanta Sethi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shrohan Mohapatra
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Padmalochan Bera
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamalakanta Sethi .

Editor information

Editors and Affiliations

  1. Fujian Normal University, Fuzhou, China

    Yi Mu

  2. Singapore Management University, Singapore, Singapore

    Robert H. Deng

  3. Fujian Normal University, Fuzhou, China

    Xinyi Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Pradhan, A., Sethi, K., Mohapatra, S., Bera, P. (2019). Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata. In: Mu, Y., Deng, R., Huang, X. (eds) Cryptology and Network Security. CANS 2019. Lecture Notes in Computer Science(), vol 11829. Springer, Cham. https://doi.org/10.1007/978-3-030-31578-8_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31578-8_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31577-1

  • Online ISBN: 978-3-030-31578-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation