Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

An Efficient and Expressive Keyword Search over Encrypted Data in Cloud for Data Security


Affiliations
1 Seshachala Degree & P.G. College, Puttur, Andhra Pradesh, India
     

   Subscribe/Renew Journal


Accessible encryption permits a cloud server to direct catchphrase search over encoded information for the benefit of the information clients without learning the basic plaintexts. In any case, most existing accessible encryption conspires just help single or conjunctive watchword search, while a couple of different plans that can perform an expressive catchphrase search are computationally wasteful since they are worked from bilinear pairings over the composite-request gatherings. Right now, propose an expressive open key accessible encryption plot in the prime-request gatherings, which permits catchphrase search arrangements (i.e., predicates, get to structures) to be communicated in conjunctive, disjunctive or any monotonic Boolean recipes and accomplishes huge execution improvement over existing plans. We officially characterize its security and demonstrate that it is specifically secure in the standard model. Additionally, we execute the proposed plot utilizing a fast prototyping device called Charm and direct a few examinations to assess its execution. The outcomes show that our plan is substantially more proficient than the ones worked over the composite-request gatherings [1, 2].

Keywords

Catchphrase, Computationally, Encryption, Learning, Secure.
Subscription Login to verify subscription
User
Notifications
Font Size


  • M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, and H. Shi, “Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions,” J. Cryptology, vol. 21, no. 3, pp. 350-391, 2008.
  • J. Baek, R. Safavi-Naini, and W. Susilo, “On the integration of public key data encryption and public key encryption with keyword search,” In ISC, LNCS, vol. 4176, pp. 217-232, Springer, 2006.
  • M. Bellare, A. Boldyreva, and A. O’Neill, “Deterministic and efficiently searchable encryption,” In CRYPTO, LNCS, vol. 4622, pp. 535-552, Springer, 2007.
  • S. Benabbas, R. Gennaro, and Y. Vahlis, “Verifiable delegation of computation over large datasets,” In CRYPTO, LNCS, vol. 6841, pp. 111-131, Springer, 2011.
  • D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano. “Public key encryption with keyword search,” In EUROCRYPT, LNCS, vol. 3027, pp. 506-522, Springer, 2004.
  • B. Wang, S. Yu, W. Lou, and Y. T. Hou, “Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud,” In INFOCOM’14, IEEE, Piscataway, NJ, USA, 2014, pp. 2112-2120.
  • N. Cao, C. Wang, M. Li, K. Ren, and W. Lou, “Privacy-preserving multi-keyword ranked search over encrypted cloud data,” In IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1. pp. 222-233, 2014.
  • C. Bosch, Q. Tang, P. H. Hartel, and W. Jonker, “Selective document retrieval from encrypted database,” In ISC, LNCS, vol. 7483, pp. 224-241, Springer, 2012.
  • J. Camenisch, M. Kohlweiss, A. Rial, and C. Sheedy, “Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data,” In PKC, LNCS, vol. 5443, pp. 196-214, Springer, 2009.

Abstract Views: 8

PDF Views: 0




  • An Efficient and Expressive Keyword Search over Encrypted Data in Cloud for Data Security

Abstract Views: 8  |  PDF Views: 0

Authors

V. Bhuvaneswari
Seshachala Degree & P.G. College, Puttur, Andhra Pradesh, India

Abstract


Accessible encryption permits a cloud server to direct catchphrase search over encoded information for the benefit of the information clients without learning the basic plaintexts. In any case, most existing accessible encryption conspires just help single or conjunctive watchword search, while a couple of different plans that can perform an expressive catchphrase search are computationally wasteful since they are worked from bilinear pairings over the composite-request gatherings. Right now, propose an expressive open key accessible encryption plot in the prime-request gatherings, which permits catchphrase search arrangements (i.e., predicates, get to structures) to be communicated in conjunctive, disjunctive or any monotonic Boolean recipes and accomplishes huge execution improvement over existing plans. We officially characterize its security and demonstrate that it is specifically secure in the standard model. Additionally, we execute the proposed plot utilizing a fast prototyping device called Charm and direct a few examinations to assess its execution. The outcomes show that our plan is substantially more proficient than the ones worked over the composite-request gatherings [1, 2].

Keywords


Catchphrase, Computationally, Encryption, Learning, Secure.

References