.png){kind=icon}
返回
Efficient and Precise Secure Generalized Edit Distance and Beyond
.png){kind=icon}
OA
AI
DOI：10.1109/TDSC.2020.2984219.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Secure string-comparison by some non-linear metrics such as edit-distance and its variations is an important building block of many applications including patient genome matching and text-based intrusion detection. Despite the significance of these string metrics, computing them in a provably secure manner is very expensive. In this article, we improve the performance of secure computation of these string metrics without sacrificing security, generality, composability, and accuracy. We explore a new design methodology that allows us to reduce the asymptotic cost by a factor of O(logn) (where n denotes the input string length). In our experiments, we observe up to an order-of-magnitude savings in time and bandwidth compared to the best prior results. We have also extended our semi-honest protocols to work in the malicious model.
Keyword:
Secure string matching
privacy-preserving genome comparison
secure edit-distance
secure Needleman-Wunsch
secure LCS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.5K
被引数:
9.6K
机构
引用论文
.png){kind=icon}
Community preparedness for COVID-19 and frontline health workers in Chhattisgarh恰蒂斯加尔邦的社区对COVID-19的准备情况及一线卫生工作者
OAAI
OAAI分享收藏
查看更多内容