Introducing efficient parallelism into approximate string matching and a new serial algorithm
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
Applied cryptography (2nd ed.): protocols, algorithms, and source code in C
A new public key cryptosystem based on higher residues
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Efficient private bidding and auctions with an oblivious third party
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
The String-to-String Correction Problem
Journal of the ACM (JACM)
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Bounds for the String Editing Problem
Journal of the ACM (JACM)
A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Privacy preserving schema and data matching
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Privacy preserving clustering on horizontally partitioned data
Data & Knowledge Engineering
Privacy preserving error resilient dna searching through oblivious automata
Proceedings of the 14th ACM conference on Computer and communications security
Privacy-preserving social network analysis for criminal investigations
Proceedings of the 7th ACM workshop on Privacy in the electronic society
Communication-Efficient Private Protocols for Longest Common Subsequence
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Geocode Matching and Privacy Preservation
Privacy, Security, and Trust in KDD
Secure Multi-party Computation Using Virtual Parties for Computation on Encrypted Data
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
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
Privacy-preserving genomic computation through program specialization
Proceedings of the 16th ACM conference on Computer and communications security
Proceedings of the 16th ACM conference on Computer and communications security
Longest common subsequence as private search
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Secure construction of k-unlinkable patient records from distributed providers
Artificial Intelligence in Medicine
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
A constraint satisfaction cryptanalysis of bloom filters in private record linkage
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
To release or not to release: evaluating information leaks in aggregate human-genome data
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Sedic: privacy-aware data intensive computing on hybrid clouds
Proceedings of the 18th ACM conference on Computer and communications security
Filtering for private collaborative benchmarking
ETRICS'06 Proceedings of the 2006 international conference on Emerging Trends in Information and Communication Security
Secure outsourcing of sequence comparisons
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
Towards secure bioinformatics services (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Information fusion in data privacy: A survey
Information Fusion
Fake injection strategies for private phonetic matching
DPM'11 Proceedings of the 6th international conference, and 4th international conference on Data Privacy Management and Autonomous Spontaneus Security
Reference table based k-anonymous private blocking
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Efficient and Practical Approach for Private Record Linkage
Journal of Data and Information Quality (JDIQ)
Secure computations on non-integer values with applications to privacy-preserving sequence analysis
Information Security Tech. Report
Efficient privacy-aware record integration
Proceedings of the 16th International Conference on Extending Database Technology
Secure and verifiable outsourcing of sequence comparisons
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
A taxonomy of privacy-preserving record linkage techniques
Information Systems
An efficient two-party protocol for approximate matching in private record linkage
AusDM '11 Proceedings of the Ninth Australasian Data Mining Conference - Volume 121
Efficient secure computation optimization
Proceedings of the First ACM workshop on Language support for privacy-enhancing technologies
An iterative two-party protocol for scalable privacy-preserving record linkage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
| Hi-index | 0.02 |
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.