Article

Secure and private sequence comparisons

Authors:

Mikhail J. Atallah,

Florian Kerschbaum,

Wenliang DuAuthors Info & Claims

WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society

Pages 39 - 44

https://doi.org/10.1145/1005140.1005147

Published: 30 October 2003 Publication History

Abstract

We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other than what can be inferred from the edit distance between their two sequences - which is unavoidable because computing that distance is the purpose of the protocol). The amount of communication done by our protocol is proportional to the time complexity of the best-known algorithm for performing the sequence comparison.The problem of determining the similarity between two sequences arises in a large number of applications, in particular in bioinformatics. In these application areas, the edit distance is one of the most widely used notions of sequence similarity: It is the least-cost set of insertions, deletions, and substitutions required to transform one string into the other. The generalizations of edit distance that are solved by the same kind of dynamic programming recurrence relation as the one for edit distance, cover an even wider domain of applications.

References

[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 23, 1, pp. 1--12 (1976).

Digital Library

[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).

Digital Library

[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).

Digital Library

[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).

Digital Library

[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).

Digital Library

[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).

Digital Library

[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).

Digital Library

[21]

C. K. Wong and A. K. Chandra. Bounds for the String Editing Problem, Journal of the ACM 23, 1, pp. 13--16 (1976).

Digital Library

[22]

A. Yao. Protocols for Secure Computations. Proceedings of the Annual IEEE Symposium on Foundations of Computer Science 23, pp. 160--164 (1982).

Cited By

Özdel SBozkir EKasneci E(2024)Privacy-preserving Scanpath Comparison for Pervasive Eye TrackingProceedings of the ACM on Human-Computer Interaction10.1145/36556058:ETRA(1-28)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1145/3655605
Roobini MTejaSatyanrayana BSaiVenkataGirish BSridevi NPothumani S(2024)Threat-Specific Security Risk Evaluation in the Cloud2024 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)10.1109/ACCAI61061.2024.10602321(1-10)Online publication date: 9-May-2024
https://doi.org/10.1109/ACCAI61061.2024.10602321
Hwang SOzturk ETsudik G(2023)Balancing Security and Privacy in Genomic Range QueriesACM Transactions on Privacy and Security10.1145/357579626:3(1-28)Online publication date: 13-Mar-2023
https://dl.acm.org/doi/10.1145/3575796
Show More Cited By

Index Terms

Secure and private sequence comparisons
1. Security and privacy
  1. Systems security
    1. Operating systems security
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

An efficient fair UC-secure protocol for two-party computation

With the development of modern Internet and mobile networks, there is an increasing need for collaborative privacy-preserving applications. Secure multi-party computation SMPC gives a general solution to these applications and has become a hot topic. ...
A fast longest common subsequence algorithm for similar strings
LATA'10: Proceedings of the 4th international conference on Language and Automata Theory and Applications

The longest common subsequence problem is a very important computational problem for which there are many algorithms. We present a new algorithm for this problem. Let X and Y be any two given strings each of length O(n). We observe that a longest common ...
Secure Multi-Party Computation without Agreement

It has recently been shown that authenticated Byzantine agreement, in which more than a third of the parties are corrupted, cannot be securely realized under concurrent or parallel (stateless) composition. This result puts into question any usage of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

WPES '03: Proceedings of the 2003 ACM workshop on Privacy in the electronic society

October 2003

135 pages

ISBN:1581137761

DOI:10.1145/1005140

General Chair:
Sushil Jajodia
George Mason University
,
Program Chairs:
Pierangela Samarati
University of Milan, Italy
,
Paul Syverson
Naval Research Lab

Copyright © 2003 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

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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 October 2003

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS03

Sponsor:

SIGSAC

CCS03: Tenth ACM Conference on Computer and Communications Security 2003

30 10 2003

Washington, DC

Acceptance Rates

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

138
Total Citations
View Citations
697
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Özdel SBozkir EKasneci E(2024)Privacy-preserving Scanpath Comparison for Pervasive Eye TrackingProceedings of the ACM on Human-Computer Interaction10.1145/36556058:ETRA(1-28)Online publication date: 28-May-2024
https://dl.acm.org/doi/10.1145/3655605
Roobini MTejaSatyanrayana BSaiVenkataGirish BSridevi NPothumani S(2024)Threat-Specific Security Risk Evaluation in the Cloud2024 International Conference on Advances in Computing, Communication and Applied Informatics (ACCAI)10.1109/ACCAI61061.2024.10602321(1-10)Online publication date: 9-May-2024
https://doi.org/10.1109/ACCAI61061.2024.10602321
Hwang SOzturk ETsudik G(2023)Balancing Security and Privacy in Genomic Range QueriesACM Transactions on Privacy and Security10.1145/357579626:3(1-28)Online publication date: 13-Mar-2023
https://dl.acm.org/doi/10.1145/3575796
Zhang YBai GLi XNepal SGrobler MChen CKo R(2023)Preserving Privacy for Distributed Genome-Wide Analysis Against Identity Tracing AttacksIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.318667220:4(3341-3357)Online publication date: 1-Jul-2023
https://doi.org/10.1109/TDSC.2022.3186672
Zhang HZhao SGuo ZWen QLi WGao F(2023)Scalable Fuzzy Keyword Ranked Search Over Encrypted Data on Hybrid CloudsIEEE Transactions on Cloud Computing10.1109/TCC.2021.309235811:1(308-323)Online publication date: 1-Jan-2023
https://doi.org/10.1109/TCC.2021.3092358
Shamila MVinuthna KTyagi A(2023)Genomic privacy: performance analysis, open issues, and future research directionsData Science for Genomics10.1016/B978-0-323-98352-5.00015-X(249-263)Online publication date: 2023
https://doi.org/10.1016/B978-0-323-98352-5.00015-X
Poorvadevi RMadan reddy PSai Venkat P(2022)An Effective Dynamic Propagation Model for Malware Detection in Cloud Platform2022 8th International Conference on Advanced Computing and Communication Systems (ICACCS)10.1109/ICACCS54159.2022.9785248(1268-1272)Online publication date: 25-Mar-2022
https://doi.org/10.1109/ICACCS54159.2022.9785248
Liang TYang CHuang K(2022)An efficient algorithm for the longest common palindromic subsequence problemTheoretical Computer Science10.1016/j.tcs.2022.04.046922(475-485)Online publication date: Jun-2022
https://doi.org/10.1016/j.tcs.2022.04.046
Vaiwsri SRanbaduge TChristen PSchnell R(2022)Accurate privacy-preserving record linkage for databases with missing valuesInformation Systems10.1016/j.is.2021.101959106:COnline publication date: 1-May-2022
https://dl.acm.org/doi/10.1016/j.is.2021.101959
Nagarajan GMinu RSasikala T(2022)Intrusion (Hybrid) Detection System for Cloud Computing EnvironmentsAdvances in Data Science and Management10.1007/978-981-16-5685-9_45(463-471)Online publication date: 13-Feb-2022
https://doi.org/10.1007/978-981-16-5685-9_45
Show More Cited By

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents