ACM Home Page
Please provide us with feedback. Feedback
Provably secure and efficient bounded ciphertext policy attribute based encryption
Full text PdfPdf (895 KB)
Source
ASIAN ACM Symposium on Information, Computer and Communications Security archive
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security table of contents
Sydney, Australia
SESSION: Public key and hash functions table of contents
Pages 343-352  
Year of Publication: 2009
ISBN:978-1-60558-394-5
Authors
Xiaohui Liang  Shanghai Jiao Tong University
Zhenfu Cao  Shanghai Jiao Tong University
Huang Lin  Shanghai Jiao Tong University
Dongsheng Xing  Shanghai Jiao Tong University
Sponsor
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 106,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1533057.1533102
What is a DOI?

ABSTRACT

Ciphertext policy attribute based encryption (CPABE) allows a sender to distribute messages based on an access policy which can be expressed as a boolean function consisting of (OR, AND) gates between attributes. A receiver whose secret key is associated with those attributes could only decrypt a ciphertext successfully if and only if his attributes satisfy the ciphertext's access policy. Fine-grained access control, a new concept mentioned by GPSW in CCS'06 can realize a more delicate access policy which could be represented as an access tree with threshold gates connecting attributes.

In ICALP'08, Goyal et al. design a bounded CPABE (denoted as GJPS) with fine-grained access policy which can be proven secure under a number-theoretic assumption. In this paper, we improve their scheme by providing faster encryption / decryption algorithm and shortened ciphertext size. Moreover, we use one-time signature technique to obtain a chosen ciphertext secure extension and give its complete security proof in the standard model under traditional Decisional Bilinear Diffie-Hellman (DBDH) assumption and strong existential unforgeability of one-time signature scheme.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Dan Boneh and Xavier Boyen. Efficient selective-id secure identity-based encryption without random oracles. In EUROCRYPT, pages 223--238, 2004.
 
3
Dan Boneh and Xavier Boyen. Secure identity based encryption without random oracles. In CRYPTO, pages 443--459, 2004.
 
4
 
5
Ran Canetti, Shai Halevi, and Jonathan Katz. Chosen-ciphertext security from identity-based encryption. In EUROCRYPT, pages 207--222, 2004.
6
 
7
 
8
 
9
 
10
11
12
 
13
Amit Sahai and Brent Waters. Fuzzy identity-based encryption. In EUROCRYPT, pages 457--473, 2005.
 
14
Brent Waters. Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In Cryptology ePrint Archive: 2008 / 290, 2008.

Collaborative Colleagues:
Xiaohui Liang: colleagues
Zhenfu Cao: colleagues
Huang Lin: colleagues
Dongsheng Xing: colleagues