research-article

Research on Privacy Preserving of Searchable Encryption

Authors:

Weiyou HeAuthors Info & Claims

HPCCT '18: Proceedings of the 2018 2nd High Performance Computing and Cluster Technologies Conference

Pages 58 - 68

https://doi.org/10.1145/3234664.3234665

Published: 22 June 2018 Publication History

Abstract

In the cloud computing applications, the researchers proposed a new cryptographic primitive searchable encryption (SE) in order to ensure data security. Searchable encryption can make full use of cloud server computing capacity to search the ciphertext. The privacy of the searchable encryption on this paper is discussed: First of all, security threat model and security definition of searchable encryption is discussed. Secondly, the privacy preserving definition of searchable encryption is established from two aspects of data privacy and identity privacy. Once again the existing searchable encryption schemes are analyzed and evaluated based on data privacy preserving (index privacy preserving, search pattern privacy preserving, access pattern privacy preserving) by treat model and privacy preserving definition. Fourthly, searchable encryption schemes of different application models are introduced based on identity privacy preserving, and anonymous searchable encryption schemes are analyzed and evaluated based on anonymity definitions of different application models. Finally, the design principle and method of safety analysis are provided for privacy preserving scheme of searchable encryption.

References

[1]

Subashini S, Kavitha V. A survey on security issues in service delivery models of cloud computing{J}. Journal of network and computer applications, 2011, 34(1): 1--11.

Digital Library

[2]

Song D X, Wagner D, Perrig A. Practical techniques for searches on encrypted data{C}//Security and Privacy, 2000. S&P 2000. Proceedings. 2000 IEEE Symposium on. IEEE, 2000: 44--55.

Digital Library

[3]

Goh E J. Secure Indexes{J}. IACR Cryptology ePrint Archive, 2003, 2003: 216.

[4]

Curtmola R, Garay J, Kamara S, et al. Searchable symmetric encryption: improved definitions and efficient constructions{C}// ACM Conference on Computer and Communications Security. ACM, 2006:79--88.

Digital Library

[5]

Curtmola R, Garay J, Kamara S, et al. Searchable symmetric encryption: improved definitions and efficient constructions{J}. Journal of Computer Security, 2011, 19(5): 895--934.

Digital Library

[6]

Cao N, Wang C, Li M, et al. Privacy-preserving multi-keyword ranked search over encrypted cloud data{J}. IEEE Transactions on parallel and distributed systems, 2014, 25(1): 222--233.

Digital Library

[7]

Li R, Xu Z, Kang W, et al. Efficient multi-keyword ranked query over encrypted data in cloud computing{J}. Future Generation Computer Systems, 2014, 30: 179--190.

Digital Library

[8]

Fu Z, Sun X, Linge N, et al. Achieving effective cloud search services: multi-keyword ranked search over encrypted cloud data supporting synonym query{J}. IEEE Transactions on Consumer Electronics, 2014, 60(1): 164--172.

[9]

Xia Z, Wang X, Sun X, et al. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data{J}. IEEE Transactions on Parallel and Distributed Systems, 2016, 27(2): 340--352.

Digital Library

[10]

Boneh D, Di Crescenzo G, Ostrovsky R, et al. Public key encryption with keyword search{C}//International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2004: 506--522.

[11]

Dong C, Russello G, Dulay N. Shared and searchable encrypted data for untrusted servers{J}. Journal of Computer Security, 2011, 19(3): 367--397.

Digital Library

[12]

Golle P, Staddon J, Waters B. Secure conjunctive keyword search over encrypted data{C}//International Conference on Applied Cryptography and Network Security. Springer Berlin Heidelberg, 2004: 31--45.

[13]

Boneh D, Di Crescenzo G, Ostrovsky R, et al. Public key encryption with keyword search{C}//International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2004: 506--522.

[14]

Li M, Yu S, Cao N, et al. Authorized private keyword search over encrypted data in cloud computing{C}//Distributed Computing Systems (ICDCS), 2011 31st International Conference on. IEEE, 2011: 383--392.

Digital Library

[15]

Raykova M, Vo B, Bellovin S M, et al. Secure anonymous database search{C}//Proceedings of the 2009 ACM workshop on Cloud computing security. ACM, 2009: 115--126.

Digital Library

[16]

Bethencourt J, Chan H, Perrig A, et al. Anonymous multi-attribute encryption with range query and conditional decryption{J}. School Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA, Tech. Rep. CMU-CS-06-135, 2006.

[17]

Camenisch J, Kohlweiss M, Rial A, et al. Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data{C}//International Workshop on Public Key Cryptography. Springer Berlin Heidelberg, 2009: 196--214.

Digital Library

[18]

Miao Y, Ma J, Liu Z. Revocable and anonymous searchable encryption in multi&dash;user setting{J}. Concurrency and Computation: Practice and Experience, 2016, 28(4): 1204--1218.

Digital Library

[19]

Bloom B H. Space/time trade-offs in hash coding with allowable errors{J}. Communications of the ACM, 1970, 13(7): 422--426.

