Secure and Private Sequence Comparisons

Proceedings of the ACM Workshop on Privacy in the Electronic Society

Volumn , Issue , 2003, Pages 39-44

  Atallah, Mikhail J ^a   Kerschbaum, Florian ^a   Du, Wenliang ^b  

^a Purdue University   (United States)

^b Syracuse University   (United States)

Author keywords

Dynamic programming; Edit distance; Longest common subsequence; Privacy; Secure multi party computation; String matching

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DNA SEQUENCES; DYNAMIC PROGRAMMING; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PATTERN MATCHING; SECURITY OF DATA;

EDIT DISTANCE; LONGEST COMMON SUBSEQUENCE; SECURE MULTI-PARTY COMPUTATION; STRING MATCHING;

NETWORK PROTOCOLS;

EID: 1642327704     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005140.1005147     Document Type: Conference Paper

References (22)

1. A.V. Aho, D.S. Hirschberg and J.D. Ullman. Bounds on the Complexity of the Longest Common Subsequence Problem, Journal of the ACM 13, 1, pp.1-12 (1976).
2. J. Benaloh. Dense Probabilistic Encryption, Proceedings of the Workshop on Selected Areas of Cryptography, pp.120-128 (1994).
3. C. Cachin. Efficient Private Bidding and Auctions with an Oblivious Third Party. Proceedings of the 6th ACM Conference on Computer and Communications Security, pp.120-127 (1999).
4. W. Du and M.J. Atallah. Protocols for Secure Remote Database Access with Approximate Matching. Proceedings of the 1st ACM Workshop on Security and Privacy in E-Commerce (2000).
5. M. Fischlin. A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires. RSA Security 2001 Cryptographer's Track. Lecture Notes in Computer Science 2020, pp.457-471 (2001).
6. O. Goldreich. Secure Multi-party Computation (working draft). Available at http://www.wisdom.weizmann.ac.il/~oded/pp.html (2001).
7. S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences 28, 2, pp.270-299 (1984).
8. G. Landau and U. Vishkin. Introducing Efficient Parallelism into Approximate String Matching and a new Serial Algorithm, Proceedings of the 18-th ACM STOC, pp.220-230 (1986).
9. H. M. Martinez (ed.) Mathematical and Computational Problems in the Analysis of Molecular Sequences, Bulletin of Mathematical Biology (Special Issue Honoring M. O. Dayhoff), 46, 4 (1984).
10. W. J. Masek and M. S. Paterson. A Faster Algorithm Computing String Edit Distances, Journal of Computer and System Science 20, pp.18-31 (1980).
11. D. Naccache and J. Stern. A New Cryptosystem based on Higher Residues. Proceedings of the ACM Conference on Computer and Communications Security 5, pp.59-66 (1998).
12. 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 of Molecular Biology 48, pp.443-453 (1973).
13. T. Okamoto and S. Uchiyama. A New Public-Key Cryptosystem as Secure as Factoring. Eurocrypt'98 Lecture Notes in Computer Science 1403, pp.308-318 (1998).
14. D. Sankoff. Matching Sequences Under Deletion-insertion Constraints, Proceedings of the National Academy of Sciences of the U.S.A. 69, pp.4-6 (1972).
15. D. Sankoff and J. B. Kruskal (eds.). Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, Reading, PA (1983).
16. Bruce Schneier. Applied Cryptography : Protocols, Algorithms, and Source Code in C (Second Edition), John Wiley & Sons, New York, NY (1996).
17. P.H. Sellers. An Algorithm for the Distance between two Finite Sequences, J. of Combinatorial Theory 16, pp.253-258 (1974).
18. P.H. Sellers. The Theory and Computation of Evolutionary Distance: Pattern Recognition, Journal of Algorithms 1, pp.359-373 (1980).
19. E. Ukkonen. Finding Approximate Patterns in Strings, Journal of Algorithms 6, pp.132-137 (1985).
20. R. A. Wagner and M. J. Fischer. The String to String Correction Problem, Journal of the ACM 21, 1, pp.168-173 (1974).
21. C.K. Wong and A.K. Chandra. Bounds for the String Editing Problem, Journal of the ACM 23, 1, pp.13-16 (1976).
22. A. Yao. Protocols for Secure Computations. Proceedings of the Annual IEEE Symposium on Foundations of Computer Science 23, pp.160-164 (1982).