Exploring the similarity space
ACM SIGIR Forum
Journal of the ACM (JACM)
Journal of Complexity - Special issue on coding and cryptography
A break in the clouds: towards a cloud definition
ACM SIGCOMM Computer Communication Review
Information Security Applications
Public key encryption that allows PIR queries
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Secure Ranked Keyword Search over Encrypted Cloud Data
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Efficient computationally private information retrieval from anonymity or trapdoor groups
ISC'10 Proceedings of the 13th international conference on Information security
Privacy preserving keyword searches on remote encrypted data
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Multi-query computationally-private information retrieval with constant communication rate
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
An efficient privacy-preserving multi-keyword search over encrypted cloud data with ranking
Distributed and Parallel Databases
| Hi-index | 0.00 |
Information search and document retrieval from a remote database (e.g. cloud server) requires submitting the search terms to the database holder. However, the search terms may contain sensitive information that must be kept secret from the database holder. Moreover, the privacy concerns apply to the relevant documents retrieved by the user in the later stage since they may also contain sensitive data and reveal information about sensitive search terms. A related protocol, Private Information Retrieval (PIR), provides useful cryptographic tools to hide the queried search terms and the data retrieved from the database while returning most relevant documents to the user. In this paper, we propose a practical privacy-preserving ranked keyword search scheme based on PIR that allows multi-keyword queries with ranking capability. The proposed scheme increases the security of the keyword search scheme while still satisfying efficient computation and communication requirements. To the best of our knowledge the majority of previous works are not efficient for assumed scenario where documents are large files. Our scheme outperforms the most efficient proposals in literature in terms of time complexity by several orders of magnitude.