Digital Library

[20]

Liu C, Zhu L, Wang M, et al. Search pattern leakage in searchable encryption: Attacks and new construction{J}. Information Sciences, 2014, 265: 176--188.

Digital Library

[21]

Hayasaka K, Kawai Y, Koseki Y, et al. Probabilistic Generation of Trapdoors: Reducing Information Leakage of Searchable Symmetric Encryption{C}//International Conference on Cryptology and Network Security. Springer International Publishing, 2016: 350--364.

[22]

Wang B, Song W, Lou W, et al. Inverted index based multi-keyword public-key searchable encryption with strong privacy guarantee{C}//2015 IEEE Conference on Computer Communications (INFOCOM). IEEE, 2015: 2092--2100.

[23]

Nishioka M. Perfect keyword privacy in PEKS systems{C}//International Conference on Provable Security. Springer Berlin Heidelberg, 2012: 175--192.

Digital Library

[24]

Islam M S, Kuzu M, Kantarcioglu M. Access Pattern disclosure on Searchable Encryption: Ramification, Attack and Mitigation{C}//NDSS. 2012, 20: 12.

[25]

Naveed M, Prabhakaran M, Gunter C A. Dynamic searchable encryption via blind storage{C}//2014 IEEE Symposium on Security and Privacy. IEEE, 2014: 639--654.

Digital Library

[26]

Delfs H, Knebl H. Introduction to cryptography: principles and applications{J}. Information Security & Cryptography Texts & Monographs, 2002, 4(4):206--207.

[27]

Schnell R, Bachteler T, Reiher J. Privacy-preserving record linkage using Bloom filters{J}. BMC medical informatics and decision making, 2009, 9(1): 41.

[28]

Kamara S, Papamanthou C, Roeder T. Dynamic searchable symmetric encryption{C}//Proceedings of the 2012 ACM conference on Computer and communications security. ACM, 2012: 965--976.

Digital Library

[29]

Wang C, Cao N, Ren K, et al. Enabling secure and efficient ranked keyword search over outsourced cloud data{J}. IEEE Transactions on parallel and distributed systems, 2012, 23(8): 1467--1479.

Digital Library

[30]

Boldyreva A, Chenette N, Lee Y, et al. Order-preserving symmetric encryption{C}//Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2009: 224--241.

[31]

Örencik C, Kantarcıoğlu M, Savaş E. A practical and secure multi-keyword search method over encrypted cloud data{J}. 2013.

Digital Library

[32]

Hore B, Mehrotra S, Canim M, et al. Secure multidimensional range queries over outsourced data{J}. The VLDB Journal---The International Journal on Very Large Data Bases, 2012, 21(3): 333--358.

Digital Library

[33]

Hore B, Mehrotra S, Tsudik G. A privacy-preserving index for range queries{C}//Proceedings of the Thirtieth international conference on Very large data bases-Volume 30. VLDB Endowment, 2004: 720--731.

Digital Library

[34]

Fu Z, Shu J, Wang J, et al. Privacy-Preserving Smart Similarity Search Based on Simhash over Encrypted Data in Cloud Computing{J}. Journal of Internet Technology, 2015, 16(3):453--460.

[35]

Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality{C}//Proceedings of the thirtieth annual ACM symposium on Theory of computing. ACM, 1998: 604--613.

Digital Library

[36]

Sun W, Wang B, Cao N, et al. Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking{C}//Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security. ACM, 2013: 71--82.

Digital Library

[37]

Wong W K, Cheung D W, Kao B, et al. Secure kNN computation on encrypted databases{C}//Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. ACM, 2009: 139--152.

Digital Library

[38]

Wang W, Xu P, Li H, et al. Secure hybrid-indexed search for high efficiency over keyword searchable ciphertexts{J}. Future Generation Computer Systems, 2016, 55: 353--361.

Digital Library

[39]

Bellare M, Boldyreva A, O'Neill A. Deterministic and efficiently searchable encryption{C}//Annual International Cryptology Conference. Springer Berlin Heidelberg, 2007: 535--552.

Digital Library

[40]

Kuzu M, Islam M S, Kantarcioglu M. Efficient similarity search over encrypted data{C}//2012 IEEE 28th International Conference on Data Engineering. IEEE, 2012: 1156--1167.

Digital Library

[41]

Paillier P. Public-key cryptosystems based on composite degree residuosity classes{C}//International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 1999: 223--238.

Digital Library

[42]

Wang B, Yu S, Lou W, et al. Privacy-preserving multi-keyword fuzzy search over encrypted data in the cloud{C}//IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 2014: 2112--2120.

[43]

Hoang T, Yavuz A A, Guajardo J. Practical and secure dynamic searchable encryption via oblivious access on distributed data structure{C}//Proceedings of the 32nd Annual Conference on Computer Security Applications. ACM, 2016: 302--313.

Digital Library

[44]

Li J, Lin D, Squicciarini A, et al. Towards Privacy-Preserving Storage and Retrieval in Multiple Clouds{J}. 2015.

