More Web Proxy on the site http://driver.im/

Article

Privacy preserving error resilient dna searching through oblivious automata

Authors:

Juan Ramón Troncoso-Pastoriza,

Stefan Katzenbeisser,

Mehmet CelikAuthors Info & Claims

CCS '07: Proceedings of the 14th ACM conference on Computer and communications security

Pages 519 - 528

https://doi.org/10.1145/1315245.1315309

Published: 28 October 2007 Publication History

Abstract

Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and personalized nature of this information highlights the need for privacy-preserving protocols. In this paper, we present a new error-resilient privacy-preserving string searching protocol that is suitable for running private DNA queries. This protocol checks if a short template (e.g., a string that describes a mutation leading to a disease), known to one party, is present inside a DNA sequence owned by another party, accounting for possible errors and without disclosing to each party the other party's input. Each query is formulated as a regular expression over a finite alphabet and implemented as an automaton. As the main technical contribution, we provide a protocol that allows to execute any finite state machine in an oblivious manner, requiring a communication complexity which is linear both in the number of states and the length of the input string.

References

[1]

Human gemome project. http://genomics.energy.gov

[2]

M. J. Atallah, F. Kerschbaum, and W. Du. Secure and private sequence comparisons. In Proceedings of the 2003 ACM Workshop on privacy in the electronic society, pages 39--44, Washington, DC, 2003. ACM Press.

Digital Library

[3]

M. J. Atallah and J. Li. Secure outsourcing of sequence comparisons. International Journal of Information Security, 4(4):23--36, October 2005.

Digital Library

[4]

R. E. Bellman. Dynamic Programming. Courier Dover Publications, 2003.

Digital Library

[5]

B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults. In 25th Annual Symposium on Foundations of Computer Science FOCS'85, pages 383--395. IEEE Computer Society, 1985.

Digital Library

[6]

I. Damgård, M. Fitzi, E. Kiltz, J. B. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Proceedings of the third Theory of Cryptography Conference, TCC 2006, volume 3876 of Lecture Notes in Computer Science, pages 285--304. Springer-Verlag, 2006.

Digital Library

[7]

O. Goldreich. Secure multi-party computation. Working Draft, 2002.

[8]

O. Goldreich, S. Micali, and A. Widgerson. How to play any mental game. In Proceedings of the nineteenth annual ACM conference on Theory of Computing, pages 218--229, New York, U.S.A., 1987. ACM Press.

Digital Library

[9]

S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270--299, April 1984.

[10]

A. Hall. Coming soon: Your personal dna map? http://news.nationalgeographic.com/news/2006/03/0307_060307_dna.html.

[11]

J. E. Hopcroft and J. D. Ullman. Introduction to automata theory, languages, and computation. Addison Wesley, 1979.

Digital Library

[12]

M. Jacobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In T. Okamoto, editor, Advances in Cryptology - ASIACRYPT'00, volume 1976 of Lecture Notes in Computer Science, pages 162--177. Springer-Verlag, 2000.

Digital Library

[13]

L. Kruger, S. Jha, E.-J. Goh, and D. Boneh. Secure function evaluation with ordered binary decision diagrams. In Proceedings of the 13th ACM conference on Computer and communications security CCS'06, pages 410--420, Virginia, U.S.A., November 2006. ACM Press.

Digital Library

[14]

V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Doklady Akademii Nauk SSSR, 163(4):845--848, 1965. English translation at Soviet Physics Doklady 10(8): 707--710, 1966.

[15]

M. Mohri. On some application of finite-state automata theory to natural language. Natural Language Engineering, 2(1):1--20, 1996.

Digital Library

[16]

M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269--311, 1997.

Digital Library

[17]

M. Naor and K. Nissim. Communication complexity and secure function evaluation. Electronic Colloquium on Computational Complexity (ECCC), 8(062), 2001.

[18]

M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In ACM Symposium on Theory of Computing, pages 590--599, 2001.

Digital Library

[19]

M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pages 448--457, Washington, D.C., U.S.A., 2001.

Digital Library

[20]

S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal on Molecular Biology, 48:443--453, 1970.

[21]

P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Advances in Cryptology - EUROCRYPT 1999, volume 1592 of Lecture Notes in Computer Science, pages 223--238. Springer, 1999.

[22]

K. U. Shulz and S. Mihov. Fast string correction with Levenshtein automata. International Journal of Document Analysis and Recognition (IJDAR), 5(1):67--85, 2002.

[23]

T. K. Vintsyuk. Speech discrimination by dynamic programming. Kibernetika, 4:52--57, 1968.

[24]

A. C. Yao. Protocols for secure computations. In Proceedings of the IEEE Symposium on Foundations of Computer Science, pages 160--164, 1982.

