{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:52Z","timestamp":1759637572219},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540383413"},{"type":"electronic","value":"9783540383437"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11836810_17","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T10:36:57Z","timestamp":1159871817000},"page":"233-245","source":"Crossref","is-referenced-by-count":6,"title":["Collusion-Free Policy-Based Encryption"],"prefix":"10.1007","author":[{"given":"Walid","family":"Bagga","sequence":"first","affiliation":[]},{"given":"Refik","family":"Molva","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/978-3-540-40061-5_29","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"S.S. Al-Riyami","year":"2003","unstructured":"Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 452\u2013473. Springer, Heidelberg (2003)"},{"key":"17_CR2","unstructured":"Al-Riyami, S.S.: Cryptographic schemes based on elliptic curve pairings. Ph.D. Thesis, Royal Holloway, University of London (2004)"},{"key":"17_CR3","unstructured":"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\/"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/11507840_7","volume-title":"Financial Cryptography and Data Security","author":"W. Bagga","year":"2005","unstructured":"Bagga, W., Molva, R.: Policy-based cryptography and applications. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 72\u201387. Springer, Heidelberg (2005)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 213\u2013229. Springer, Heidelberg (2001)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Bradshaw, R., Holt, J., Seamons, K.: Concealing complex policies with hidden credentials. Cryptology ePrint Archive, Report 2004\/109 (2004), http:\/\/eprint.iacr.org\/","DOI":"10.1145\/1030083.1030104"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-45831-X_18","volume-title":"Infrastructure Security","author":"L. Chen","year":"2002","unstructured":"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.\u00a02437, pp. 260\u2013275. Springer, Heidelberg (2002)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/11523468_64","volume-title":"Automata, Languages and Programming","author":"D. Galindo","year":"2005","unstructured":"Galindo, D.: Boneh-franklin identity based encryption revisited. In: Caires, L., et al. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 791\u2013802. Springer, Heidelberg (2005)"},{"key":"17_CR9","volume-title":"Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society","author":"J. Holt","year":"2003","unstructured":"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)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-45455-1_3","volume-title":"Algorithmic Number Theory","author":"A. Joux","year":"2002","unstructured":"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.\u00a02369, pp. 20\u201332. Springer, Heidelberg (2002)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1090\/S0002-9939-01-06058-0","volume":"130","author":"J. Kahn","year":"2002","unstructured":"Kahn, J.: Entropy, independent sets and antichains: a new approach to dedekind\u2019s problem. Proc. Amer. Math. Soc.\u00a0130, 371\u2013378 (2002)","journal-title":"Proc. Amer. Math. Soc."},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"677","DOI":"10.2307\/2036446","volume":"21","author":"D. Kleitman","year":"1969","unstructured":"Kleitman, D.: On dedekind\u2019s problem: the number of monotone boolean functions. Proc. Amer. Math. Soc.\u00a021, 677\u2013682 (1969)","journal-title":"Proc. Amer. Math. Soc."},{"key":"17_CR13","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/872035.872061","volume-title":"Proceedings of the 22nd annual symposium on Principles of distributed computing","author":"N. Li","year":"2003","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. In: Proceedings of the 22nd annual symposium on Principles of distributed computing, pp. 182\u2013189. ACM Press, New York (2003)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-36563-X_8","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"N.P. Smart","year":"2003","unstructured":"Smart, N.P.: Access control using pairing based cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 111\u2013121. Springer, Heidelberg (2003)"},{"key":"17_CR15","unstructured":"Yacobi, Y.: A note on the bilinear diffie-hellman assumption. Cryptology ePrint Archive, Report 2002\/113 (2002), http:\/\/eprint.iacr.org\/"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11836810_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,1]],"date-time":"2021-08-01T19:06:22Z","timestamp":1627844782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11836810_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540383413","9783540383437"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11836810_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}