research-article

Open access

Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection

Authors:

Hirohito Sasakawa,

Hiroki Arimura,

Jun SakumaAuthors Info & Claims

WPES '14: Proceedings of the 13th Workshop on Privacy in the Electronic Society

Pages 21 - 30

https://doi.org/10.1145/2665943.2665954

Published: 03 November 2014 Publication History

Abstract

Various string matching problems can be solved by means of a deterministic finite automaton (DFA) or a non-deterministic finite automaton (NFA). In non-oblivious cases, DFAs are often preferred for their run-time efficiency despite larger sizes. In oblivious cases, however, the inevitable computation and communication costs associated with the automaton size are more favorable to NFAs. We propose oblivious protocols for NFA evaluation based on homomorphic encryption and demonstrate that our method can be orders of magnitude faster than DFA-based methods, making it applicable to real-life scenarios, such as privacy-preserving detection of viral infection using genomic data.

References

[1]

A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974.

Digital Library

[2]

E. M. Batty, T. N. Wong, A. Trebes, K. Argoud, M. Attar, D. Buck, C. L. Ip, T. Golubchik, M. Cule, R. Bowden, et al. A modified RNA-Seq approach for whole genome sequencing of RNA viruses from faecal and blood samples. PloS one, 8(6):e66129, 2013.

[3]

M. Blanton and M. Aliasgari. Secure outsourcing of DNA searching via finite automata. Data and Applications Security and Privacy XXIV, pages 49--64, 2010.

[4]

D. Boneh, C. Gentry, S. Halevi, F. Wang, and D. J. Wu. Private database queries using somewhat homomorphic encryption. In Applied Cryptography and Network Security, pages 102--118. Springer, 2013.

Digital Library

[5]

K. B. Frikken. Practical private DNA string searching and matching through efficient oblivious automata evaluation. In Data and Applications Security XXIII, pages 81--94. Springer, 2009.

Digital Library

[6]

C. Gentry. A fully homomorphic encryption scheme. PhD thesis, Stanford University, 2009.

Digital Library

[7]

M. Gondree and P. Mohassel. Longest common subsequence as private search. In Proc. of ACM workshop on Privacy in the electronic society, pages 81--90. ACM, 2009.

Digital Library

[8]

C. Hazay and T. Toft. Computationally secure pattern matching in the presence of malicious adversaries. In Advances in Cryptology-ASIACRYPT 2010, pages 195--212. Springer, 2010.

[9]

A. Jarrous and B. Pinkas. Secure hamming distance based computation and its applications. In Applied Cryptography and Network Security, pages 107--124. Springer, 2009.

Digital Library

[10]

S. Jha, L. Kruger, and V. Shmatikov. Towards practical privacy for genomic computation. In IEEE Symposium on Security and Privacy 2008 (SP 2008), pages 216--230. IEEE, 2008.

Digital Library

[11]

J. Katz and L. Malka. Secure text processing with applications to private dna matching. In CCS'10, pages 485--492. ACM, 2010.

Digital Library

[12]

S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. SIGCOMM Comput. Commun. Rev., 36(4):339--350, 2006.

Digital Library

[13]

P. Laud and J. Willemson. Universally composable privacy preserving finite automata execution with low online and offline complexity. Cryptology ePrint Archive, Report 2013/678, 2013.

[14]

J. Li, Q. Wang, C. Wang, N. Cao, K. Ren, and W. Lou. Fuzzy keyword search over encrypted data in cloud computing. In Proc. IEEE INFOCOM, pages 1--5, 2010.

Digital Library

[15]

P. Mohassel, S. Niksefat, S. Sadeghian, and B. Sadeghiyan. An efficient protocol for oblivious dfa evaluation and applications. In Topics in Cryptology--CT-RSA 2012, pages 398--415. Springer, 2012.

Digital Library

[16]

G. Myers. A four Russians algorithm for regular expression pattern matching. Journal of the ACM, 39(2):432--448, 1992.

Digital Library

[17]

M. Naehrig, K. Lauter, and V. Vaikuntanathan. Can homomorphic encryption be practical? In Proc. of ACM workshop on Cloud computing security workshop, pages 113--124. ACM, 2011.

Digital Library

[18]

G. Navarro and M. Raffinot. Flexible pattern matching in strings -- practical on-line search algorithms for texts and biological sequences. Cambridge, 2002.

Digital Library

[19]

G. Navarro and M. Raffinot. Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching. Journal of Computational Biology, 10(6):903--923, 2003.

[20]

K. Nissim and E. Weinreb. Communication efficient secure linear algebra. In TCC, pages 522--541, 2006.

Digital Library

[21]

P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in cryptology EUROCRYPT, pages 223--238. Springer, 1999.

Digital Library

[22]

T. F. Smith and M. S. Waterman. Identification of common molecular subsequences. Journal of molecular biology, 147(1):195--197, 1981.

[23]

K. Thompson. Programming techniques: Regular expression search algorithm. CACM, 11(6):419--422, June 1968.

Digital Library

[24]

J. R. Troncoso-Pastoriza, S. Katzenbeisser, and M. Celik. Privacy preserving error resilient DNA searching through oblivious automata. In CCS'07, pages 519--528. ACM, 2007.

Digital Library

[25]

E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6(1):132--137, 1985.

[26]

L. Wei and M. K. Reiter. Third-party private dfa evaluation on encrypted files in the cloud. In Computer Security--ESORICS 2012, pages 523--540. Springer, 2012.

[27]

S. Wu and U. Manber. Fast text searching: allowing errors. CACM, 35(10):83--91, Oct. 1992.