[25]

S. Yu and Q. Zhuang. The state complexities of some basic operations on regular languages. Theoretical Computer Science, 125:315--328, 1994.

Digital Library

Cited By

Angel SIoannidis EMargolin ESetty SWoods JBalzarotti DXu W(2024)ReefProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699113(3801-3818)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699113
Lv ZCao ZShen JDong X(2024)Efficient Multi-party Private Set Intersection with Constant Communication RoundsProceedings of the 2024 2nd International Conference on Artificial Intelligence, Systems and Network Security10.1145/3714334.3714358(138-142)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3714334.3714358
Uchiyama TShimizu KAyday EVaidya J(2024)Secure Full-Text Search Using Function Secret SharingProceedings of the 23rd Workshop on Privacy in the Electronic Society10.1145/3689943.3695052(59-72)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3689943.3695052
Show More Cited By

Index Terms

Privacy preserving error resilient dna searching through oblivious automata
1. Applied computing
  1. Life and medical sciences

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 ...
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications V

Limited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
On the power of quantum finite state automata
FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science

In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '07: Proceedings of the 14th ACM conference on Computer and communications security

October 2007

628 pages

ISBN:9781595937032

DOI:10.1145/1315245

General Chair:
Peng Ning
NC State University, USA
,
Program Chairs:
Sabrina De Capitani di Vimercati
University of Milan, Italy
,
Paul Syverson
Naval Research Laboratory, USA

Copyright © 2007 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 October 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS07

Sponsor:

CCS07: 14th ACM Conference on Computer and Communications Security 2007

November 2 - October 31, 2007

Virginia, Alexandria, USA

Acceptance Rates

CCS '07 Paper Acceptance Rate 55 of 302 submissions, 18%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

138
Total Citations
View Citations
1,048
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Angel SIoannidis EMargolin ESetty SWoods JBalzarotti DXu W(2024)ReefProceedings of the 33rd USENIX Conference on Security Symposium10.5555/3698900.3699113(3801-3818)Online publication date: 14-Aug-2024
https://dl.acm.org/doi/10.5555/3698900.3699113
Lv ZCao ZShen JDong X(2024)Efficient Multi-party Private Set Intersection with Constant Communication RoundsProceedings of the 2024 2nd International Conference on Artificial Intelligence, Systems and Network Security10.1145/3714334.3714358(138-142)Online publication date: 20-Dec-2024
https://dl.acm.org/doi/10.1145/3714334.3714358
Uchiyama TShimizu KAyday EVaidya J(2024)Secure Full-Text Search Using Function Secret SharingProceedings of the 23rd Workshop on Privacy in the Electronic Society10.1145/3689943.3695052(59-72)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3689943.3695052
Rahmani ZShahini NGat NYun ZJiang YFarchy OHarel YChaudhary VAyday ESharif MYurcik W(2024)Privacy-Preserving Collaborative Genomic Research: A Real-Life Deployment and VisionProceedings of the 2024 Workshop on Cybersecurity in Healthcare10.1145/3689942.3694747(85-91)Online publication date: 20-Nov-2024
https://dl.acm.org/doi/10.1145/3689942.3694747
Wang RZhou JCao ZDong XRaymond Choo K(2024)Updatable Private Set Intersection With Forward PrivacyIEEE Transactions on Information Forensics and Security10.1109/TIFS.2024.346147519(8573-8586)Online publication date: 2024
https://doi.org/10.1109/TIFS.2024.3461475
Jiang GZhang HLin JKong FYu L(2024)Optimized verifiable delegated private set intersection on outsourced private datasetsComputers & Security10.1016/j.cose.2024.103822(103822)Online publication date: Mar-2024
https://doi.org/10.1016/j.cose.2024.103822
Zhao QJiang BZhang YWang HMao YZhong S(2024)Unbalanced private set intersection with linear communication complexityScience China Information Sciences10.1007/s11432-022-3717-967:3Online publication date: 5-Feb-2024
https://doi.org/10.1007/s11432-022-3717-9
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
Heath DKolesnikov VNg L(2024)Garbled Circuit Lookup Tables with Logarithmic Number of CiphertextsAdvances in Cryptology – EUROCRYPT 202410.1007/978-3-031-58740-5_7(185-215)Online publication date: 26-May-2024
https://dl.acm.org/doi/10.1007/978-3-031-58740-5_7
Chen YZhang MZhang CDong MLiu W(2024)Private Set Operations from Multi-query Reverse Private Membership TestPublic-Key Cryptography – PKC 202410.1007/978-3-031-57725-3_13(387-416)Online publication date: 14-Apr-2024
https://doi.org/10.1007/978-3-031-57725-3_13
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten