STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The state complexities of some basic operations on regular languages
Theoretical Computer Science
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Dynamic Programming
Finite-state transducers in language and speech processing
Computational Linguistics
On some applications of finite-state automata theory to natural language processing
Natural Language Engineering
Secure and private sequence comparisons
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Secure outsourcing of sequence comparisons
International Journal of Information Security - Special issue on SC 2003
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Secure function evaluation with ordered binary decision diagrams
Proceedings of the 13th ACM conference on Computer and communications security
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Towards an Information Theoretic Analysis of Searchable Encryption
ICICS '08 Proceedings of the 10th International Conference on Information and Communications Security
Practical Private DNA String Searching and Matching through Efficient Oblivious Automata Evaluation
Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII
Secure text processing with applications to private DNA matching
Proceedings of the 17th ACM conference on Computer and communications security
Proceedings of the 9th annual ACM workshop on Privacy in the electronic society
Secure outsourcing of DNA searching via finite automata
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
Computationally efficient searchable symmetric encryption
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
Efficient and secure generalized pattern matching via fast fourier transform
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
WISS'10 Proceedings of the 2010 international conference on Web information systems engineering
Countering GATTACA: efficient and secure testing of fully-sequenced human genomes
Proceedings of the 18th ACM conference on Computer and communications security
Text search protocols with simulation based security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Towards secure bioinformatics services (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
An efficient protocol for oblivious DFA evaluation and applications
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Genodroid: are privacy-preserving genomic tests ready for prime time?
Proceedings of the 2012 ACM workshop on Privacy in the electronic society
Foundations of garbled circuits
Proceedings of the 2012 ACM conference on Computer and communications security
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Addressing the concerns of the lacks family: quantification of kin genomic privacy
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Secure pattern matching using somewhat homomorphic encryption
Proceedings of the 2013 ACM workshop on Cloud computing security workshop
Protecting and evaluating genomic privacy in medical tests and personalized medicine
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Secure genomic testing with size- and position-hiding private substring matching
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Minimum disclosure routing for network virtualization and its experimental evaluation
IEEE/ACM Transactions on Networking (TON)
Journal of Computer Security - Advances in Security for Communication Networks
| Hi-index | 0.00 |
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.