Paper Info
Title
Privacy-preserving trust verification
Abstract
Distributed and open environments require flexible, scalable and extendible trust verification mechanisms to access resources. To address this, the use of digital credentials as a means for making access decisions has been promoted. The resource owner needs to verify if the requester's credentials satisfy the security policy of the owner. However, such verification becomes a challenging problem when either the requester does not wish to disclose her credentials before the verification is complete, or the owner wishes to keep its security policy confidential from the requester, or both. In addition, the requester may associate a score to each of her credentials based on her perceived level of privacy. Earlier proposals to address this problem limit the owners policy to be a set of credentials. However, real world policies are more complex than a simple set. In this paper, we present three alternative privacy preserving trust verification solutions that protect both the owner's policy and requester's credentials, while at the same time allowing more expressive owner's policies that can be specified as a tree structure. We analyze their computational complexity, communication cost and the amount of disclosure.
Year
DOI
Venue
2010
10.1145/1809842.1809865
SACMAT
Keywords
Field
DocType
real world policy,alternative privacy,expressive owner,access decision,resource owner,privacy-preserving trust verification,owners policy,security policy,challenging problem,trust verification solution,extendible trust verification mechanism,computational complexity,privacy,tree structure,satisfiability,it security
Internet privacy,Confidentiality,Computer security,Computer science,Tree structure,Security policy,Digital credential,Computational complexity theory,Scalability
Conference
Citations 
PageRank 
References 
0
0.34
17
Authors
4
Name
Order
Citations
PageRank
Jaideep Vaidya12778171.18
Vijayalakshmi Atluri23256424.98
Basit Shafiq330726.33
Nabil Adam416213.85