{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:48:34Z","timestamp":1774435714403,"version":"3.50.1"},"reference-count":23,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T00:00:00Z","timestamp":1754265600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372107"],"award-info":[{"award-number":["62372107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The Karp and Rabin (KR) fingerprint is a special hash-like function widely utilized for efficient string matching. Recently, Sharma et al.leveraged its linear and symmetric properties to facilitate private database queries. However, their approach mainly protects encrypted or secret-shared databases rather than public databases, where only the query privacy is required. In this paper, we focus explicitly on privacy-preserving queries over public read-only databases. We propose a novel fingerprint-based keyword query scheme using the distributed point function (DPF), which effectively hides users\u2019 data access patterns across two symmetric mirror servers. Moreover, we provide a rigorous analysis of the false positive probability inherent in fingerprinting and discuss strategies for its minimization. Our scheme achieves efficiency close to plaintext methods, significantly reducing deployment complexity.<\/jats:p>","DOI":"10.3390\/sym17081227","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T09:41:17Z","timestamp":1754300477000},"page":"1227","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fingerprint-Based Secure Query Scheme for Databases over Symmetric Mirror Servers"],"prefix":"10.3390","volume":"17","author":[{"given":"Yu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9443-2292","authenticated-orcid":false,"given":"Rui","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Xinyang Normal University, Xinyang 464000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Li","sequence":"additional","affiliation":[{"name":"School of Cyberspace Security, Dongguan University of Technology, Dongguan 523808, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjv","family":"Hu","sequence":"additional","affiliation":[{"name":"School of Cyberspace Security, Dongguan University of Technology, Dongguan 523808, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,8,4]]},"reference":[{"key":"ref_1","first-page":"147","article-title":"A comparative study of hash algorithms in cryptography","volume":"8","author":"Pittalia","year":"2019","journal-title":"Int. J. Comput. Sci. Mob. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"Ibm J. Res. Dev."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s41060-022-00320-5","article-title":"Accurate and efficient privacy-preserving string matching","volume":"14","author":"Vaiwsri","year":"2022","journal-title":"Int. J. Data Sci. Anal."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2431211.2431212","article-title":"The exact online string matching problem: A review of the most recent results","volume":"45","author":"Faro","year":"2013","journal-title":"Acm Comput. Surv. (Csur)"},{"key":"ref_5","first-page":"162","article-title":"Real-time streaming string-matching","volume":"10","author":"Breslauer","year":"2014","journal-title":"Acm Trans. Algorithms (Talg)"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2391","DOI":"10.14778\/3603581.3603582","article-title":"Information-Theoretically Secure and Highly Efficient Search and Row Retrieval","volume":"16","author":"Sharma","year":"2023","journal-title":"Proc. VLDB Endow."},{"key":"ref_7","first-page":"1","article-title":"Data security and privacy protection for cloud storage: A survey","volume":"8","author":"Yang","year":"2020","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1080\/00031305.2018.1529622","article-title":"The false positive risk: A proposal concerning what to do about p-values","volume":"73","author":"Colquhoun","year":"2019","journal-title":"Am. Stat."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Gilboa, N., and Ishai, Y. (2014). Distributed Point Functions and Their Applications. Advances in Cryptology\u2014EUROCRYPT 2014. In Lecture Notes in Computer Science, Springer.","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., and Ishai, Y. (2015, January 26\u201330). Function secret sharing. Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Sofia, Bulgaria.","DOI":"10.1007\/978-3-662-46803-6_12"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Zhou, M., Park, A., Zheng, W., and Shi, E. (2024, January 19\u201323). Piano: Extremely simple, single-server PIR with sublinear server computation. Proceedings of the 2024 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP54263.2024.00055"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Menon, S.J., and Wu, D.J. (2022, January 22\u201326). Spiral: Fast, high-rate single-server PIR via FHE composition. Proceedings of the 2022 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP46214.2022.9833700"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., and Ren, L. (2023, January 21\u201325). Vectorized batch private information retrieval. Proceedings of the 2023 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., and Setty, S. (2018, January 20\u201324). PIR with compressed queries and amortized query processing. Proceedings of the 2018 IEEE Symposium on Security and Privacy (SP), San Francisco, CA, USA.","DOI":"10.1109\/SP.2018.00062"},{"key":"ref_15","unstructured":"Henzinger, A., Hong, M.M., Corrigan-Gibbs, H., Meiklejohn, S., and Vaikuntanathan, V. (2023, January 9\u201311). One server for the price of two: Simple and fast Single-Server private information retrieval. Proceedings of the 32nd USENIX Security Symposium (USENIX Security 23), Anaheim, CA, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3177872","article-title":"Path ORAM: An extremely simple oblivious RAM protocol","volume":"65","author":"Stefanov","year":"2018","journal-title":"J. Acm (JACM)"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/s00145-023-09447-5","article-title":"Oblivious RAM with worst-case logarithmic overhead","volume":"36","author":"Asharov","year":"2023","journal-title":"J. Cryptol."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Cong, K., Das, D., Nicolas, G., and Park, J. (2024, January 8\u201312). Panacea: Non-interactive and stateless oblivious RAM. Proceedings of the 2024 IEEE 9th European Symposium on Security and Privacy, Vienna, Austria.","DOI":"10.1109\/EuroSP60621.2024.00049"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"40","DOI":"10.56553\/popets-2023-0040","article-title":"Result-pattern-hiding conjunctive searchable symmetric encryption with forward and backward privacy","volume":"2023","author":"Yuan","year":"2023","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Shang, Z., Oya, S., Peter, A., and Kerschbaum, F. (2021). Obfuscated access and search patterns in searchable encryption. arXiv.","DOI":"10.14722\/ndss.2021.23041"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"100608","DOI":"10.1016\/j.cosrev.2023.100608","article-title":"Secret sharing: A comprehensive survey, taxonomy and applications","volume":"51","author":"Chattopadhyay","year":"2024","journal-title":"Comput. Sci. Rev."},{"key":"ref_22","unstructured":"Wang, F., Yun, C., Goldwasser, S., Vaikuntanathan, V., and Zaharia, M. (2017, January 27\u201329). Splinter: Practical Private Queries on Public Data. Proceedings of the 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17), Boston, MA, USA."},{"key":"ref_23","first-page":"153","article-title":"Average word length dynamics as indicator of cultural changes in society","volume":"14","author":"Bochkarev","year":"2012","journal-title":"Soc. Evol. Hist."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/8\/1227\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T18:22:26Z","timestamp":1760034146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/17\/8\/1227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,4]]},"references-count":23,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,8]]}},"alternative-id":["sym17081227"],"URL":"https:\/\/doi.org\/10.3390\/sym17081227","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,4]]}}}