Earticle

초록

영어

In this work, we design a method for efficient revocation within Ciphertext-Policy Attribute-Based Encryption scheme. Our main technical innovation is based on linear secret sharing and binary tree techniques, every user in system is assigned with both a set of attributes and a unique identifier. Any user can also be efficiently revoked by using this identifier. Furthermore, this technique resulted in two key contributions: the size of the cryptographic key material is smaller and encryption/decryption cannot be affected with an unbounded number of revoked users. Then, the scheme is proved to be secure under the q-MEBDH assumption in the standard model. The efficiency is also optimized that the size of user’s private key has only a constant increase. The revocation information is embedded in the ciphertext so that the fine-grained access control is more flexible.

목차

Abstract
 1. Introduction
 2. Preliminaries
  2.1 Linear Secret Sharing Schemes (LSSS) [22]
  2.2. Revocation Scheme for CP-ABE
  2.3 Security Model for Revocation Scheme for CP-ABE
 3. Our More Efficient Construction
 4. Security and Efficiency
  4.1. q-MEBDH Assumption [21]
  4.2. Security Analysis
  4.3. Efficiency
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Yang Li [ College of Information, Central University of Finance and Economics, Beijing, 100081, China ]
• Jianming Zhu [ College of Information, Central University of Finance and Economics, Beijing, 100081, China ]
• Xiuli Wang [ College of Information, Central University of Finance and Economics, Beijing, 100081, China ]
• Yanmei Chai [ College of Information, Central University of Finance and Economics, Beijing, 100081, China ]
• Shuai Shao [ China Information Technology Security Evaluation Center ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Security and Its Applications

• 간기

  격월간

• pISSN

  1738-9976

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605