Secure Full-Text Search Using Function Secret Sharing
Pages 59 - 72
Abstract
Secure full-text search enables searching for a string within a collection of documents while maintaining privacy. Despite recent studies on secure full-text search having achieved efficient round complexity, searches on large-scale databases remain impractical due to the significant communication overhead. Function Secret Sharing (FSS) is a recent paradigm that enables efficient secure two-party computations (2PC) in the preprocessing model with low communication overhead. In this study, we developed FssFMI, a communication-efficient full-text search protocol based on FSS. Compared to the state-of-the-art protocol, which requires O(l N) communication at the beginning of the online phase where l is the query length and N is the database length, our protocol requires only O(l) communication size while maintaining O(l) communication round complexity. The low communication overhead of FssFMI is achieved by evaluating functions for a full-text search using an FSS-based 2PC protocol, whereas the previous study computes the functions by referencing a precomputed lookup table based on the use of a large amount of correlated randomness. The O(l N) local computation required in FssFMI is the performance bottleneck, but its parallel-friendly nature easily scales to a large database. Our experimental results demonstrate that in a WAN environment, our protocol can search a database larger than 130 million letters for a query of length 16 in only 55 seconds using a single CPU core, with an online communication size of only 0.49 KB. Compared to the latest method, our protocol reduces communication overhead by more than seven orders of magnitude and achieves search speeds that are more than two orders of magnitude faster.
References
[1]
Gilad Asharov, Shai Halevi, Yehuda Lindell, and Tal Rabin. 2018. Privacy-Preserving Search of Similar Patients in Genomic Data. Proceedings on Privacy Enhancing Technologies, Vol. 2018 (10 2018), 104--124.
[2]
Pierre Baldi, Roberta Baronio, Emiliano De Cristofaro, Paolo Gasti, and Gene Tsudik. 2011. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes. In Proceedings of the 18th ACM Conference on Computer and Communications Security (Chicago, Illinois, USA) (CCS '11). Association for Computing Machinery, New York, NY, USA, 691--702.
[3]
Donald Beaver. 1991. Efficient Multiparty Protocols Using Circuit Randomization. In Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11--15, 1991, Proceedings (Lecture Notes in Computer Science, Vol. 576). Springer, 420--432.
[4]
Marina Blanton and Mehrdad Aliasgari. 2010. Secure Outsourcing of DNA Searching via Finite Automata. In Data and Applications Security and Privacy XXIV. Springer Berlin Heidelberg, Berlin, Heidelberg, 49--64.
[5]
Alexander Bowe, Taku Onodera, Kunihiko Sadakane, and Tetsuo Shibuya. 2012. Succinct de Bruijn Graphs. In Algorithms in Bioinformatics. Springer Berlin Heidelberg, Berlin, Heidelberg, 225--235.
[6]
Elette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta, Yuval Ishai, Nishant Kumar, and Mayank Rathee. 2021. Function Secret Sharing for Mixed-Mode and Fixed-Point Secure Computation. In Advances in Cryptology -- EUROCRYPT 2021. Springer International Publishing, Cham, 871--900.
[7]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2015. Function Secret Sharing. In Advances in Cryptology - EUROCRYPT 2015. Springer Berlin Heidelberg, Berlin, Heidelberg, 337--367.
[8]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (Vienna, Austria) (CCS '16). Association for Computing Machinery, New York, NY, USA, 1292--1303.
[9]
Elette Boyle, Niv Gilboa, and Yuval Ishai. 2019. Secure Computation with Preprocessing via Function Secret Sharing. In Theory of Cryptography. Springer International Publishing, Cham, 341--371.
[10]
Yangyi Chen, Bo Peng, XiaoFeng Wang, and Haixu Tang. 2012. Large-Scale Privacy-Preserving Mapping of Human Genomic Sequences on Hybrid Clouds. In Network and Distributed System Security Symposium.
[11]
Ke Cheng, Yantian Hou, and Liangmin Wang. 2018. Secure Similar Sequence Query on Outsourced Genomic Data. In Proceedings of the 2018 on Asia Conference on Computer and Communications Security (Incheon, Republic of Korea) (ASIACCS '18). Association for Computing Machinery, New York, NY, USA, 237--251.
[12]
Jung Hee Cheon, Miran Kim, and Kristin Lauter. 2015. Homomorphic Computation of Edit Distance. In Financial Cryptography and Data Security. Springer Berlin Heidelberg, Berlin, Heidelberg, 194--212.
[13]
Francisco Claude and Gonzalo Navarro. 2012. The Wavelet Matrix. In String Processing and Information Retrieval. Springer Berlin Heidelberg, Berlin, Heidelberg, 167--179.
[14]
Jack Doerner. [n.,d.]. C Library implementing Floram citeDoerner2017Floram. https://gitlab.com/neucrypt/floram. URL accessed July 7, 2024.
[15]
Jack Doerner and Abhi Shelat. 2017. Scaling ORAM for Secure Computation. In Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security (Dallas, Texas, USA) (CCS '17). Association for Computing Machinery, New York, NY, USA, 523--535.
[16]
Yaniv Erlich and Arvind Narayanan. 2014. Routes for breaching and protecting genetic privacy. Nature Reviews Genetics, Vol. 15, 6 (01 Jun 2014), 409--421.
[17]
P. Ferragina and G. Manzini. 2000. Opportunistic data structures with applications. In Proceedings 41st Annual Symposium on Foundations of Computer Science. 390--398.
[18]
Michael J. Freedman, Yuval Ishai, Benny Pinkas, and Omer Reingold. 2005. Keyword Search and Oblivious Pseudorandom Functions. In Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10--12, 2005, Proceedings. 303--324.
[19]
Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In Advances in Cryptology -- EUROCRYPT 2014. Springer Berlin Heidelberg, Berlin, Heidelberg, 640--658.
[20]
Kanav Gupta, Deepak Kumaraswamy, Nishanth Chandran, and Divya Gupta. 2022. LLAMA: A Low Latency Math Library for Secure Inference. Proc. Priv. Enhancing Technol., Vol. 2022, 4 (2022), 274--294.
[21]
Yan Huang, David Evans, Jonathan Katz, and Lior Malka. 2011. Faster secure two-party computation using garbled circuits. In Proceedings of the 20th USENIX Conference on Security (San Francisco, CA) (SEC'11). USENIX Association, USA, 35.
[22]
Yu Ishimaki, Hiroki Imabayashi, Kana Shimizu, and Hayato Yamana. 2016. Privacy-preserving string search for genome sequences with FHE bootstrapping optimization. In 2016 IEEE International Conference on Big Data (Big Data). 3989--3991.
[23]
N. Jawalkar, K. Gupta, A. Basu, N. Chandran, D. Gupta, and R. Sharma. 2024. Orca: FSS-based Secure Training and Inference with GPUs. In 2024 IEEE Symposium on Security and Privacy (SP). IEEE Computer Society, Los Alamitos, CA, USA, 66--66.
[24]
Somesh Jha, Louis Kruger, and Vitaly Shmatikov. 2008. Towards Practical Privacy for Genomic Computation. In 2008 IEEE Symposium on Security and Privacy (sp 2008). 216--230.
[25]
Heng Li and Richard Durbin. 2009. Fast and accurate short read alignment with Burrows--Wheeler transform. Bioinformatics, Vol. 25, 14 (05 2009), 1754--1760.
[26]
Jing Liu, Jamie Cui, and Cen Chen. 2023. Online Efficient Secure Logistic Regression based on Function Secret Sharing. In Proceedings of the 32nd ACM International Conference on Information and Knowledge Management (Birmingham, United Kingdom) (CIKM '23). Association for Computing Machinery, New York, NY, USA, 1597--1606.
[27]
Yoshiki Nakagawa, Satsuya Ohata, and Kana Shimizu. 2022. Efficient privacy-preserving variable-length substring match for genome sequence. Algorithms for Molecular Biology, Vol. 17, 1 (2022), 9.
[28]
Muhammad Naveed, Erman Ayday, Ellen W. Clayton, Jacques Fellay, Carl A. Gunter, Jean-Pierre Hubaux, Bradley A. Malin, and Xiaofeng Wang. 2015. Privacy in the Genomic Era. ACM Comput. Surv., Vol. 48, 1, Article 6 (aug 2015), 44 pages.
[29]
Koji Nuida, Satsuya Ohata, Shigeo Mitsunari, and Nuttapong Attrapadung. 2019. Arbitrary Univariate Function Evaluation and Re-Encryption Protocols over Lifted-ElGamal Type Ciphertexts. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 1233.
[30]
Goldreich Oded. 2009. Foundations of Cryptography: Volume 2, Basic Applications 1st ed.). Cambridge University Press, USA.
[31]
Satsuya Ohata and Koji Nuida. 2020. Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application. In Financial Cryptography and Data Security. Springer International Publishing, Cham, 369--385.
[32]
Victoria Popic and Serafim Batzoglou. 2017. A hybrid cloud read aligner based on MinHash and kmer voting that preserves privacy. Nature communications, Vol. 8, 1 (2017), 15311.
[33]
Md Safiur Rahman Mahdi, Md Momin Al Aziz, Noman Mohammed, and Xiaoqian Jiang. 2021. Privacy-preserving string search on encrypted genomic data using a generalized suffix tree. Informatics in Medicine Unlocked, Vol. 23 (2021), 100525.
[34]
Théo Ryffel, Pierre Tholoniat, David Pointcheval, and Francis R. Bach. 2020. AriaNN: Low-Interaction Privacy-Preserving Deep Learning via Function Secret Sharing. Proceedings on Privacy Enhancing Technologies, Vol. 2022 (2020), 291 -- 316.
[35]
Kunihiko Sadakane. 2007. Compressed Suffix Trees with Full Functionality. Theor. Comp. Sys., Vol. 41, 4 (dec 2007), 589--607.
[36]
Thomas Schneider and Oleksandr Tkachenko. 2019. EPISODE: Efficient Privacy-PreservIng Similar Sequence Queries on Outsourced Genomic DatabasEs. In Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security (Auckland, New Zealand) (Asia CCS '19). Association for Computing Machinery, New York, NY, USA, 315--327.
[37]
Kana Shimizu, Koji Nuida, and Gunnar Rätsch. 2016. Efficient privacy-preserving string search and an application in genomics. Bioinformatics, Vol. 32, 11 (2016), 1652--1661.
[38]
Jared T. Simpson and Richard Durbin. 2010. Efficient construction of an assembly string graph using the FM-index. Bioinformatics, Vol. 26, 12 (06 2010), i367--i373.
[39]
Katerina Sotiraki, Esha Ghosh, and Hao Chen. 2020. Privately computing set-maximal matches in genomic data. BMC Medical Genomics, Vol. 13 (2020), 1--8.
[40]
H. Sudo, M. Jimbo, K. Nuida, and K. Shimizu. 2019. Secure Wavelet Matrix: Alphabet-Friendly Privacy-Preserving String Search for Bioinformatics. IEEE/ACM Transactions on Computational Biology and Bioinformatics, Vol. 16, 05 (sep 2019), 1675--1684.
[41]
Juan Ramón Troncoso-Pastoriza, Stefan Katzenbeisser, and Mehmet Celik. 2007. Privacy preserving error resilient dna searching through oblivious automata. In Proceedings of the 14th ACM Conference on Computer and Communications Security (Alexandria, Virginia, USA) (CCS '07). Association for Computing Machinery, New York, NY, USA, 519--528.
[42]
Xiao Shaun Wang, Yan Huang, Yongan Zhao, Haixu Tang, XiaoFeng Wang, and Diyue Bu. 2015. Efficient Genome-Wide, Privacy-Preserving Similar Patient Query based on Private Edit Distance. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (Denver, Colorado, USA) (CCS '15). Association for Computing Machinery, New York, NY, USA, 492--503.
[43]
Peng Yang, Zoe L. Jiang, Shiqi Gao, Jiehang Zhuang, Hongxiao Wang, Junbin Fang, Siuming Yiu, Yulin Wu, and Xuan Wang. 2023. FssNN: Communication-Efficient Secure Neural Network Training via Function Secret Sharing. Cryptology ePrint Archive, Paper 2023/073. https://eprint.iacr.org/2023/073.
[44]
Samee Zahur and David Evans. 2015. Obliv-C: A Language for Extensible Data-Oblivious Computation. IACR Cryptol. ePrint Arch., Vol. 2015 (2015), 1153.
[45]
Ruiyu Zhu and Yan Huang. 2022. Efficient and Precise Secure Generalized Edit Distance and Beyond. IEEE Transactions on Dependable and Secure Computing, Vol. 19, 1 (2022), 579--590.
Index Terms
- Secure Full-Text Search Using Function Secret Sharing
Recommendations
TTP-Aided Secure Computation using Secret Sharing With Only One Computing Server
ASIA CCS '22: Proceedings of the 2022 ACM on Asia Conference on Computer and Communications SecuritySecure computation methods include methods that use homomorphic encryption (HE) and those that use secret sharing (SS). Secure computation based on HE can be realized using one server, and the computation process can be made public if the encryption key ...
Verifiable Threshold Secret Sharing and Full Fair Secure Two-Party Computation
AST '09: Proceedings of the 2009 International e-Conference on Advanced Science and TechnologyBased on the verifiable encryption and zero-knowledge proof protocols of Jarecki and Shmatikov and Pedersen’s verifiable threshold secret sharing scheme, this paper proposes a new full fair secure two-party computation protocols. For getting full fair, ...
Complete fairness in secure two-party computation
STOC '08: Proceedings of the fortieth annual ACM symposium on Theory of computingIn the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable ...
Comments
Information & Contributors
Information
Published In
November 2024
219 pages
Copyright © 2023 Owner/Author.
This work is licensed under a Creative Commons Attribution International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 21 November 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
CCS '24
Sponsor:
CCS '24: ACM SIGSAC Conference on Computer and Communications Security
October 14 - 18, 2024
UT, Salt Lake City, USA
Acceptance Rates
Overall Acceptance Rate 106 of 355 submissions, 30%
Upcoming Conference
CCS '25
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 109Total Downloads
- Downloads (Last 12 months)109
- Downloads (Last 6 weeks)37
Reflects downloads up to 01 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in