| An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription |
| Full text |
Pdf
(137 KB)
|
| Source
|
Conference on Information and Knowledge Management
archive
Proceedings of the 14th ACM international conference on Information and knowledge management
table of contents
Bremen, Germany
POSTER SESSION: Poster Session
table of contents
Pages: 285 - 286
Year of Publication: 2005
ISBN:1-59593-140-6
|
|
Author
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 5, Downloads (12 Months): 44, Citation Count: 4
|
|
|
ABSTRACT
The time-bound hierarchical key assignment problem is to assign time sensitive keys to security classes in a partially ordered hierarchy so that legal data accesses among classes can be enforced. Two time-bound hierarchical key assignment schemes have been proposed in the literature, but both of them were proved insecure against collusive attacks. In this paper, we will propose an RSA-based time-bound hierarchical key assignment scheme and describe its possible application. The security analysis shows that the new scheme is safe against the collusive attacks.
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
|
|
| |
3
|
H. Chien and J. Jan. New hierarchical assignment without public key cryptography. Computers & Security, 22:523--526, 2003.
|
| |
4
|
|
| |
5
|
|
| |
6
|
A. Santis, A. Ferrara, and B. Masucci. On the insecurity of a time-bound hierarchical key assignment scheme. Tech. Report, Dept. of Math., University of Waterloo, cacr2005-07.ps, 2005.
|
| |
7
|
|
| |
8
|
J. Yeh, R. Chow, and R. Newman. A key assignment for enforcing access control policy exceptions. In International Sympo. on Internet Technology, pages 54--59, 1998.
|
| |
9
|
X. Yi and Y. Ye. Security of tzeng's time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE Trans. on Knowledge & Data Engineering, 15:1054--1055, 2003.
|
CITED BY 4
|
|
Giuseppe Ateniese , Alfredo De Santis , Anna Lisa Ferrara , Barbara Masucci, Provably-secure time-bound hierarchical key assignment schemes, Proceedings of the 13th ACM conference on Computer and communications security, October 30-November 03, 2006, Alexandria, Virginia, USA
|
|
|
|
|
|
|
|
|
|
|