Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Applications of Multiple Trust Authorities in Pairing Based Cryptosystems
InfraSec '02 Proceedings of the International Conference on Infrastructure Security
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Oblivious signature-based envelope
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Access control using pairing based cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Boneh-Franklin identity based encryption revisited
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Policy-based cryptography and applications
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Efficient Multi-authorizer Accredited Symmetrically Private Information Retrieval
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
PBES: a policy based encryption system with application to data sharing in the power grid
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Accredited symmetrically private information retrieval
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Policy-based authentication for mobile agents
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Hi-index | 0.00 |
A policy-based encryption scheme allows a user to encrypt a message with respect to a credential-based policy formalized as monotone boolean expression written in standard normal form. The encryption is so that only a user having access to a qualified set of credentials for the policy is able to successfully decrypt the message. An inherent property of policy-based encryption is that in addition to the recipient an encrypted message is intended for, any collusion of credential issuers or end users who are able to collect a qualified set of credentials for the policy used to encrypt the message can decrypt it as well. In some applications, the collusion property may be acceptable or even useful. However, for most other applications it is undesirable. In this paper, we present a collusion-free policy-based encryption primitive, called policy-based public-key encryption. We provide precise definition for the new primitive as well as for the related security model. Then, we describe a concrete implementation using pairings over elliptic curves and prove its security in the random oracle model.