Database Paper Browser

Back to papers

Practical and Secure Substring Search

Summary: Reframes secure substring search on outsourced data as range queries via frequency-hiding order-preserving encryption, enabling search on standard DBs without schema changes. Prototype achieves 98.3 ms for 10k emails; bucketing-attack evaluation shows practical privacy. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5474
Venue
SIGMOD
Year
2018
Pagerank
4.4937074e-05
Overall Rank
8,537 | 40.61%
DOI
10.1145/3183713.3183754

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
7,734 SAGMA: Secure Aggregation Grouped by Multiple Attributes 2020 SIGMOD 4.6648088e-05
11,258 Frequency-revealing attacks against Frequency-hiding Order-preserving Encryption 2023 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
118 Executing SQL over Encrypted Data in the Database-Service-Provider Model 2002 SIGMOD 0.00045685662
324 Order Preserving Encryption for Numeric Data 2004 SIGMOD 0.00027444645
3,195 Modular Order-Preserving Encryption, Revisited 2015 SIGMOD 7.4026351e-05
Previous Page 1 / 1 Next

Semantically Similar Papers