DBScholar

Back to papers

Fast Range Query Processing with Strong Privacy Protection for Cloud Computing

Summary: PBtree privacy-preserving range queries on clouds; achieves index indistinguishability under IND-CKA. Introduces structure/node indistinguishability and width/depth minimization, yielding O(|R| log n) time; evaluated on 5M items, 10-item results 0.17 ms. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h373267510e7c06a3
Venue
VLDB
Year
2014
Pagerank
6.5909281e-05
Overall Rank
4,458 | 70.03%
DOI
10.14778/2733085.2733089

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{li_vldb14,
        title = {{Fast Range Query Processing with Strong Privacy Protection for Cloud Computing}},
        author = {Li, Rui and Liu, Alex X. and Wang, Ann L. and Bruhadeshwar, Bezawada},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {14},
        pages = {1953--1964},
        doi = {10.14778/2733085.2733089},
        url = {https://doi.org/10.14778/2733085.2733089},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
68 Privacy-Preserving Data Mining 2000 SIGMOD 0.00037958605
115 Executing SQL over Encrypted Data in the Database-Service-Provider Model 2002 SIGMOD 0.00031742473
311 Order Preserving Encryption for Numeric Data 2004 SIGMOD 0.00021327947
449 Dynamic Authenticated Index Structures for Outsourced Databases 2006 SIGMOD 0.00018121827
1,331 A Privacy-Preserving Index for Range Queries 2004 VLDB 0.00010999239
2,307 Secure kNN Computation on Encrypted Databases 2009 SIGMOD 8.6665657e-05
Previous Page 1 / 1 Next

Semantically Similar Papers