Collusion-free policy-based encryption

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4176 LNCS, Issue , 2006, Pages 233-245

  Bagga, Walid ^a   Molva, Refik ^a  

^a EURECOM   (France)

Author keywords

Credentials; Pairing Based Cryptography; Policy

Indexed keywords

BOOLEAN ALGEBRA; MATHEMATICAL MODELS; RANDOM PROCESSES; SECURITY OF DATA; SECURITY SYSTEMS;

BOOLEAN EXPRESSION; POLICY BASED ENCRYPTION; SECURITY MODEL; STANDARD NORMAL FORM;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33750274790     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11836810_17     Document Type: Conference Paper

References (15)

1. S. Al-Riyami and K. Paterson. Certificateless public key cryptography. In ASIACRYPT, pages 452-473. Springer-Verlag, 2003.
2. S.S. Al-Riyami. Cryptographic schemes based on elliptic curve pairings. Ph.D. Thesis, Royal Holloway, University of London, 2004.
3. S.S. Al-Riyami, J. Malone-Lee, and N.P. Smart. Escrow-free encryption supporting cryptographic workflow. Cryptology ePrint Archive, Report 2004/258, 2004. http://eprint.iacr.org/.
4. 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.
5. D. Boneh and M. Franklin. Identity-based encryption from the weil pairing. In Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, pages 213-229. Springer-Verlag, 2001.
6. R. Bradshaw, J. Holt, and K. Seamons. Concealing complex policies with hidden credentials. Cryptology ePrint Archive, Report 2004/109, 2004. http://eprint.iacr.org/.
7. L. Chen, K. Harrison, D. Soldera, and N. Smart. Applications of multiple trust authorities in pairing based cryptosystems. In Proceedings of the International Conference on Infrastructure Security, pages 260-275. Springer-Verlag, 2002.
8. D. Galindo. Boneh-franklin identity based encryption revisited. To appear in Proceedings of 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005).
9. J. Holt, R. Bradshaw, K. E. Seamons, and H. Orman. Hidden credentials. In Proc. of the 2003 ACM Workshop on Privacy in the Electronic Society. ACM Press, 2003.
10. A. Joux. The weil and tate pairings as building blocks for public key cryptosystems. In Proceedings of the 5th International Symposium on Algorithmic Number Theory, pages 20-32. Springer-Verlag, 2002.
11. J. Kahn. Entropy, independent sets and antichains: a new approach to dedekind's problem. In Proc. Amer. Math. Soc. 130, pages 371-378, 2002.
12. D. Kleitman. On dedekind's problem: the number of monotone boolean functions. In Proc. Amer. Math. Soc. 21, pages 677-682, 1969.
13. N. Li, W. Du, and D. Boneh. Oblivious signature-based envelope. In Proceedings of the 22nd annual symposium on Principles of distributed computing, pages 182-189. ACM Press, 2003.
14. N. Smart. Access control using pairing based cryptography. In Proceedings CT-RSA 2003, pages 111-121. Springer-Verlag LNCS 2612, April 2003.
15. Y. Yacobi. A note on the bilinear diffie-hellman assumption. Cryptology ePrint Archive, Report 2002/113, 2002. http://eprint.iacr.org/.