SCCR: A generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption

Security and Communication Networks

Volumn 4, Issue 2, 2011, Pages 122-135

  Shao, Jun ^a,b   Cao, Zhenfu ^a   Liu, Peng ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

CCA security; Collusion resistance; Generic construction; Standard model; Unidirectional proxy re encryption

Indexed keywords

FILE ORGANIZATION; SECURITY OF DATA;

CCA SECURITIES; COLLUSION RESISTANCE; GENERIC CONSTRUCTION; PROXY RE ENCRYPTIONS; STANDARD MODEL;

CRYPTOGRAPHY;

EID: 79251541771     PISSN: 19390114     EISSN: 19390122     Source Type: Journal    
DOI: 10.1002/sec.109     Document Type: Article

References (43)

1. Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In EUROCRYPT 1998, Lecture Notes in Computer Science, Vol. 1403, 1998; 127-144.
2. Ateniese G, Fu K, Green M, Hohenberger S. Improved proxy re-encryption schemes with applications to secure distributed storage. In Internet Society (ISOC): NDSS 2005, 2005; 29-43.
3. Ateniese G, Fu K, Green M, Hohenberger S. Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Transactions on Information and System Security (TISSEC) 2006; 9(1): 1-30.
4. Ivan A, Dodis Y. Proxy cryptography revisited. In Internet Society (ISOC): NDSS 2003, 2003.
5. Khurana H, Koleva R. Scalable security and accounting services for content-based publish subscribe systems. International Journal of E-Business Research 2006; 2 (3) 1-16.
6. Chiu Y-P, Lei C-L, Huang C-Y. Secure multicast using proxy encryption. In ICICS 2005, Lecture Notes in Computer Science, Vol. 3783, 2005; 280-290
7. Khurana H, Slagell A, Bonilla R. Sels: a secure e-mail list service. In ACM SAC 2005, 2005; 306-313
8. Khurana H, Hahm H-S. Certified mailing lists. In ASIACCS 2006, 2006; 46-58
9. Smith T. DVD jon: buy drm-less tracks from apple itunes. 2005.
10. Taban G, Cárdenas AA, Gligor VD. Towards a secure and interoperable drm architecture. In ACM DRM 2006, 2006; 69-78.
11. Talmy A, Dobzinski O. Abuse freedom in access control schemes. In AINA 2006, 2006; 77-86.
12. Heydt-Benjamin TS, Chae H, Defend B, Fu K. Privacy for public transportation. In PET 2006, Lecture Notes in Computer Science, Vol. 4258, 2005; 1-19.
13. Hohenberger S, Rothblum GN, Shelat A, Vaikuntanathan V. Securely obfuscating re-encryption. In TCC 2007, Lecture Notes in Computer Science, Vol. 4392, 2007; 233-252.
14. Hada S. Zero-knowledge and code obfuscation. In ASIACRYPT 2000, Lecture Notes in Computer Science, Vol. 1976, 2000; 443-457.
15. Goldwasser S, Kalai YT. On the impossibility of obfuscation with auxiliary input. In FOCS 2005, 2005; 553-562.
16. Barak B, Goldreich O, Impagliazzo R, et al. On the (im)possibility of obfuscating programs. In CRYPTO 2001, Lecture Notes in Computer Science, Vol. 2139, 2001; 1-18.
17. Canetti R, Hohenberger S. Chosen-ciphertext secure proxy re-encryption. In ACM CCS 2007, 2007. Full version: Cryptology ePrint Archieve: Report 2007/171.
18. Green M, Ateniese G. Identity-based proxy re-encryption. In ACNS 2007, Lecture Notes in Computer Science, Vol. 4521, 2007; 288-306. Full version: Cryptology ePrint Archieve: Report 2006/473.
19. Libert B, Vergnaud D. Unidirectional chosen-ciphertext secure proxy re-encryption. In PKC 2008, Lecture Notes in Computer Science, Vol. 4939, 2008; 360-379.
20. Shao J, Cao Z. Cca-secure proxy re-encryption without pairings. In PKC 2009, Lecture Notes in Computer Science, Vol. 5443, 2009; 357-376.
21. Camenisch J, Stadler M. Efficient group signature schemes for large groups. In CRYPTO 1997, Lecture Notes in Computer Science, Vol. 1296, 1997; 410-424.
22. Ateniese G, Camenisch J, Joye M, Tsudik G. A practical and provably secure coalition-resistant group signature scheme. In CRYPTO 2000, Lecture Notes in Computer Science, Vol. 1880, 2000; 255-270.
23. Shamir A. Identity-based cryptosystems and signature schemes. In CRYPTO 1984, Lecture Notes in Computer Science, Vol. 196, 1984; 47-53.
24. Weng J, Deng RH, Liu S, Chen K, Lai J, Wang X. Chosen-ciphertext secure proxy re-encryption schemes without pairings. In CANS 2008, Lecture Notes in Computer Science, Vol. 5339, 2008; 1-17.
25. Jakobsson M. On quorum controlled asymmetric proxy re-encryption. In PKC 1999, Lecture Notes in Computer Science, Vol. 1560, 1999; 112-121.
26. Zhou L, Marsh MA, Schneider FB, Redz A. Distributed blinding for distributed elgamal re-encryption. In Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05), 2005; 824-834.
27. Chu C, Tzeng W. Identity-based proxy re-encryption without random oracles. In ISC 2007, Lecture Notes in Computer Science, Vol. 4779, 2007; 189-202.
28. Kirtane V, Rangan CP. Rsa-tbos signcryption with proxy re-encryption. In ACM DRM 2008, 2008; 59-66.
29. Bresson E, Catalano D, Pointcheval D. A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In ASIACRYPT 2003, Lecture Notes in Computer Science, Vol. 2894, 2003; 37-54.
30. Fujisaki E, Okamoto T. How to enhance the security of public-key encryption at minimum cost. In PKC 1999, Lecture Notes in Computer Science, Vol. 1560, 1999; 53-68.
31. Fujisaki E, Okamoto T. Secure integration of asymmetric and symmetric encryption schemes. In CRYPTO 1999, Lecture Notes in Computer Science, Vol. 1666, 1999; 537-554.
32. Shoup V, Gennaro R. Securing threshold cryptosystems against chosen ciphertext attack. In EUROCRYPT 1998, Lecture Notes in Computer Science, Vol. 1430, 1998; 1-16.
33. Boneh D, Boyen X, Halevi S. Chosen ciphertext secure public key threshold encryption without random oracless. In CT-RSA 2006, Lecture Notes in Computer Science, Vol. 3860, 2006; 226-243.
34. Ishihara T, Aono H, Hongo S, Shikata J. Construction of threshold (hybrid) encryption in the random oracle model: How to construct secure threshold tag-kem from weakly secure threshold kem. In ACISP 2007, Lecture Notes in Computer Science, Vol. 4586, 2007; 259-273.
35. Fouque PA, Pointcheval D. Sharing decryption in the context of voting or lotteries. In FC 2000, Lecture Notes in Computer Science, Vol. 1962, 2000; 90-104.
36. Fouque PA, Pointcheval D. Threshold cryptosystems secure against chosen-ciphertext attacks. In ASIACRYPT 2001, Lecture Notes in Computer Science, Vol. 2248, 2002; 351-368.
37. Katz J, Yung M. Threshold cryptosystems based on factoring. In ASIACRYPT 2002, Lecture Notes in Computer Science, Vol. 2501, 2002; 192-205.
38. Canetti R, Goldwasser S. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In EUROCRYPT 1999, Lecture Notes in Computer Science, Vol. 1592, 1999; 90-106.
39. Waters B. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005, Lecture Notes in Computer Science, Vol. 3494, 2005; 114-127.
40. Baek J, Zheng Y. Identity-based threshold decryption. In PKC 2004, Lecture Notes in Computer Science, Vol. 2947, 2004; 262-276.
41. Gentry C, Silverberg A. Hierarchical id-based cryptography. In ASIACRYPT 2002, Lecture Notes in Computer Science, Vol. 2501, 2002; 548-566.
42. Boyen X, Waters B. Anonymous hierarchical identity-based encryption (without random oracles). In CRYPTO 2006, Lecture Notes in Computer Science, Vol. 4117, 2006; 290-307.
43. Boneh D, Boyen X, Goh EJ. Hierarchical identity based encryption with constant size ciphertext. In CRYPTO 2005, Lecture Notes in Computer Science, Vol. 3493, 2005; 440C456.