- 期刊
Privacy-preserving Similarity Sorting in Multi-party Model
摘要
In social network, it is conceivable that a rational execution sequence does good to cooperative mission, especially for a large number of participants. However, there are many difficulties for multi-party computation, the most important of which is privacy. In this paper, secure multiparty computation technology and dimensionality reduction are chosen to design a privacy-preserving protocol, which sorts m people according to their similarity. In a n dimensional system, the secure protocol's time complexity is O(mn+n+mlogm) and communication complexity is O(m). Detailed analysis about security and applicability are also presented in this paper. In addition, the protocol can be improved in security at the cost of complexity, with an arbitration agreement designed against fraud.
延伸閱讀
- Chao, W. C. (2021). Function Similarity Comparison System using Deep Learning and Dynamic Analysis [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU202103210
- Xia, H., & Yang, W. (2022). Information Entropy Models and Privacy Metrics Methods for Privacy Protection. International Journal of Network Security, 24(1), 1-10. https://doi.org/10.6633/IJNS.202201_24(1).01
- chunlakan, K. (2018). A Study of K-anonymity Model for Privacy Preserving Data Mining [master's thesis, National Formosa University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0028-1301201821104700
- Huang, Y. S. (2015). A Query-Efficient Algorithm for String-Similarity Search [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2015.00281
- 鄭心祺（2004）。Using Sampling Method in Privacy Preserving of Association Rule Mining〔碩士論文，元智大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0009-0112200611311131