论文信息 - Efficient functional encryption and proxy re-cryptography for secure public cloud data sharing

Efficient functional encryption and proxy re-cryptography for secure public cloud data sharing

With the rapid development in cloud computing, public cloud data sharing concept has been extending and expanding by many scholars. In 2014, Liang et al. proposed a general notion for proxy re-encryption (PRE), which is called deterministic finite automata-based functional PRE (DFA-based FPRE). Motivated by the issues of efficiency and flexibility associated with this new primitive, we propose outsourcing decryption scheme to increase the flexibility of users by delegating their decryption rights to the semi trusted proxy. Through analysis we showed that our scheme is provably secure and efficient.

[1] Allison Lewko,et al. Tools for simulating features of composite order bilinear groups in the prime order setting , 2012 .

[2] Allison Bishop,et al. New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques , 2012, CRYPTO.

[3] Matthew Green,et al. Improved proxy re-encryption schemes with applications to secure distributed storage , 2006, TSEC.

[4] Dimitrios Zissis,et al. Addressing cloud computing security issues , 2012, Future Gener. Comput. Syst..

[5] Joseph K. Liu,et al. A DFA-Based Functional Proxy Re-Encryption Scheme for Secure Public Cloud Data Sharing , 2014, IEEE Transactions on Information Forensics and Security.

[6] V. Kavitha,et al. A survey on security issues in service delivery models of cloud computing , 2011, J. Netw. Comput. Appl..

[7] Brent Waters,et al. Functional Encryption for Regular Languages , 2012, CRYPTO.

[8] Jianhua Chen,et al. An efficient certificateless designated verifier signature scheme , 2013, Int. Arab J. Inf. Technol..

[9] Rui Zhang,et al. An efficient identity-based blind signature scheme without bilinear pairings , 2011, Comput. Electr. Eng..