Cryptology ePrint Archive: Report 2021/069

Fast Privacy-Preserving Text Classification based on Secure Multiparty Computation

Amanda Resende and Davis Railsback and Rafael Dowsley and Anderson C. A. Nascimento and Diego F. Aranha

Abstract: 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 21ms.

Category / Keywords: cryptographic protocols /

Date: received 18 Jan 2021, last revised 8 Jun 2021

Contact author: amanda resende at ic unicamp br, drail at uw edu, rafael dowsley at monash edu, andclay at uw edu, dfaranha at cs au dk

Available format(s): PDF | BibTeX Citation

Version: 20210608:062000 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]