Privacy-preserving Hamming and Edit Distance Computation and Applications
With the rapid development of information technology,privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical applications,people measure the similarity of t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial office of Computer Science
2022-09-01
|
| Series: | Jisuanji kexue |
| Subjects: | |
| Online Access: | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-9-355.pdf |
| _version_ | 1797845133216972800 |
|---|---|
| author | DOU Jia-wei |
| author_facet | DOU Jia-wei |
| author_sort | DOU Jia-wei |
| collection | DOAJ |
| description | With the rapid development of information technology,privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical applications,people measure the similarity of two strings with Hamming(edit) distance.It is of great significance to study privacy-preserving Hamming(edit) distance computation.This paper studies privacy-preserving Hamming(edit) distance computation.First,we transform Hamming distance computation to inner product computation of vectors,and then use Okamoto-Uchiyama(OU) cryptosystem and encryption-and-choose technique to design protocol for Hamming distance.Second,we give each alphabet of a string a number,transform edit distance to determine whether the difference of the number of two alphabets is 0,and use OU cryptosystem to design a privacy-preserving edit distance computation protocol.The security of the protocol is strictly proved,the computational complexity of the protocol is analyzed,the actual implementation efficiency of the protocol is tested and compared with the existing results.Theoretical analysis and experimental results show that our protocols are efficient. |
| first_indexed | 2024-04-09T17:33:39Z |
| format | Article |
| id | doaj.art-6f3f8f0e0fef4062af0555d49567e212 |
| institution | Directory Open Access Journal |
| issn | 1002-137X |
| language | zho |
| last_indexed | 2024-04-09T17:33:39Z |
| publishDate | 2022-09-01 |
| publisher | Editorial office of Computer Science |
| record_format | Article |
| series | Jisuanji kexue |
| spelling | doaj.art-6f3f8f0e0fef4062af0555d49567e2122023-04-18T02:32:32ZzhoEditorial office of Computer ScienceJisuanji kexue1002-137X2022-09-0149935536010.11896/jsjkx.220100241Privacy-preserving Hamming and Edit Distance Computation and ApplicationsDOU Jia-wei0School of Mathematics and Statistics,Shaanxi Normal University,Xi'an 710119,ChinaWith the rapid development of information technology,privacy-preserving multiparty cooperative computation is becoming more and more popular.Secure multiparty computation is a key technology to address such problems.In scientific research and practical applications,people measure the similarity of two strings with Hamming(edit) distance.It is of great significance to study privacy-preserving Hamming(edit) distance computation.This paper studies privacy-preserving Hamming(edit) distance computation.First,we transform Hamming distance computation to inner product computation of vectors,and then use Okamoto-Uchiyama(OU) cryptosystem and encryption-and-choose technique to design protocol for Hamming distance.Second,we give each alphabet of a string a number,transform edit distance to determine whether the difference of the number of two alphabets is 0,and use OU cryptosystem to design a privacy-preserving edit distance computation protocol.The security of the protocol is strictly proved,the computational complexity of the protocol is analyzed,the actual implementation efficiency of the protocol is tested and compared with the existing results.Theoretical analysis and experimental results show that our protocols are efficient.https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-9-355.pdfsmc|hamming distance|edit distance|semi-honest model|simulation paradigm |
| spellingShingle | DOU Jia-wei Privacy-preserving Hamming and Edit Distance Computation and Applications Jisuanji kexue smc|hamming distance|edit distance|semi-honest model|simulation paradigm |
| title | Privacy-preserving Hamming and Edit Distance Computation and Applications |
| title_full | Privacy-preserving Hamming and Edit Distance Computation and Applications |
| title_fullStr | Privacy-preserving Hamming and Edit Distance Computation and Applications |
| title_full_unstemmed | Privacy-preserving Hamming and Edit Distance Computation and Applications |
| title_short | Privacy-preserving Hamming and Edit Distance Computation and Applications |
| title_sort | privacy preserving hamming and edit distance computation and applications |
| topic | smc|hamming distance|edit distance|semi-honest model|simulation paradigm |
| url | https://www.jsjkx.com/fileup/1002-137X/PDF/1002-137X-2022-49-9-355.pdf |
| work_keys_str_mv | AT doujiawei privacypreservinghammingandeditdistancecomputationandapplications |