Dual-Server Public-key Encryption With Keyword Search For Secure Cloud Storage

References

[1] R. Chen, Y. Mu, G. Yang, F. Guo, and X. Wang, “A new general framework for secure public key encryption with keyword search,” in Proc. 20th Australasian Conf. Inf. Secur. Privacy (ACISP), 2015, pp. 59–76.

[2] D. X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” in Proc. IEEE Symp. Secur. Privacy, May 2000, pp. 44–55.

[3] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu, “Order preserving encryption for numeric data,” in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2004, pp. 563–574.

[4] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” in Proc. 13th ACM Conf. Comput. Commun. Secur. (CCS), 2006, pp. 79–88.

[5] D. Boneh, G. Di Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Proc. Int. Conf. EUROCRYPT, 2004, pp. 506–522.

[6] R. Gennaro and Y. Lindell, “A framework for password-based authenticated key exchange,” in Proc. Int. Conf. EUROCRYPT, 2003, pp. 524–543.

[7] B. R. Waters, D. Balfanz, G. Durfee, and D. K. Smetters, “Building an encrypted and searchable audit log,” in Proc. NDSS, 2004, pp. 1–11.

[8] M. Abdalla et al., “Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions,” in Proc. 25 th Annu. Int. Conf. CRYPTO, 2005, pp. 205–222.

[9] D. Khader, “Public key encryption with keyword search based on K-resilient IBE,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), 2006, pp. 298–308.

[10] P. Xu, H. Jin, Q. Wu, and W. Wang, “Public- key encryption with fuzzy keyword search: A provably secure scheme under keyword guessing attack,” IEEE Trans. Comput., vol. 62, no. 11, pp. 2266–2277, Nov. 2013.

[11] G. Di Crescenzo and V. Saraswat, “Public key encryption with searchable keywords based on Jacobi symbols,” in Proc. 8th Int. Conf. INDOCRYPT, 2007, pp. 282–296.

[12] C. Cocks, “An identity based encryption scheme based on quadratic residues,” in Cryptography and Coding. Cirencester, U.K.: Springer, 2001, pp. 360–363.

[13] J. Baek, R. Safavi-Naini, and W. Susilo, “Public key encryption with keyword search revisited,” in Proc. Int. Conf. Comput. Sci. Appl. (ICCSA), 2008, pp. 1249–1259.

[14] H. S. Rhee, J. H. Park, W. Susilo, and D. H. Lee, “Improved searchable public key encryption with designated tester,” in Proc. 4th Int. Symp. ASIACCS, 2009, pp. 376–379.

[15] K. Emura, A. Miyaji, M. S. Rahman, and K. Omote, “Generic constructions of secure- channel free searchable encryption with adaptive security,” Secur. Commun. Netw., vol. 8, no. 8, pp. 1547–1560, 2015.

[16] J. W. Byun, H. S. Rhee, H.-A. Park, and D. H. Lee, “Off-line keyword guessing attacks on recent keyword search schemes over encrypted data,” in Proc. 3rd VLDB Workshop Secure Data Manage. (SDM), 2006, pp. 75–83.

[17] W.-C. Yau, S.-H. Heng, and B.-M. Goi, “Off- line keyword guessing attacks on recent public key encryption with keyword search schemes,” in Proc. 5th Int. Conf. ATC, 2008, pp. 100–105.

[18] J. Baek, R. Safavi-Naini, and W. Susilo, “On the integration of public key data encryption and public key encryption with keyword search,” in Proc. 9th Int. Conf. Inf. Secur. (ISC), 2006, pp. 217–232.

[19] H. S. Rhee, W. Susilo, and H.-J. Kim, “Secure searchable public key encryption scheme against keyword guessing attacks,” IEICE Electron. Exp., vol. 6, no. 5, pp. 237– 243, 2009.

[20] H. S. Rhee, J. H. Park, W. Susilo, and D. H. Lee, “Trapdoor security in a searchable public-key encryption scheme with a designated tester,” J. Syst. Softw., vol. 83, no. 5, pp. 763–771, 2010.

[21] L. Fang, W. Susilo, C. Ge, and J. Wang, “Public key encryption with keyword search secure against keyword guessing attacks without random oracle,” Inf. Sci., vol. 238, pp. 221–241, Jul. 2013.

[22] I. R. Jeong, J. O. Kwon, D. Hong, and D. H. Lee, “Constructing PEKS schemes secure against keyword guessing attacks is possible?” Comput. Commun., vol. 32, no. 2, pp. 394–396, 2009.

[23] R. Cramer and V. Shoup, “Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption,” in Proc. Int. Conf. EUROCRYPT, 2002, pp. 45– 64.

@article{1700559,
      author = {A.Vijaya Durga, Dr . N. Koteswaramma, B. Lakshmi Praveena},
      title = {Dual-Server Public-key Encryption With Keyword Search For Secure Cloud Storage},
      journal = {Iconic Research And Engineering Journals},
      year = {2018},
      volume = {1},
      number = {10},
      pages = {218-224},
      issn = {2456-8880},
      url = {https://www.irejournals.com/formatedpaper/1700559.pdf},
      abstract = {Searchable encryption is of increasing interest for protecting the data privacy in secure searchable cloud storage. In this paper, we investigate the security of a well-known cryptographic primitive, namely, public key encryption with keyword search (PEKS) which is very useful in many applications of cloud storage. Unfortunately, it has been shown that the traditional PEKS framework suffers from an inherent insecurity called inside keyword guessing attack (KGA) launched by the malicious server. To address this security vulnerability, we propose a new PEKS framework named dual-server PEKS (DS-PEKS). As another main contribution, we define a new variant of the smooth projective hash functions (SPHFs) referred to as linear and homomorphic SPHF (LH-SPHF). We then show a generic construction of secure DS-PEKS from LH-SPHF. To illustrate the feasibility of our new framework, we provide an efficient instantiation of the general framework from a Decision Diffie?Hellman-based LH-SPHF and show that it can achieve the strong security against inside the KGA.},
      keywords = {Location-based social network, text mining, travel route recommendation.},
      month = {April},
  }