ACM Home Page
Please provide us with feedback. Feedback
ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption
Full text PdfPdf (220 KB)
Source Conference on Computer and Communications Security archive
Proceedings of the 11th ACM conference on Computer and communications security table of contents
Washington DC, USA
SESSION: Cryptographic tools table of contents
Pages: 354 - 363  
Year of Publication: 2004
ISBN:1-58113-961-6
Authors
Danfeng Yao  Brown University, Providence, RI
Nelly Fazio  New York University, New York, NY
Yevgeniy Dodis  New York University, New York, NY
Anna Lysyanskaya  Brown University, Providence, RI
Sponsors
SIGSAC: ACM Special Interest Group on Security, Audit, and Control
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 152,   Citation Count: 7
Additional Information:

abstract   references   cited by   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/1030083.1030130
What is a DOI?

ABSTRACT

A forward-secure encryption scheme protects secret keys from exposure by evolving the keys with time. Forward security has several unique requirements in hierarchical identity-based encryption (HIBE) scheme: (1) users join dynamically; (2) encryption is joining-time-oblivious; (3) users evolve secret keys autonomously.

We present a scalable forward-secure HIBE (fs-HIBE) scheme satisfying the above properties. We also show how our fs-HIBE scheme can be used to construct a forward-secure public-key broadcast encryption scheme, which protects the secrecy of prior transmissions in the broadcast encryption setting. We further generalize fs-HIBE into a collusion-resistant multiple hierarchical ID-based encryption scheme, which can be used for secure communications with entities having multiple roles in role-based access control. The security of our schemes is based on the bilinear Diffie-Hellman assumption in the random oracle model.


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
R. Anderson. Two remarks on public-key cryptology. Invited lecture, 4th ACM Conference on Computer and Communications Security, 1997.
 
3
4
 
5
M. Bellare and B. Yee. Forward security in private-key cryptography. In CT-RSA, volume 2612 of LNCS, pages 1--18.
 
6
D. Boneh and X. Boyen. Efficient selective-ID secure identity-based encryption without random oracles. In Advances in Cryptology -- Eurocrypt '04, volume 3027 of LNCS, pages 223--238.
 
7
D. Boneh and X. Boyen. Secure identity based encryption without random oracles. Crypto '04.
 
8
 
9
D. Boneh and A. Silverberg. Applications of multilinear forms to cryptography. Contemporary Mathematics, 324:71--90, 2003.
 
10
R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In Advances in Cryptology -- Eurocrypt '03, volume 2656 of LNCS, pages 255--271.
 
11
 
12
Y. Dodis and N. Fazio. Public-key broadcast encryption for stateless receivers. In Digital Rights Management -- DRM '02, volume 2696 of LNCS, pages 61--80.
 
13
 
14
 
15
 
16
 
17
 
18
 
19
M. T. Goodrich, J. Z. Sun, and R. Tamassia. Efficient tree-based revocation in groups of low-state devices. In Advances in Cryptology - Crypto '04, LNCS.
 
20
21
 
22
 
23
J. Katz. A forward-secure public-key encryption scheme. Cryptology ePrint Archive, Report 2002/060.
 
24
C. Kim, Y. Hwang, and P. Lee. An efficient public key trace and revoke scheme secure against adaptive chosen ciphertext attack. In Advances in Cryptology -- Asiacrypt 2003, volume 2894 of LNCS, pages 359--373.
 
25
M. Luby and J. Staddon. Combinatorial bounds for broadcast encryption. In Advances in Cryptology -- Eurocrypt '98, volume 1403 of LNCS, pages 512--526.
 
26
 
27
 
28
29
 
30
B. R. Waters. Efficient identity-based encryption without random oracles. Cryptology ePrint Archive, Report 2004/180, 2004.
31
 
32
D. Yao, N. Fazio, Y. Dodis, and A. Lysyanskaya. ID-based encryption for complex hierarchies with applications to forward security and broadcast encryption. Cryptology ePrint Archive, Report 2004/212, 2004.


Collaborative Colleagues:
Danfeng Yao: colleagues
Nelly Fazio: colleagues
Yevgeniy Dodis: colleagues
Anna Lysyanskaya: colleagues