[45]

Byun J W, Lee D H, Lim J. Efficient conjunctive keyword search on encrypted data storage system{C}//European Public Key Infrastructure Workshop. Springer Berlin Heidelberg, 2006: 184--196.

Digital Library

[46]

Park H A, Kim B H, Lee D H, et al. Secure similarity search{C}//Granular Computing, 2007. GRC 2007. IEEE International Conference on. IEEE, 2007: 598--598.

Digital Library

[47]

Adjedj M, Bringer J, Chabanne H, et al. Biometric identification over encrypted data made feasible{C}//International Conference on Information Systems Security. Springer Berlin Heidelberg, 2009: 86--100.

Digital Library

[48]

Baek J, Safavi-Naini R, Susilo W. Public key encryption with keyword search revisited{C}//International conference on Computational Science and Its Applications. Springer Berlin Heidelberg, 2008: 1249--1259.

Digital Library

[49]

Boneh D, Gentry C, Lynn B, et al. Aggregate and verifiably encrypted signatures from bilinear maps{C}//International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 2003: 416--432.

Digital Library

[50]

Rhee H S, Park J H, Susilo W, et al. Trapdoor security in a searchable public-key encryption scheme with a designated tester{J}. Journal of Systems and Software, 2010, 83(5): 763--771.

Digital Library

[51]

Park D J, Kim K, Lee P J. Public key encryption with conjunctive field keyword search{C}//International Workshop on Information Security Applications. Springer Berlin Heidelberg, 2004: 73--86.

Digital Library

[52]

Park D J, Cha J, Lee P J. Searchable Keyword-Based Encryption{J}. IACR Cryptology ePrint Archive, 2005, 2005: 367.

[53]

Wang P, Wang H, Pieprzyk J. Common secure index for conjunctive keyword-based retrieval over encrypted data{C}//Workshop on Secure Data Management. Springer Berlin Heidelberg, 2007: 108--123.

Digital Library

[54]

Blaze M, Bleumer G, Strauss M. Divertible protocols and atomic proxy cryptography{C}//International Conference on the Theory and Applications of Cryptographic Techniques. Springer Berlin Heidelberg, 1998: 127--144.

[55]

Bao F, Deng R H, Ding X, et al. Private query on encrypted data in multi-user settings{C}//International Conference on Information Security Practice and Experience. Springer Berlin Heidelberg, 2008: 71--85.

Digital Library

[56]

Green M, Hohenberger S. Blind identity-based encryption and simulatable oblivious transfer{C}//International Conference on the Theory and Application of Cryptology and Information Security. Springer Berlin Heidelberg, 2007: 265--282.

Digital Library

Cited By

Bulbul BBahtiyar SAltilar D(2020)Homomorphic Encryption versus Searchable Encryption for Data Retrieval on Cloud2020 5th International Conference on Computer Science and Engineering (UBMK)10.1109/UBMK50275.2020.9219533(187-192)Online publication date: Sep-2020
https://doi.org/10.1109/UBMK50275.2020.9219533

Index Terms

Research on Privacy Preserving of Searchable Encryption
1. Security and privacy
  1. Database and storage security
    1. Management and querying of encrypted data

Recommendations

Privacy-preserving multireceiver ID-based encryption with provable security

Multireceiver identity ID based encryption and ID-based broadcast encryption allow a sender to use the public identities of multiple receivers to encrypt messages so that only the selected receivers or a privileged set of users can decrypt the messages. ...
Deniably authenticated searchable encryption scheme based on Blockchain for medical image data sharing
Abstract
In the cloud applications of medical data based on blockchain, doctors and managers usually want to obtain image data shared by other healthcare institutions. To ensure the privacy and workability of the image data, it is necessary to encrypt ...
Efficient privacy preserving predicate encryption with fine-grained searchable capability for Cloud storage

We present an efficient predicate encryption system for the class of inner-product predicates that is fully secure without random oracles.PEFKS can not only test whether multiple keywords were present in the ciphertext, but also can evaluate the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

HPCCT '18: Proceedings of the 2018 2nd High Performance Computing and Cluster Technologies Conference

June 2018

126 pages

ISBN:9781450364850

DOI:10.1145/3234664

Copyright © 2018 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

Shanghai Jiao Tong University: Shanghai Jiao Tong University
Xi'an Jiaotong-Liverpool University: Xi'an Jiaotong-Liverpool University
Chinese Academy of Sciences

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 June 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

HPCCT 2018

HPCCT 2018: 2018 2nd High Performance Computing and Cluster Technologies Conference

June 22 - 24, 2018

Beijing, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
199
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bulbul BBahtiyar SAltilar D(2020)Homomorphic Encryption versus Searchable Encryption for Data Retrieval on Cloud2020 5th International Conference on Computer Science and Engineering (UBMK)10.1109/UBMK50275.2020.9219533(187-192)Online publication date: Sep-2020
https://doi.org/10.1109/UBMK50275.2020.9219533

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten