A Novel method to represent Access Tree structure by Context Free Grammar with and-or graph in Key Policy based Attribute based Encryption

  • Authors

    • K. Senthil Kumar
    • D. Malathi
    2018-10-02
    https://doi.org/10.14419/ijet.v7i4.10.20946
  • Access tree structure, And-Or Graph, Attribute Based Encryption, Monotone structure.

  • Important and sensitivity data of users in a third party managed internet or cloud always pose various security as well as privacy issues. Attribute-based encryption (ABE) is a pleasant trend in the literature which addresses above problem in an efficient way, and provides data security and fine-grained access control in a decentralized manner,. Key-policy attribute-based encryption (KP-ABE) is an important type of ABE, in which user can decrypt his message with a set of attributes and private keys are embedded with a access control structure which defines which cipher text  an user can be allowed to decrypt. In this paper we use a probabilistic context free grammar with an And-Or structure to represent access control structure. And-Or graph has high expressive power hence access control structure can be represented in an efficient manner.

     

     

  • References

    1. [1] Sahai A. and Waters B., Fuzzy identity based encryption, in Proceedings of the 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Denmark, pp.457-473, 2005

      [2] Vipul Goyal, Omkant Pandey, Amit Sahai, and Brent Waters. Attribute-based encryption for fine-grained access control of encrypted data. In Proceedings of the 13th ACM conference on Computer and communications security, CCS ’06, pages 89–98, New York, NY, USA, 2006.

      [3] Rafail Ostrovsky, Amit Sahai, and Brent Waters. Attribute-based encryption with non-monotonic access structures. In Proceedings of the 14th ACM conference on Computer and communications security, CCS ’07, pages 195–203, New York, NY, USA, 2007.

      [4] John Bethencourt, Amit Sahai, and Brent Waters. Cipher text-policy attribute-based encryption. In IEEE Symposium on Security and Privacy, pages 321–334, 2007.

      [5] Adi Shamir. How to share a secret. Communications of the ACM, Volume 22 Issue 11, Nov.1979,pp 612-613.

      [6] Ling Cheung and Calvin Newport. Provably secure cipher text policy ABE. In Proceedings of the 14th ACM conference on Computer and communications security, CCS ’07, pages 456–465, New York, NY, USA, 2007.

      [7] Vipul Goyal, Abhishek Jain, Omkant Pandey, and Amit Sahai. Bounded cipher text policy attribute based encryption. In Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II, ICALP ’08, pages 579–591, Berlin, Heidelberg, 2008. Springer-Verlag

      [8] Takashi Nishide, Kazuki Yoneyama, and Kazuo Ohta. Attribute-based encryption with partially hidden cipher text policies. IEICE Transactions, 92-A(1):22–32, 2009.

      [9] Song-Chun Zhu, and David Mumford. A stochastic Grammar of Images. Foundations and Trends in Computer Graphics and Vision Vol. 2, No. 4 (2006) 259–362.

      [10] Müller, Katzenbeisser and Eckert, Distributed attribute-based encryption. Information Security and Cryptology–ICISC 2008. Springer Berlin Heidelberg, 2008. 20-36

      [11] Lewko, Allison, and Brent Waters, Decentralizing attribute-based encryption, Advances in Cryptology–EUROCRYPT 2011. Springer Berlin Heidelberg, 2011. 568- 588.

      [12] Beimel. Secure Schemes for Secret Sharing and Key Distribution. PhD thesis, Israel Institute of Technology, Technion, Haifa, Israel, 1996

      [13] Changji Wang and Jianfa Luo, An Efficient Key-Policy Attribute-Based Encryption Scheme with Constant Cipher text Length, Mathematical Problems in Engineering
      Volume 2013 (2013), Article ID 810969.http://dx.doi.org/10.1155/2013/810969

      [14] W. Diffie, M. Hellman.,New directions in cryptography", IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644-654, 1976.

      [15] S Sharmila Deva Selvi, Subhashini Venugopalan, C. Pandu Rangan,On the Security of Attribute Based Signature Schemes. IACR Cryptology ePrint Archive 2012: 62 (2012)

      [16] C. Delerablee.,Identity-based broadcast encryption with constant size cipher texts and private keys,†in Proceedings of the Advances in Cryptology 13th International Conference on Theory and Application of Cryptology and Information Security (ASCIACRYPT '07), vol. 4833 of Lecture Notes in Computer Science,

      [17] John E. Hopcroft , Rajeev Motwani, Jeffrey D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001

  • Downloads

  • How to Cite

    Senthil Kumar, K., & Malathi, D. (2018). A Novel method to represent Access Tree structure by Context Free Grammar with and-or graph in Key Policy based Attribute based Encryption. International Journal of Engineering & Technology, 7(4.10), 396-398. https://doi.org/10.14419/ijet.v7i4.10.20946