Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003)
Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings. Ph.D. Thesis, Royal Holloway, University of London (2004)
Al-Riyami, S.S., Malone-Lee, J., Smart, N.P.: Escrow-free encryption supporting cryptographic workflow. Cryptology ePrint Archive, Report 2004/258 (2004), http://eprint.iacr.org/
Bagga, W., Molva, R.: Policy-based cryptography and applications. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol. 3570, pp. 72–87. Springer, Heidelberg (2005)
Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001)
Bradshaw, R., Holt, J., Seamons, K.: Concealing complex policies with hidden credentials. Cryptology ePrint Archive, Report 2004/109 (2004), http://eprint.iacr.org/
Chen, L., Harrison, K., Soldera, D., Smart, N.P.: Applications of multiple trust authorities in pairing based cryptosystems. In: Davida, G.I., Frankel, Y., Rees, O. (eds.) InfraSec 2002. LNCS, vol. 2437, pp. 260–275. Springer, Heidelberg (2002)
Galindo, D.: Boneh-franklin identity based encryption revisited. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 791–802. Springer, Heidelberg (2005)
Holt, J., Bradshaw, R., Seamons, K.E., Orman, H.: Hidden credentials. In: Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society, ACM Press, New York (2003)
Joux, A.: The weil and tate pairings as building blocks for public key cryptosystems. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 20–32. Springer, Heidelberg (2002)
Kahn, J.: Entropy, independent sets and antichains: a new approach to dedekind’s problem. Proc. Amer. Math. Soc. 130, 371–378 (2002)
Kleitman, D.: On dedekind’s problem: the number of monotone boolean functions. Proc. Amer. Math. Soc. 21, 677–682 (1969)
Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. In: Proceedings of the 22nd annual symposium on Principles of distributed computing, pp. 182–189. ACM Press, New York (2003)
Smart, N.P.: Access control using pairing based cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 111–121. Springer, Heidelberg (2003)
Yacobi, Y.: A note on the bilinear diffie-hellman assumption. Cryptology ePrint Archive, Report 2002/113 (2002), http://eprint.iacr.org/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagga, W., Molva, R. (2006). Collusion-Free Policy-Based Encryption. In: Katsikas, S.K., López, J., Backes, M., Gritzalis, S., Preneel, B. (eds) Information Security. ISC 2006. Lecture Notes in Computer Science, vol 4176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11836810_17
Download citation
DOI: https://doi.org/10.1007/11836810_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38341-3
Online ISBN: 978-3-540-38343-7
eBook Packages: Computer ScienceComputer Science (R0)