返回
Fast Privacy-Preserving Text Classification Based on Secure Multiparty Computation
DOI:10.1109/TIFS.2022.3144007.png)
摘要
En 中文
We propose a privacy-preserving Naive Bayes classifier and apply it to the problem of private text classification. In this setting, a party (Alice) holds a text message, while another party (Bob) holds a classifier. At the end of the protocol, Alice will only learn the result of the classifier applied to her text input and Bob learns nothing. Our solution is based on Secure Multiparty Computation (SMC). Our Rust implementation provides a fast and secure solution for the classification of unstructured text. Applying our solution to the case of spam detection (the solution is generic, and can be used in any other scenario in which the Naive Bayes classifier can be employed), we can classify an SMS as spam or ham in less than 340ms in the case where the dictionary size of Bob's model includes all words (n = 5200) and Alice's SMS has at most m = 160 unigrams. In the case with n = 369 and m = 8 (the average of a spam SMS in the database), our solution takes only 21 ms.
Keyword:
Privacy-preserving classification
secure multiparty computation
Naive Bayes
spam
期刊
IF:
8
论文数:
5.3K
被引数:
2.3W
机构
引用论文
Arterial injuries in electrically burned upper limbs and effects of early reconstruction of blood circulation to the wrist
Burns
IF0
PrivFT: Private and Fast Text Classification With Homomorphic EncryptionPrivFT: 具有同态加密的私有和快速文本分类
IEEE ACCESS
IF3.6
Interaction of .theta.-Toxin (Perfringolysin O), a Cholesterol-Binding Cytolysin, with Liposomal Membranes: Change in the Aromatic Side Chains upon Binding and Insertion
Biochemistry
IF0

