Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Policy-hiding access control in open environment
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Automated trust negotiation using cryptographic credentials
Proceedings of the 12th ACM conference on Computer and communications security
OACerts: Oblivious Attribute Certificates
IEEE Transactions on Dependable and Secure Computing
Private Information: To Reveal or not to Reveal
ACM Transactions on Information and System Security (TISSEC)
Secure and Efficient Trust Negotiation
Computational Intelligence and Security
A Formal Framework for Expressing Trust Negotiation in the Ubiquitous Computing Environment
UIC '08 Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing
Compact and Anonymous Role-Based Authorization Chain
ACM Transactions on Information and System Security (TISSEC)
Practical Secure Evaluation of Semi-private Functions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Automated trust negotiation using cryptographic credentials
ACM Transactions on Information and System Security (TISSEC)
Privacy-preserving trust verification
Proceedings of the 15th ACM symposium on Access control models and technologies
Modeling and negotiating service quality
Service research challenges and solutions for the future internet
A construction for general and efficient oblivious commitment based envelope protocols
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Point-based trust: define how much privacy is worth
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
OACerts: oblivious attribute certificates
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
A new approach to hide policy for automated trust negotiation
IWSEC'06 Proceedings of the 1st international conference on Security
Constant-Round private function evaluation with linear complexity
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 0.00 |
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather than the identity) of the requester, via digital credentials: Access is granted if Alice's credentials satisfy Bob's access policy. The literature contains many scenarios in which it is desirable to carry out such trust negotiations in a privacy-preserving manner, i.e., so as minimize the disclosure of credentials and/or of access policies. Elegant solutions were proposed for achieving various degrees of privacy-preservation through minimal disclosure. In this paper, we present an efficient protocol that protects both sensitive credentials and policies. That is, Alice gets the resource only if she satisfies Bob's policy, Bob does not learn anything about Alice's credentials (not even whether Alice got access or not), and Alice learns neither Bob's policy structure nor which credentials caused her to gain access.