Digital Library

[28]

A. C.-C. Yao. Protocols for secure computations. In FOCS'82, pages 160--164, 1982.

Digital Library

Cited By

Luo NWeng CSingh JTan GRaykova MPiskac R(2024)Privacy-Preserving Regular Expression Matching Using TNFAComputer Security – ESORICS 202410.1007/978-3-031-70890-9_12(225-246)Online publication date: 6-Sep-2024
https://doi.org/10.1007/978-3-031-70890-9_12
Yang YDeng RLiu XWu YWeng JZheng XRong C(2022)Privacy-Preserving Medical Treatment System Through Nondeterministic Finite AutomataIEEE Transactions on Cloud Computing10.1109/TCC.2020.299994010:3(2020-2037)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.2999940
Banno RMatsuoka KMatsumoto NBian SWaga MSuenaga K(2022)Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic EncryptionComputer Aided Verification10.1007/978-3-031-13185-1_22(447-468)Online publication date: 7-Aug-2022
https://doi.org/10.1007/978-3-031-13185-1_22
Show More Cited By

Index Terms

Oblivious Evaluation of Non-deterministic Finite Automata with Application to Privacy-Preserving Virus Genome Detection

Recommendations

Oblivious two-way finite automata: Decidability and complexity

We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs ...
Oblivious two-way finite automata: decidability and complexity
LATIN'12: Proceedings of the 10th Latin American international conference on Theoretical Informatics

We investigate the descriptional complexity and decidability of obliviousness for two-way finite automata. In particular, we consider the simulation of two-way deterministic finite automata (2DFAs) by oblivious 2DFAs, the simulation of oblivious 2DFAs ...
On input-revolving deterministic and nondeterministic finite automata

We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with the additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WPES '14: Proceedings of the 13th Workshop on Privacy in the Electronic Society

November 2014

218 pages

ISBN:9781450331487

DOI:10.1145/2665943

General Chair:
Gail-Joon Ahn
Arizona State University, USA
,
Program Chair:
Anupam Datta
Carnegie Mellon University, USA

Copyright © 2014 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2014

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Japan Science and Technology Agency

Conference

CCS'14

Sponsor:

SIGSAC

CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security

November 3, 2014

Arizona, Scottsdale, USA

Acceptance Rates

WPES '14 Paper Acceptance Rate 26 of 67 submissions, 39%;

Overall Acceptance Rate 106 of 355 submissions, 30%

Upcoming Conference

CCS '24

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 14 - 18, 2024

Salt Lake City , UT , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
949
Total Downloads

Downloads (Last 12 months)75
Downloads (Last 6 weeks)5

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Luo NWeng CSingh JTan GRaykova MPiskac R(2024)Privacy-Preserving Regular Expression Matching Using TNFAComputer Security – ESORICS 202410.1007/978-3-031-70890-9_12(225-246)Online publication date: 6-Sep-2024
https://doi.org/10.1007/978-3-031-70890-9_12
Yang YDeng RLiu XWu YWeng JZheng XRong C(2022)Privacy-Preserving Medical Treatment System Through Nondeterministic Finite AutomataIEEE Transactions on Cloud Computing10.1109/TCC.2020.299994010:3(2020-2037)Online publication date: 1-Jul-2022
https://doi.org/10.1109/TCC.2020.2999940
Banno RMatsuoka KMatsumoto NBian SWaga MSuenaga K(2022)Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic EncryptionComputer Aided Verification10.1007/978-3-031-13185-1_22(447-468)Online publication date: 7-Aug-2022
https://doi.org/10.1007/978-3-031-13185-1_22
Phalakarn KAttrapadung NMatsuura K(2022)Efficient Oblivious Evaluation Protocol and Conditional Disclosure of Secrets for DFAApplied Cryptography and Network Security10.1007/978-3-031-09234-3_30(605-625)Online publication date: 18-Jun-2022
https://doi.org/10.1007/978-3-031-09234-3_30
Blindenbach JJagadeesh KBejerano GWu D(2021)Avoiding genetic racial profiling in criminal DNA profile databasesNature Computational Science10.1038/s43588-021-00058-31:4(272-279)Online publication date: 26-Apr-2021
https://doi.org/10.1038/s43588-021-00058-3
Qin HWang HWei XXue LWu L(2019)Privacy-Preserving Wildcards Pattern Matching Protocol for IoT ApplicationsIEEE Access10.1109/ACCESS.2019.29005197(36094-36102)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2900519
Samadani MBerenjkoob MBlanton M(2019)Secure pattern matching based on bit parallelismInternational Journal of Information Security10.1007/s10207-018-0410-818:3(371-391)Online publication date: 25-May-2019
https://dl.acm.org/doi/10.1007/s10207-018-0410-8
Mardi DHowlader J(2019)Multiparty Evaluation of Finite State MachineSecurity and Privacy10.1007/978-981-13-7561-3_17(234-246)Online publication date: 30-Apr-2019
https://doi.org/10.1007/978-981-13-7561-3_17
Wei XZhao MXu Q(2018)Efficient and secure outsourced approximate pattern matching protocolSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-017-2560-422:4(1175-1187)Online publication date: 30-Dec-2018
https://dl.acm.org/doi/10.1007/s00500-017-2560-4
Dugan TZou X(2017)Privacy-preserving evaluation techniques and their application in genetic testsSmart Health10.1016/j.smhl.2017.03.0031-2(2-17)Online publication date: Jun-2017
https://doi.org/10.1016/j.smhl.2017.03.003

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents