On multi-authority ciphertext-policy attribute-based encryption
0
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In classical encryption schemes, data is encrypted under a single key that is associated with a user or group. In Ciphertext-Policy Attribute-Based Encryption(CP-ABE) keys are associated with attributes of users, given to them by a central trusted authority, and data is encrypted under a logical formula over these attributes. We extend this idea to the case where an arbitrary number of independent parties can be present to maintain attributes and their corresponding secret keys. We present a scheme for multi-authority CP-ABE, propose the first two constructions that fully implement the scheme, and prove their security against chosen plaintext attacks.
Abstract
In classical encryption schemes, data is encrypted under a single key that is associated with a user or group. In Ciphertext-Policy Attribute-Based Encryption(CP-ABE) keys are associated with attributes of users, given to them by a central trusted authority, and data is encrypted under a logical formula over these attributes. We extend this idea to the case where an arbitrary number of independent parties can be present to maintain attributes and their corresponding secret keys. We present a scheme for multi-authority CP-ABE, propose the first two constructions that fully implement the scheme, and prove their security against chosen plaintext attacks.
참고문헌 (14)
- A. Beimel, "Secure schemes for secret sharing and key distribution", 박사, Computer Science, pp.1996
- J. Bethencourt, "Ciphertext-policy attribute-based encryption", IEEE Symposium on Security and Privacy, pp.321~334 (2007)
- D.Boneh, "A brief look at pairings based cryptography", FOCS, pp.19~26 (2007), IEEE Computer Society
- D. Boneh, "Short signatures without random oracles and the SDH assumption in bilinear groups", J. Cryptology, 21(2), pp.149~177 (2008)
- M. Chase, "Multi-authority attribute based encryption, Theory of cryptography", Lecture Notes in Comput. Sci, 4392, pp.515~534 (2007), Springer
- L. Cheung, "Provably secure ciphertext policy ABE", ACM Conference on Computer and Communications Security, pp.456~465 (2007), ACM
- S. D. Galbraith, "Pairings for cryptographers", Discrete Appl. Math, 156(16), pp.3113~3121 (2008)
- V. Goyal, "Bounded ciphertext policy attribute based encryption", ICALP, ~ (2008)
- V. Goyal, "Attribute-based encryption for finegrained access control of encrypted data", ACM Conference on Computer and Communications Security, pp.89~98 (2006), ACM
- S. M¨uller, "Distributed attribute-based encryption", 11th International Conference on Information Security and Cryptology (2008)
- A. Sahai, "Fuzzy identity-based encryption, Advances in cryptology—EUROCRYPT 2005", Lecture Notes in Comput. Sci, 3494, pp.457~473 (2005), Springer
- V. Shoup, "Lower bounds for discrete logarithms and related problems, Advances in cryptology—EUROCRYPT ’97", Lecture Notes in Comput. Sci., 1233, pp.256~266 (1997), Springer
- D. R. Stinson, "An explication of secret sharing schemes", Des. Codes Cryptography, 2(4), pp.357~390 (1992)
- Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization, Tech. report, "B. Waters", SRI International, ~ (2008)