scispace - formally typeset
Proceedings ArticleDOI

Efficient information retrieval for ranked queries in cost-effective cloud environments

TLDR
This paper presents a scheme, termed efficient information retrieval for ranked query (EIRQ), to further reduce querying costs incurred in the cloud and addresses two fundamental issues in a cloud environment: privacy and efficiency.
Abstract
Cloud computing as an emerging technology trend is expected to reshape the advances in information technology. In this paper, we address two fundamental issues in a cloud environment: privacy and efficiency. We first review a private keyword-based file retrieval scheme proposed by Ostrovsky et. al. Then, based on an aggregation and distribution layer (ADL), we present a scheme, termed efficient information retrieval for ranked query (EIRQ), to further reduce querying costs incurred in the cloud. Queries are classified into multiple ranks, where a higher ranked query can retrieve a higher percentage of matched files. Extensive evaluations have been conducted on an analytical model to examine the effectiveness of our scheme.

read more

Citations
More filters
Journal ArticleDOI

Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data

TL;DR: The relevance scores and preference factors upon keywords which enable the precise keyword search and personalized user experience and the security analysis and experimental results demonstrate that the proposed schemes can achieve the same security level comparing to the existing ones and better performance in terms of functionality, query complexity and efficiency.
Journal ArticleDOI

Time-based proxy re-encryption scheme for secure data sharing in a cloud environment

TL;DR: A time-based proxy re-encryption (TimePRE) scheme to allow a user's access right to expire automatically after a predetermined period of time, so that the data owner can be offline in the process of user revocations.
Journal ArticleDOI

Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage

TL;DR: This paper develops the searchable encryption for multi-keyword ranked search over the storage data by considering the large number of outsourced documents ( data) in the cloud and utilizing the relevance score and k-nearest neighbor techniques to develop an efficient multi- keyword search scheme.
Journal ArticleDOI

Privacy Preserving Ranked Multi-Keyword Search for Multiple Data Owners in Cloud Computing

TL;DR: To enable cloud servers to perform secure search without knowing the actual data of both keywords and trapdoors, a novel secure search protocol is systematically constructed and a novel additive order and privacy preserving function family is proposed.
Journal ArticleDOI

Flexible Data Access Control Based on Trust and Reputation in Cloud Computing

TL;DR: A scheme to control data access in cloud computing based on trust evaluated by the data owner and/or reputations generated by a number of reputation centers in a flexible manner is proposed by applying Attribue-Based Encryption and Proxy Re-Encryption.
References
More filters
Proceedings ArticleDOI

Searchable symmetric encryption: improved definitions and efficient constructions

TL;DR: In this paper, the authors proposed a searchable symmetric encryption (SSE) scheme for the multi-user setting, where queries to the server can be chosen adaptively during the execution of the search.
Journal ArticleDOI

Searchable symmetric encryption: Improved definitions and efficient constructions

TL;DR: This paper begins by reviewing existing notions of security and proposes new and stronger security definitions, and presents two constructions that show secure under these new definitions and are more efficient than all previous constructions.
Journal ArticleDOI

Privacy-Preserving Multi-Keyword Ranked Search over Encrypted Cloud Data

TL;DR: This paper proposes a basic idea for the MRSE based on secure inner product computation, and gives two significantly improved MRSE schemes to achieve various stringent privacy requirements in two different threat models and further extends these two schemes to support more search semantics.
Book ChapterDOI

Order-Preserving Symmetric Encryption

TL;DR: The notion of order-preserving symmetric encryption (OPE) was introduced by Agrawal et al. as mentioned in this paper, who showed that a straightforward relaxation of standard security notions for encryption such as indistinguishability against chosen-plaintext attack (IND-CPA) is unachievable by a practical OPE scheme.
Proceedings ArticleDOI

Secure kNN computation on encrypted databases

TL;DR: A new asymmetric scalar-product-preserving encryption (ASPE) that preserves a special type of scalar product and is shown to resist practical attacks of a different background knowledge level, at a different overhead cost.
Related Papers (5)