ACM Home Page
Please provide us with feedback. Feedback
Compact and Anonymous Role-Based Authorization Chain
Full text PdfPdf (210 KB)
Source
ACM Transactions on Information and System Security (TISSEC) archive
Volume 12 ,  Issue 3  (January 2009) table of contents
Article No. 15  
Year of Publication: 2009
ISSN:1094-9224
Authors
Danfeng Yao  Rutgers University
Roberto Tamassia  Brown University
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 36,   Downloads (12 Months): 338,   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/1455526.1455528
What is a DOI?

ABSTRACT

We introduce a decentralized delegation model called anonymous role-based cascaded delegation. In this model, a delegator can issue authorizations on behalf of her role without revealing her identity. This type of delegation protects the sensitive membership information of a delegator and hides the internal structure of an organization. To provide an efficient storage and transmission mechanism for credentials used in anonymous role-based cascaded delegation, we present a new digital signature scheme that supports both signer anonymity and signature aggregation. Our scheme has compact role signatures that make it especially suitable for ubiquitous computing environments, where users may have mobile computing devices with narrow communication bandwidth and small storage units.


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
Aringhieri, R., Damiani, E., De Capitani di Vimercati, S., and Samarati, P. 2005. Assessing efficiency of trust management in peer-to-peer systems. In Proceedings of the 1st International Workshop on Collaborative Peer-to-Peer Information Systems (COPS’05).
 
3
 
4
 
5
 
6
 
7
Bellare, M., Micciancio, D., and Warinschi, B. 2003. Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’03). Lecture Notes in Computer Science, vol. 2656. 614--629.
8
 
9
 
10
Boneh, D., Boyen, X., and Shacham, H. 2004. Short group signatures. In Proceedings of the Annual International Cryptology Conference (CRYPTO’04). Lecture Notes in Computer Science.
 
11
 
12
 
13
Boneh, D., Gentry, C., Lynn, B., and Shacham, H. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT’03). 416--432.
 
14
Boneh, D., Gentry, C., and Waters, B. 2005. Collusion resistant broadcast encryption with short ciphertexts and private keys. In Proceedings of the Annual International Cryptology Conference (CRYPTO’05).
 
15
16
 
17
 
18
 
19
Camenisch, J. and Lysyanskaya, A. 2004. Signature schemes and anonymous credentials from bilinear maps. In Proceedings of the Annual International Cryptology Conference (CRYPTO’04).
 
20
21
 
22
Chase, M. and Lysyanskaya, A. 2006. On signatures of knowledge. In Proceedings of the Annual International Cryptology Conference (CRYPTO’06). Lecture Notes in Computer Science, vol. 4117. Springer, 78--96.
23
 
24
 
25
Chaum, D. and van Heijst, E. 1991. Group signatures. In Advances in Cryptology (EUROCRYPT’91). Springer-Verlag, 257--265.
 
26
Chen, X., Zhang, F., and Kim, K. 2003. A new ID-based group signature scheme from bilinear pairings. In Proceedings of the International Workshop on Information Security Applications (WISA’03). K. Chae and M. Yung eds. Lecture Notes in Computer Science, vol. 2908. Springer, 585--592.
 
27
 
28
 
29
Ferraiolo, D. and Kuhn, R. 1992. Role-based access control. In Proceedings of the 15th National Computer Security Conference (NCSC’92).
30
 
31
Frikken, K. B., Li, J., and Atallah, M. J. 2006. Trust negotiation with hidden credentials, hidden policies, and policy cycles. In Proceedings of the 13th Annual Network and Distributed System Security Symposium (NDSS’06).
 
32
Goodrich, M. T., Shin, M., Tamassia, R., and Winsborough, W. H. 2003. Authenticated dictionaries for fresh attribute credentials. In Proceedings of the Trust Management Conference (TRUST’03). Lecture Notes in Computer Science, vol. 2692. Springer, 332--347.
33
 
34
35
 
36
 
37
 
38
Lysyanskaya, A., Micali, S., Reyzin, L., and Shacham, H. 2004. Sequential aggregate signatures from trapdoor permutations. In Proceedings of Advances in Cryptology (EUROCRYPT’04). Lecture Notes in Computer Science, vol. 3027. Springer-Verlag, 74--90.
 
39
 
40
 
41
 
42
 
43
 
44
45
 
46
Winsborough, W. and Li, N. 2004. Safety in automated trust negotiation. In Proceedings of the IEEE Symposium on Security and Privacy (SP’04). IEEE Press, 147--160.
 
47
Yao, D. 2008. An ad hoc trust inference model for flexible and controlled information sharing. In Proceedings of the International Conference on Securiy and Management (SAM’08). 555--561.
48
 
49
Yao, D. and Tamassia, R. 2006. Cascaded authorization with anonymous-signer aggregate signatures. In Proceedings of the IEEE Systems, Man and Cybernetics Information Assurance Workshop (IAW’06). 84--91.
 
50
51

Collaborative Colleagues:
Danfeng Yao: colleagues
Roberto Tamassia: colleagues