Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 696

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement

Fu, Zhangjie, Ren, Kui, Shu, Jiangang, Sun, Xingming, Huang, Fengxiao·2016·IEEE Transactions on Parallel and Distributed Systems

Abstract

In cloud computing, searchable encryption scheme over outsourced data is a hot research field. However, most existing works on encrypted search over outsourced cloud data follow the model of “one size fits all” and ignore personalized search intention. Moreover, most of them support only exact keyword search, which greatly affects data usability and user experience. So how to design a searchable encryption scheme that supports personalized search and improves user search experience remains a very challenging task. In this paper, for the first time, we study and solve the problem of personalized multi-keyword ranked search over encrypted data (PRSE) while preserving privacy in cloud computing. With the help of semantic ontology WordNet, we build a user interest model for individual user by analyzing the user's search history, and adopt a scoring mechanism to express user interest smartly. To address the limitations of the model of “one size fit all” and keyword exact search, we propose two PRSE schemes for different search intentions. Extensive experiments on real-world dataset validate our analysis and show that our proposed solution is very efficient and effective.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpds.2015.2506573

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • WordNet: a lexical database for English

    Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015 · cited 1×

    “WordNet [20] is a lexical database available online, which offers a large repository of English lexical items.”
    Background
  • An algorithm for suffix stripping

    Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096 · cited 1×

    “In our experiments, we choose a publicly available real dataset: the Enron Dataset [27] and also try to get the root of every keyword with a well known stemming technique called Porter Stemming Algorithm [30].”
    Method

Show all 2 references

Cited by

See all 696

Metadata

Authors
Fu, Z., Ren, K., Shu, J., Sun, X., & Huang, F.
Venue
IEEE Transactions on Parallel and Distributed Systems
Published
2016-09-01
Volume
27
Issue
9
Pages
2546-2559
ISSN
1045-9219 (ISSN-L)
OpenAlex
W2344811709
Cited by
696
References
2
FWCI
155.16
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement. https://app.cochat.ai/papers/10.1109/tpds.2015.2506573
The paper
Fu, Z., Ren, K., Shu, J., Sun, X., & Huang, F. (2016). Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/tpds.2015.2506573

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.