SCIENCE CHINA Information Sciences, Volume 61 , Issue 3 : 038106(2018) https://doi.org/10.1007/s11432-017-9124-0

Secure searchable public key encryption against insider keyword guessing attacks from indistinguishability obfuscation

More info
  • ReceivedMay 23, 2017
  • AcceptedJun 2, 2017
  • PublishedAug 23, 2017


There is no abstract available for this article.


This work was supported in part by National Natural Science Foundation of China (Grant No. 61370203) and National Science and Technology Major Project (Grant No. 2017YFB0802003).


Appendixes A–D.


[1] Boneh D, Di Crescenzo G, Ostrovsky R, et al. Public key encryption with keyword search. In: Advances in Cryptology-Eurocrypt 2004. Berlin: Springer, 2004. 506--522. Google Scholar

[2] Byun J W, Rhee H S, Park H A, et al. Off-line keyword guessing attacks on recent keyword search schemes over encrypted data. In: Proceedings of Workshop on Secure Data Management, Seoul, 2006. 75--83. Google Scholar

[3] Jiang P, Mu Y, Guo F C, et al. Online/offline ciphertext retrieval on resource constrained devices. Comput J, 2016, 59: 955--969. Google Scholar

[4] Cheng R, Yan J B, Guan C W, et al. Verifiable searchable symmetric encryption from indistinguishability obfuscation. In: Proceedings of ACM Symposium on Information, Computer and Communications Security, Singapore, 2015. 621--626. Google Scholar

[5] Zhang Y, Xu C X, Liang X H, et al. Efficient public verification of data integrity for cloud storage systems from indistinguishability obfuscation. IEEE Trans Inf Foren Secur, 2016, 12: 676--688. Google Scholar

[6] Barak B, Goldreich O, Impagliazzo R, et al. On the (im) possibility of obfuscating programs. In: Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, 2001. 1--18. Google Scholar

[7] Garg S, Gentry C, Halevi S, et al. Candidate indistinguishability obfuscation and functional encryption for all circuits. In: Proceedings of IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), Berkeley, 2013. 40--49. Google Scholar