Generalized secret sharing and monotone functions
CRYPTO '88 Proceedings on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Generalized Threshold Cryptosystems
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: 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
Concealing complex policies with hidden credentials
Proceedings of the 11th ACM conference on Computer and communications security
PEACE: A Policy-Based Establishment of Ad-hoc Communities
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
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
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
| Hi-index | 0.00 |
A policy-based encryption scheme allows to encrypt a message according to a credential-based policy formalized as monotone Boolean expression written in standard normal form. The encryption is so that only the users having access to a qualified set of credentials for the policy are able to decrypt the message. In this paper, we first revisit the formal definition of policy-based encryption and describe a policy-based encryption scheme from bilinear pairings. Our scheme improves the one proposed in [W. Bagga and R. Molva. Policy-based cryptography and applications. In Proceedings of Financial Cryptography and Data Security (FC'05), volume 3570 of LNCS, pages 72-87. Springer-Verlag, 2005] in terms of ciphertext size, while at the same time preserving the computational efficiency. Then, we describe an application of policy-based encryption in the context of ad-hoc networks. More precisely, we show how the policy-based encryption primitive can be used to achieve a privacy-enhanced secure establishment of ad-hoc communities.