MAS-Encryption and its Applications in Privacy-Preserving Classifiers
نویسندگان
چکیده
Homomorphic encryption (HE) schemes, such as fully homomorphic (FHE), support a number of useful computations on ciphertext in broad range applications, e-voting, private information retrieval, cloud security, and privacy protection. While FHE schemes do not require any interaction during computation, the key limitations are large expansion inefficiency. Thus, to overcome these limitations, we develop novel cryptographic tool, MAS-Encryption (MASE), real-value input secure computation multiply-add structure. The structures exist many important protocols, classifiers outsourced will explain how MASE can be used protect using two case study examples. Specifically, first example is privacy-preserving Naive Bayes classifier that achieve minimal risk, other vector machine. We prove constructed evaluate their performance real-world datasets. Experiments show our proposed scheme based efficient, sense an optimal tradeoff between efficiency communication interactions. avoid inefficiency paradigm.
منابع مشابه
Privacy Preserving using Homomorphic Encryption
In the recent time, privacy preserving has been studied extensively, because of the extensive explosion of sensitive information. Privacy preserving is one of the important areas that aim to provide security for secret information from unsolicited or unsanctioned disclosure. This has triggered the development of much privacy preserving technique using encryption algorithm. This work will presen...
متن کاملPrivacy Preserving Aggregation of Secret Classifiers
In this paper, we address the issue of privacy preserving data-mining. Specifically, we consider a scenario where each member j of T parties has its own private database. The party j builds a private classifier hj for predicting a binary class variable y. The aim of this paper consists of aggregating these classifiers hj in order to improve individual predictions. More precisely, the parties wi...
متن کاملPrivacy preserving record linkage using homomorphic encryption
The bloom filter method for privacy preserving record linkage [24] has been shown to be both efficient, and provide equivalent linkage quality to that achievable with unencoded identifiers [23]. However in some situations, the bloom filter method may be vulnerable to frequency attacks, which could potentially leak identifying information [18]. In this paper we extend the bloom filter protocol t...
متن کاملPrivacy Preserving Multiset Union with ElGamal Encryption
The privacy preserving multiset union (PPMU) protocol allows a set of parties, each with a multiset, to collaboratively compute a multiset union secretly, meaning that any information other than union is not revealed. We propose an efficient PPMU protocol, using multiplicative homomorphic property of ElGamal encryption over Fq[x]/f(x) where q is a prime and f(x) is an irreducible polynomial ove...
متن کاملPrivacy preserving biometrics using partially homomorphic encryption
We will look into privacy preserving biometrics using the example of a fingerprint reader and partially homomorphic encryption. Therefore we will cover the basics necessary to understand the discussed subject, partially homomorphic encryption and fingerprint based authentication, as well as showing a concrete protocol and its implications on performance and security of the system. While securit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2022
ISSN: ['1558-2191', '1041-4347', '2326-3865']
DOI: https://doi.org/10.1109/tkde.2020.3009221