Anonymous proxy re-encryption

Security and Communication Networks

Volumn 5, Issue 5, 2012, Pages 439-449

  Shao, Jun ^a   Liu, Peng ^b   Wei, Guiyi ^a   Ling, Yun ^a  

^a ZHEJIANG GONGSHANG UNIVERSITY   (China)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Anonymity; Chosen ciphertext security; Collusion resistance; Proxy re encryption; Random oracle model

Indexed keywords

FILE ORGANIZATION; PUBLIC KEY CRYPTOGRAPHY;

ANONYMITY; CHOSEN CIPHERTEXT SECURITY; COLLUSION RESISTANCE; PROXY RE ENCRYPTIONS; RANDOM ORACLE MODEL;

SECURITY OF DATA;

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

References (27)

1. Ateniese G, Fu K, Green M, Hohenberger S. Improved proxy re-encryption schemes with applications to secure distributed storage. In NDSS 2005, San Diego, California, USA. The Internet Society 2005, 2005; 29-43.
2. 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.
3. Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography. In EUROCRYPT 1998, LNCS, Vol. 1403. Springer: Heidelberg, 1998; 127-144.
4. Ivan A, Dodis Y. Proxy cryptography revisited. In NDSS 2003, San Diego, California, USA. The Internet Society 2003, 2003; 174-193.
5. Green M, Ateniese G. Identity-based proxy re-encryption. In ACNS 2007, LNCS, Vol. 4521. Springer: Heidelberg, 2007; 288-306. Full version: Cryptology ePrint Archieve: Report 2006/473.
6. Hohenberger S, Rothblum G, Shelat A, Vaikuntanathan V. Securely obfuscating re-encryption. In TCC 2007, LNCS, Vol. 4392. Springer: Heidelberg, 2007; 233-252.
7. Canetti R, Hohenberger S. Chosen-ciphertext secure proxy re-encryption. In ACM CCS 2007, 2007; 185-194. ACM New York, NY, USA. Full version: Cryptology ePrint Archieve: Report 2007/171.
8. Weng J, Deng RH, Liu S, Chen K, Lai J, Wang X. Chosen-ciphertext secure proxy re-encryption schemes without pairings. In CANS 2008, LNCS, Vol. 5339. Springer: Heidelberg, 2008; 1-17.
9. Shao J, Cao Z. CCA-secure proxy re-encryption without pairings. In PKC 2009, LNCS, Vol. 5443. Springer: Heidelberg, 2009; 357-376.
10. Chow S, Weng J, Yang Y, Deng R. Efficient unidirectional proxy re-encryption. In Africacrypt 2010, LNCS, Vol. 6055. Springer: Heidelberg, 2010; 316-332. Full version:
11. Ateniese G, Benson K, Hohenberger S. Key-private proxy re-encryption. In RSA 2009, LNCS, Vol. 5473. Springer: Heidelberg, 2009; 279-294.
12. Libert B, Vergnaud D. Unidirectional chosen-ciphertext secure proxy re-encryption. In PKC 2008, LNCS, Vol. 4939. Springer: Heidelberg, 2008; 360-379.
13. Weng J, Chen M, Yang Y, Deng R, Chen K, Bao F. CCA-secure unidirectional proxy re-encryption in the adaptive corruption model without random oracles. Science China Information Sciences 2010; 53(3): 593- 606. Updated version:
14. Shao J, Cao Z, Liu P. SCCR: a generic approach to simultaneously achieve CCA security and collusion-resistance in proxy re-encryption. Security and Communication Networks 2011; 4(2): 122-135.
15. Shao J, Cao Z, Liu P. CCA-secure PRE scheme without random oracles; Cryptology ePrint Archive
16. Zhao G, Fang L, Wang J, Ge C, Ren Y. Improved unidirectional chosen-ciphertext secure proxy re-encryption. In 2010 IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS), Beijing, China 2010; 476-480.
17. Zhang L, Wang XA, Wang W. Toward CCA-secure bidirectional proxy re-encryption without pairing nor random oracle. In 2nd International Conference on Signal Processing Systems (ICSPS), Dalian, China Vol. 1, 2010; V1-599-V1-602.
18. Jia X, Shao J, Jing J, Liu P. CCA-secure type-based proxy re-encryption with invisible proxy. In IEEE CIT 2010, Bradford, West Yorkshire, UK, 2010; 1299-1305.
19. Hu J, Wang XA, Zhang M. Toward constant size CCA-secure multi-hop proxy re-encryption. In 2nd International Conference on Signal Processing Systems (ICSPS), Dalian, China 2010; V1-603-V1-605.
20. Schnorr C. Efficient identifications and signatures for smart cards. In CRYPTO 1998, LNCS, Vol. 435. Springer: Heidelberg, 1998; 239-251.
21. ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 1985; 31(4): 469-472.
22. Fujisaki E, Okamoto T. Secure integration of asymmetric and symmetric encryption schemes. In CRYPTO 1999, LNCS, Vol. 1666. Springer: Heidelberg, 1999; 537-554.
23. Bellare M, Boldyreva A, Desai A, Pointcheval D. Key-privacy in public-key encryption. In Asiacrypt 2001, LNCS, Vol. 2248. Springer: Heidelberg, 2001; 566-582.
24. Cramer R, Shoup V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In CRYPTO 1998, LNCS, Vol. 1462. Springer: Heidelberg, 1998; 13-25.
25. Shi E, Bethencourt J, Chan HTH, Song D, Perrig A. Multi-dimensional range query over encrypted data. In S & P 2007, Claremont Resort, Berkeley, CA, USA, 2007; 350-364.
26. Kiltz E. Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman. In PKC 2007, LNCS, Vol. 4450. Springer: Heidelberg, 2007; 282-297.
27. Gentry C. Fully homomorphic encryption using ideal lattices. In ACM STOC 2009. ACM New York, NY, USA, 2009; 169-178.