There is a growing demand for sharing data repositories that often contain personal information across multiple autonomous, possibly untrusted, and private databases. This paper discusses constraints imposed by individual privacy as well as institutional data confidentiality on data mining across multiple databases and presents our initial solutions. We develop a suite of decentralized protocol...

AES block cipher is an important cryptographic primitive with many applications. In this work, we describe how to efficiently implement the AES-128 block cipher in the multiparty setting where the key and the plaintext are both in a secret-shared form. In particular, we study several approaches for AES S-box substitution based on oblivious table lookup and circuit evaluation. Given this secure ...

In the area of secure multiparty computation, most researchers either propose general solutions in theory or design protocols for specific problems in practice. However, as the general, theoretical solutions are usually of intolerable complexities, specifically tailored protocols often lack of systematic privacy validation procedures. Therefore, a method bridging the gap between the prohibitive...

Multiparty computation is raising importance because its primary objective to replace any trusted third party in the distributed computation. This work presents two multiparty shuffling protocols where each party, possesses a private input, agrees on random permutation while keeping secret. The proposed are based network, thereby data-oblivious. first proposal -permute that permutes inputs all ...

Consider a multilayer graph, where the different layers correspond to different proprietary social networks on the same ground set of users. Suppose that the owners of the different networks (called hosts) are mutually non-trusting parties: how can they compute a centrality score for each of the users using all the layers, but without disclosing information about their private graphs? Under thi...

Typically, when secrecy multiplication is performed in multiparty computation using Shamir’s (k, n) threshold secret sharing scheme, the result is a polynomial with degree of 2k − 2 instead of k − 1. This causes a problem where, in order to reconstruct a multiplication result, the number of polynomials needed will increase from k to 2k − 1. Shingu et al. proposed a method to solve the problem t...

As a fundamental primitive, Secure Multiparty Summation and Multiplication can be used to build complex secure protocols for other multiparty computations, specially, numerical computations. However, there is still lack of systematical and efficient quantum methods to compute Secure Multiparty Summation and Multiplication. In this paper, we present a novel and efficient quantum approach to secu...

Secure multiparty computation (MPC) allows for joint over private data from multiple entities, usually backed by powerful cryptographic techniques that protect sensitive data. Several high-level programming languages have been proposed to make writing MPC applications accessible non-experts. These typically require developers enforce security policies within the logic of secure application itse...