Secure text processing with applications to private DNA matching

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2010, Pages 485-492

  Katz, Jonathan ^a   Malka, Lior ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Security; Theory

Indexed keywords

GARBLED CIRCUITS; KEYWORD SEARCH; PATTERN MATCHING PROBLEMS; SECURITY; SUBSTRING; THEORY;

NETWORK PROTOCOLS; PATTERN MATCHING; SEARCH ENGINES; TEXT PROCESSING; WORD PROCESSING;

NETWORK SECURITY;

EID: 78649989154     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1866307.1866361     Document Type: Conference Paper

References (21)

1. W. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. In Advances in Cryptology - Eurocrypt 2001, volume 2045 of LNCS, pages 119-135. Springer, 2001.
2. M. Atallah, F. Kerschbaum, and W. Du. Secure and private sequence comparisons. In Proc. ACM Workshop on Privacy in the Electronic Society (WPES), pages 39-44. ACM, 2003.
3. E. De Cristofaro and G. Tsudik. Practical private set intersection protocols with linear complexity. In Financial Cryptography and Data Security 2010. Available at http://eprint.iacr.org/2009/491.
4. M. J. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword search and oblivious pseudorandom functions. In 2nd Theory of Cryptography Conference, volume 3378 of LNCS, pages 303-324. Springer, 2005.
5. K. Frikken. Practical private DNA string searching and matching through efficient oblivious automata evaluation. In Data and Applications Security, volume 5645 of LNCS, pages 81-94. Springer, 2009.
6. R. Gennaro, C. Hazay, and J. S. Sorensen. Text search protocols with simulation based security. In 13th Intl. Conference on Theory and Practice of Public Key Cryptography (PKC 2010), volume 6056 of LNCS, pages 332-350. Springer, 2010.
7. O. Goldreich. Foundations of Cryptography, vol. 2: Basic Applications. Cambridge University Press, Cambridge, UK, 2004.
8. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game, or a completeness theorem for protocols with honest majority. In 19th Annual ACM Symposium on Theory of Computing (STOC), pages 218-229. ACM Press, 1987.
9. C. Hazay and Y. Lindell. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In 5th Theory of Cryptography Conference - TCC 2008, volume 4948 of LNCS, pages 155-175. Springer, 2008.
10. S. Jarecki and V. Shmatikov. Efficient two-party secure computation on committed inputs. In Advances in Cryptology - Eurocrypt 2007, volume 4515 of LNCS, pages 97-114. Springer, 2007.
11. S. Jha, L. Kruger, and V. Shmatikov. Towards practical privacy for genomic computation. In IEEE Symp. Security & Privacy, pages 216-230. IEEE, 2008.
12. L. Kissner and D. X. Song. Privacy-preserving set operations. In Advances in Cryptology - Crypto 2005, volume 3621 of LNCS, pages 241-257. Springer, 2005.
13. A. Lindell. Efficient fully-simulatable oblivious transfer. In Cryptographers' Track - RSA 2008, volume 4964 of LNCS, pages 52-70. Springer, 2008.
14. Y. Lindell and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In Advances in Cryptology - Eurocrypt 2007, volume 4515 of LNCS, pages 52-78. Springer, 2007.
15. Y. Lindell, B. Pinkas, and N. Smart. Implementing two-party computation efficiently with security against malicious adversaries. In 6th Intl. Conf. on Security and Cryptography for Networks (SCN '08), volume 5229 of LNCS, pages 2-20. Springer, 2008.
16. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In Proc. 13th USENIX Security Symposium, pages 287-302. USENIX Association, 2004.
17. M. Naor and B. Pinkas. Computationally secure oblivious transfer. J. Cryptology, 18(1):1-35, 2005.
18. A. Paus, A.-R. Sadeghi, and T. Schneider. Practical secure evaluation of semi-private functions. In Conf. on Applied Cryptography and Network Security, volume 5536 of LNCS, pages 89-106. Springer, 2009.
19. B. Pinkas, T. Schneider, N. Smart, and S. Williams. Secure two-party computation is practical. In Advances in Cryptology - Asiacrypt 2009, volume 5912 of LNCS, pages 250-267. Springer, 2009.
20. J. R. Troncoso-Pastoriza, S. Katzenbeisser, and M. Celik. Privacy preserving error resilient DNA searching through oblivious automata. In 14th ACM Conf. on Computer and Communications Security (CCCS), pages 519-528. ACM Press, 2007.
21. A. C.-C. Yao. How to generate and exchange secrets. In 27th Annual Symp. on Foundations of Computer Science (FOCS), pages 162-167. IEEE, 1986.