کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
424160 | 685347 | 2007 | 14 صفحه PDF | دانلود رایگان |
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.
Journal: Electronic Notes in Theoretical Computer Science - Volume 171, Issue 1, 14 April 2007, Pages 107-120