# Witness-Based Searchable Encryption with Aggregative Trapdoor

## Abstract

The well-known open problem in public key encryption with keyword search is how to avoid internal adversaries as the server. Implicitly, the internal attack is implemented as follows. Upon receiving a trapdoor, the probability polynomial time internal adversary can always act as a sender to produce each ciphertext for each keyword if keyword space is bounded by a polynomial of the security parameter. Then, the adversary runs the test algorithm for the trapdoor and all produced ciphertext, and then infer the correct keyword. To overcome this problem, the original framework must be changed slightly. A fundamental goal is creates a secure *bridge* between the sender and receiver. It not only keeps testability of the server, but also avoids imitating a sender. Witness-based searchable encryption (WBSE) is a manner to realize the design goal. In this paper, we formalize an abstracted notion, witness-based searchable encryption with aggregative trapdoor. Under the notion, we present a nearly optimal solution for WBSE under the barrier with trapdoor size proportional to *n* (the number of senders). Comparing with the existing scheme with trapdoor size *O*(*n*), the proposed scheme is based on bilinear map, and offers size only in *n*.

## Keywords

Public key encryption Keyword search Searchable encryption Witness Aggregative trapdoor## References

- 1.Baek, J., Safavi-Naini, R., Susilo, W.: Public key encryption with keyword search revisited. In: International Conference on Computational Science and Its Applications, pp. 1249–1259. Springer (2008)Google Scholar
- 2.Ballard, L., Kamara, S., Monrose, F.: Achieving efficient conjunctive keyword searches over encrypted data. In: International Conference on Information and Communications Security, pp. 414–426. Springer (2005)Google Scholar
- 3.Behnia, R., Heng, S.-H., Tan, S.-Y.: On the security of a certificateless short signature scheme. Malays. J. Math. Sci.
**9**, 103–113 (2015)MathSciNetGoogle Scholar - 4.BingJian, W., TzungHer, C., FuhGwo, J.: Security improvement against malicious server’s attack for a dpeks scheme. Int. J. Technol. Des. Educ.
**1**, 350–353 (2011)Google Scholar - 5.Boneh, D.: The decision Diffie-Hellman problem. In: International Algorithmic Number Theory Symposium, pp. 48–63. Springer (1998)Google Scholar
- 6.Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 506–522. Springer (2004)Google Scholar
- 7.Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Annual International Cryptology Conference, pp. 213–229. Springer (2001)Google Scholar
- 8.Chen, J., Lim, H.W., Ling, S., Wang, H., Wee, H.: Shorter IBE and signatures via asymmetric pairings. In: International Conference on Pairing-Based Cryptography, pp. 122–140. Springer (2012)Google Scholar
- 9.Cheng, L., Jin, Z., Wen, O., Zhang, H.: A novel privacy preserving keyword searching for cloud storage. In: 2013 Eleventh Annual International Conference on Privacy, Security and Trust (PST), pp. 77–81. IEEE (2013)Google Scholar
- 10.Eisenträger, K., Lauter, K., Montgomery, P.L.: Fast elliptic curve arithmetic and improved Weil pairing evaluation. In: Cryptographers’ Track at the RSA Conference, pp. 343–354. Springer (2003)Google Scholar
- 11.Fang, L., Susilo, W., Ge, C., Wang, J.: Public key encryption with keyword search secure against keyword guessing attacks without random oracle. Inf. Sci.
**238**, 221–241 (2013)MathSciNetCrossRefGoogle Scholar - 12.Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 467–476. ACM (2013)Google Scholar
- 13.Hu, C., Liu, P.: A secure searchable public key encryption scheme with a designated tester against keyword guessing attacks and its extension. In: International Conference on Computer Science, Environment, Ecoinformatics, and Education, pp. 131–136. Springer (2011)Google Scholar
- 14.Huang, Q., Li, H.: An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks. Inf. Sci.
**403**, 1–14 (2017)CrossRefGoogle Scholar - 15.Lindell, Y., Katz, J.: Introduction to Modern Cryptography. Chapman and Hall/CRC, Boca Raton (2014)zbMATHGoogle Scholar
- 16.Liu, Q., Wang, G., Wu, J.: An efficient privacy preserving keyword search scheme in cloud computing. In: International Conference on Computational Science and Engineering, CSE 2009, vol. 2, pp. 715–720. IEEE (2009)Google Scholar
- 17.Ma, S., Yi, M., Susilo, W., Yang, B.: Witness-based searchable encryption. Inf. Sci.
**453**, 364–378 (2018)MathSciNetCrossRefGoogle Scholar - 18.Rhee, H.S., Park, J.H., Susilo, W., Lee, D.H.: Trapdoor security in a searchable public-key encryption scheme with a designated tester. J. Syst. Softw.
**83**(5), 763–771 (2010)CrossRefGoogle Scholar - 19.Shao, Z.-Y., Yang, B.: On security against the server in designated tester public key encryption with keyword search. Inf. Process. Lett.
**115**(12), 957–961 (2015)MathSciNetCrossRefGoogle Scholar - 20.Yang, Y., Liu, X., Zheng, X., Rong, C., Guo, W.: Efficient traceable authorization search system for secure cloud storage. IEEE Trans. Cloud Comput. (2018)Google Scholar
- 21.Zhao, Q., Zeng, Q., Liu, X., Xu, H.: Simulation-based security of function-hiding inner product encryption. Sci. China Inf. Sci.
**61**(4), 048102 (2018)MathSciNetCrossRefGoogle Scholar - 22.Zhou, Y., Zhao, X., Liu, S., Long, X., Luo, W.: A time-aware searchable encryption scheme for EHRs. Digit. Commun. Netw. (2018)Google Scholar