Secure MPC Research Articles

An Integration Framework of Secure Multiparty Computation and Deep Neural Network for Improving Drug-Drug Interaction Predictions.

Drug-drug interaction (DDI) is a key concern in drug development and pharmacovigilance. It is important to improve DDI predictions by integrating multisource data from various pharmaceutical companies. Unfortunately, the data privacy and financial interest issues seriously influence the interinstitutional collaborations for DDI predictions. We propose multiparty computation DDI (MPCDDI), a secure MPC-based deep learning framework for DDI predictions. MPCDDI leverages the secret sharing technologies to incorporate the drug-related feature data from multiple institutions and develops a deep learning model for DDI predictions. In MPCDDI, all data transmission and deep learning operations are integrated into secure MPC frameworks to enable high-quality collaboration among pharmaceutical institutions without divulging private drug-related information. The results suggest that MPCDDI is superior to other eight baselines and achieves the similar performance to that of the corresponding plaintext collaborations. More interestingly, MPCDDI significantly outperforms methods that use private data from the single institution. In summary, MPCDDI is an effective framework for promoting collaborative and privacy-preserving drug discovery.

The development of secure multi-party computation

In an increasingly technological world, some significant issues that have developed in the past few years are privacy and data protection. This is generalized in the broad field of cryptography. People often use concepts from cryptography to find ways to access a distributed set of data without exposing or altering it, protecting them from outside parties obtaining access to their data for malicious purposes. This is often achieved through a specific method called Secure Multi-Party Computation. Throughout the past few decades, improvements in Secure MPC have skyrocketed, becoming an essential part of society. Whether in finance, statistics, or just typical data collection and protection, Secure MPC plays an important role. This paper will discuss the history behind Secure MPC as well as some of its modern-day applications. Furthermore, this paper will analyze the advantages and disadvantages of Secure MPC, evaluating its potential for growth in the coming century.

Multi-key Fully Homomorphic Encryption without CRS from RLWE

Fully Homomorphic Encryption (FHE) is a powerful encryption system in cloud computing that allows homomorphic computations on encrypted data without decrypting them. Multi-key fully homomorphic encryption (MFHE), as an extension to FHE, allows homomorphic computations on ciphertexts encrypted under different keys. However, most MFHE schemes require a Common Random/Reference String (CRS), while the few that do not are based on the Learning With Errors (LWE) problem, which means that they can only deal with single bit plaintext. Consequently, MFHE schemes based on the Ring Learning With Errors (RLWE) problem are more desirable, as they can handle polynomial plaintext. Requiring the CRS seems to weaken the semantic definition of MFHE, where all users generate their own keys independently. In this paper, we study the RLWE-based MFHE in the CRS model and propose the first RLWE-based MFHE without a CRS. To this end, we remove the CRS by designing a relinearization algorithm without a CRS. Like previous MFHE schemes, our RLWE-based MFHE without CRS has a simple 1-round threshold decryption, which implies a 3-round secure MPC protocol in the plain model from the RLWE assumption.

Adaptively Secure MPC with Sublinear Communication Complexity

Adaptively Secure MPC with Sublinear Communication Complexity

A Reliable Application of MPC for Securing the Tri-Training Algorithm

Due to the widespread use of distributed data mining techniques in a variety of areas, the issue of protecting the privacy of sensitive data has received increasing attention in recent years. Privacy-preserving distributed data mining (PPDDM) focuses on decentralized data analysis without the disclosure of sensitive information from data owner. However, the previous PPDDM mostly works on a limited amount of labeled data. In contrast to the real world, unlabeled data is abundance and labeled data is scarce. The objectives of this paper are to study and to analyze privacy-preserving properties of semi-supervised learning (SSL) algorithm with the combination of labeled and unlabeled data, where data is distributed among multiple data owners. In this paper we propose a Privacy-preserving Distributed Data Mining (PPDDM) method by designing a reliable application of secure MPC to semi-supervised tri-training algorithms. We simulate the original tri-training algorithm and tri-training algorithm with secure MPC using a different types of classifiers and datasets. The simulation results show that tri-training in secure MPC has almost same accuracy compared to original tri-training algorithm. We also compare execution time in addition to performance evaluation of tri-training in secure and the original tri-training algorithms.

Privacy in blockchain systems

Privacy of blockchains has been a matter of discussion since the inception of Bitcoin. Various techniques with a varying degree of privacy protection and complexity have been proposed over the past decade. In this survey, we present a systematic analysis of these proposals in four categories: (i) identity, (ii) transaction, (iii) consensus, and (iv) smart contract privacy. Each of these categories have privacy requirements of its own, and various solutions have been proposed to meet these requirements. Almost every technique in the literature of privacy enhancing technologies have been applied to blockchains: mix networks, zero-knowledge proofs, blind signatures, ring signatures, secure MPC, homomorphic encryption, to name just a few. We analyze each category separately in the paper. We first define the related privacy issues, and then review the proposed solutions. The limitations of each solution and the attacks discovered are also discussed along with the proposals. For each category, we first define the relevant privacy issues, and then review the proposed solutions along with their features and limitations

Privacy-preserving protocols for secure and reliable data aggregation in IoT-enabled Smart Metering systems

As the Internet of Things (IoT) gets more pervasive, its areas of usage expands. Smart Metering systems is such an IoT-enabled technology that enables convenient and high frequency data collection compared to existing metering systems. However, such a frequent data collection puts the consumers’ privacy in risk as it helps expose the consumers’ daily habits. Secure in-network data aggregation can be used to both preserve consumers’ privacy and reduce the packet traffic due to high frequency metering data. The privacy can be provided by performing the aggregation on concealed metering data. Fully homomorphic encryption (FHE) and secure multiparty computation (secure MPC) are the systems that enable performing multiple operations on concealed data. However, both FHE and secure MPC systems have some overhead in terms of data size or message complexity. The overhead is compounded in the IoT-enabled networks such as Smart Grid (SG) Advanced Metering Infrastructure (AMI). In this paper, we propose new protocols to adapt FHE and secure MPC to be deployed in SG AMI networks that are formed using wireless mesh networks. The proposed protocols conceal the smart meters’ (SMs) reading data by encrypting it (FHE) or computing its shares on a randomly generated polynomial (secure MPC). The encrypted data/computed shares are aggregated at some certain aggregator SM(s) up to the gateway of the network in a hierarchical manner without revealing the readings’ actual value. To assess their performance, we conducted extensive experiments using the ns-3 network simulator. The simulation results indicate that the secure MPC-based protocol can be a viable privacy-preserving data aggregation mechanism since it not only reduces the overhead with respect to FHE but also almost matches the performance of the Paillier cryptosystem when it is used within a proper sized AMI network.