Attribute-based encryption with efficient verifiable outsourced decryption

IEEE Transactions on Information Forensics and Security

Volumn 10, Issue 7, 2015, Pages 1384-1393

  Qin, Baodong ^a,b,c   Deng, Robert H ^b   Liu, Shengli ^a   Ma, Siqi ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

^c SOUTHWEST UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Attributed based encryption; data sharing; verifiability

Indexed keywords

MOBILE SECURITY; SECURITY OF DATA;

ATTRIBUTE-BASED ENCRYPTIONS; ATTRIBUTED-BASED ENCRYPTIONS; CIPHERTEXT POLICIES; COMPUTATION COSTS; DATA SHARING; ENCRYPTION ALGORITHMS; HASH COMPUTATION; VERIFIABILITY;

CRYPTOGRAPHY;

EID: 84930201567     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2015.2410137     Document Type: Article

References (22)

1. A. Sahai and B. Waters, "Fuzzy identity-based encryption," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 3494, R. Cramer, Ed. Berlin, Germany: Springer-Verlag, 2005, pp. 457-473.
2. V. Goyal, O. Pandey, A. Sahai, and B. Waters, "Attribute-based encryption for fine-grained access control of encrypted data," in Proc. ACM Conf. Comput. Commun. Secur., 2006, pp. 89-98.
3. J. Bethencourt, A. Sahai, and B. Waters, "Ciphertext-policy attributebased encryption," in Proc. IEEE Symp. Secur. Privacy, May 2007, pp. 321-334.
4. B. Waters, "Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization," in Public Key Cryptography (Lecture Notes in Computer Science), vol. 6571, D. Catalano, N. Fazio, R. Gennaro, and A. Nicolosi, Eds. Berlin, Germany: Springer-Verlag, 2011, pp. 53-70.
5. Y. Rouselakis and B. Waters, "Practical constructions and new proof methods for large universe attribute-based encryption," in Proc. ACM Conf. Comput. Commun. Secur., 2013, pp. 463-474.
6. L. Cheung and C. Newport, "Provably secure ciphertext policy ABE," in Proc. ACM Conf. Comput. Commun. Secur., 2007, pp. 456-465.
7. N. Attrapadung, J. Herranz, F. Laguillaumie, B. Libert, E. de Panafieu, and C. Ràfols, "Attribute-based encryption schemes with constant-size ciphertexts," Theoretical Comput. Sci., vol. 422, pp. 15-38, Mar. 2012.
8. M. Green, S. Hohenberger, and B. Waters, "Outsourcing the decryption of ABE ciphertexts," in Proc. 20th USENIX Secur. Symp., 2011, p. 34.
9. J. Lai, R. H. Deng, C. Guan, and J. Weng, "Attribute-based encryption with verifiable outsourced decryption," IEEE Trans. Inf. Forensics Security, vol. 8, no. 8, pp. 1343-1354, Aug. 2013.
10. R. Gennaro, C. Gentry, and B. Parno, "Non-interactive verifiable computing: Outsourcing computation to untrusted workers," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 6223, T. Rabin, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 465-482.
11. K.-M. Chung, Y. Kalai, and S. Vadhan, "Improved delegation of computation using fully homomorphic encryption," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 6223, T. Rabin, Ed. Berlin, Germany: Springer-Verlag, 2010, pp. 483-501.
12. B. Chevallier-Mames, J.-S. Coron, N. McCullagh, D. Naccache, and M. Scott, "Secure delegation of elliptic-curve pairing," in Smart Card Research and Advanced Application (Lecture Notes in Computer Science), vol. 6035, D. Gollmann, J.-L. Lanet, and J. Iguchi-Cartigny, Eds. Berlin, Germany: Springer-Verlag, 2010, pp. 24-35.
13. C. Gentry, "Fully homomorphic encryption using ideal lattices," in Proc. STOC, 2009, pp. 169-178.
14. C. Gentry and S. Halevi, "Implementing Gentry's fully-homomorphic encryption scheme," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 6632, K. G. Paterson, Ed. Berlin, Germany: Springer-Verlag, 2011, pp. 129-148.
15. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," in Proc. CCS, 1993, pp. 62-73.
16. J. Li, X. Huang, J. Li, X. Chen, and Y. Xiang, "Securely outsourcing attribute-based encryption with checkability," IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 4, pp. 2201-2210, Aug. 2014. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs-all.jsp?arnumber=6642027
17. A. Beimel, "Secure schemes for secret sharing and key distribution," Ph.D. dissertation, Dept. Comput. Sci., Israel Inst. Technol., Haifa, Israel, 1996.
18. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM J. Comput., vol. 38, no. 1, pp. 97-139, 2008.
19. V. Shoup, "Sequences of games: A tool for taming complexity in security proofs," Dept. Comput. Sci., New York Univ., New York, NY, USA, Tech. Rep. 2004/332, 2004. [Online]. Available: http://eprint.iacr.org/
20. R. Canetti, H. Krawczyk, and J. B. Nielsen, "Relaxing chosen-ciphertext security," in Advances in Cryptology (Lecture Notes in Computer Science), vol. 2729, D. Boneh, Ed. Berlin, Germany: Springer-Verlag, 2003, pp. 565-582.
21. B. Lynn. The Stanford Pairing Based Crypto Library. [Online]. Available: http://crypto.stanford.edu/pbc, accessed May 7, 2014.
22. M. Green, A. Akinyele, and M. Rushanan. libfenc: The Functional Encryption Library. [Online]. Available: http://code.google.com/ p/libfenc, accessed May 7, 2014.