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)
Incoming Non-self Citations Over Time
Authors
- 1. Florian Hahn (SAP)
- 2. Nicolas Loza (SAP)
- 3. Florian Kerschbaum (University of Waterloo)
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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,610 | A Workload-Aware Encrypted Index for Efficient Privacy-Preserving Range Queries | 2026 | VLDB |
| 2 | 13,391 | Information-Theoretically Secure and Highly Efficient Search and Row Retrieval | 2023 | VLDB |
| 3 | 5,128 | A Comparative Evaluation of Order-Revealing Encryption Schemes and Secure Range-Query Protocols | 2019 | VLDB |
| 4 | 7,115 | Efficient Secure Query Evaluation over Encrypted XML Databases | 2006 | VLDB |
| 5 | 1,310 | A Privacy-Preserving Index for Range Queries | 2004 | VLDB |
| 6 | 8,531 | Adaptive Indexing over Encrypted Numeric Data | 2016 | SIGMOD |
| 7 | 6,537 | Range Search over Encrypted Multi-Attribute Data | 2023 | VLDB |
| 8 | 11,996 | Fast Searchable Encryption With Tunable Locality | 2017 | SIGMOD |
| 9 | 6,797 | Efficient Searchable Encryption Through Compression | 2018 | VLDB |
| 10 | 4,625 | Practical Private Range Search Revisited | 2016 | SIGMOD |