DBScholar

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
5536
Venue
SIGMOD
Year
2018
Pagerank
5.3766157e-05
Overall Rank
8,742 | 40.03%
DOI
10.1145/3183713.3183754

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{hahn_sigmod18,
        title = {{Practical and Secure Substring Search}},
        author = {Hahn, Florian and Loza, Nicolas and Kerschbaum, Florian},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3183754},
        url = {https://dl.acm.org/doi/10.1145/3183713.3183754},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
8,486 SAGMA: Secure Aggregation Grouped by Multiple Attributes 2020 SIGMOD 5.4155107e-05
11,457 Frequency-revealing attacks against Frequency-hiding Order-preserving Encryption 2023 VLDB 5.093636e-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
114 Executing SQL over Encrypted Data in the Database-Service-Provider Model 2002 SIGMOD 0.00032363776
310 Order Preserving Encryption for Numeric Data 2004 SIGMOD 0.00021766789
3,293 Modular Order-Preserving Encryption, Revisited 2015 SIGMOD 7.5517336e-05
Previous Page 1 / 1 Next

Semantically Similar Papers