Abstract. Privacy preserving multiset union (PPMU) protocol allows a set of parties, each with a multiset, to collaboratively compute a mul-tiset union secretly, meaning that any information other than union is not revealed. We propose efficient PPMU protocols, using multiplicative homomorphic cryptosystem. The novelty of our protocol is to directly encrypt a polynomial by representing it by an element of an extension field. The resulting protocols consist of constant rounds and improve communication cost. We also prove the security of our protocol against malicious adversaries, in the random oracle model. 1
We present a constant-round protocol for general secure multiparty computation which makes a black-...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
We present a privacy-assured multiplication protocol using which an arbitrary arithmetic formula wit...
In many important applications, a collection of mutually distrustful parties must perform private c...
This paper studies a multi-party private set union (mPSU), a fundamental cryptographic problem that ...
In many important applications, a collection of mutually distrustful parties must perform private co...
Abstract. We study the design of efficient and private protocols for polynomial operations in the sh...
In our increasingly digital society, we are making a growing amount of data available to computers, ...
© 2017 Kim Sasha RamchenA fundamental problem in large distributed systems is how to enable parties ...
In this paper we are interested in efficient and secure constant round multi-party protocols which p...
When datasets are distributed on different sources, finding out matched data while preserving the pr...
In this paper we are interested in efficient and secure constant round multi-party protocols which p...
Privacy-preserving set operations are useful for many data mining algorithms as building tools. Prot...
We revisit the problem of constructing efficient secure two-party protocols for the problems of set-...
Secure multi-party computation (MPC) is one of the most important primitives in cryptography. Severa...
We present a constant-round protocol for general secure multiparty computation which makes a black-...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
We present a privacy-assured multiplication protocol using which an arbitrary arithmetic formula wit...
In many important applications, a collection of mutually distrustful parties must perform private c...
This paper studies a multi-party private set union (mPSU), a fundamental cryptographic problem that ...
In many important applications, a collection of mutually distrustful parties must perform private co...
Abstract. We study the design of efficient and private protocols for polynomial operations in the sh...
In our increasingly digital society, we are making a growing amount of data available to computers, ...
© 2017 Kim Sasha RamchenA fundamental problem in large distributed systems is how to enable parties ...
In this paper we are interested in efficient and secure constant round multi-party protocols which p...
When datasets are distributed on different sources, finding out matched data while preserving the pr...
In this paper we are interested in efficient and secure constant round multi-party protocols which p...
Privacy-preserving set operations are useful for many data mining algorithms as building tools. Prot...
We revisit the problem of constructing efficient secure two-party protocols for the problems of set-...
Secure multi-party computation (MPC) is one of the most important primitives in cryptography. Severa...
We present a constant-round protocol for general secure multiparty computation which makes a black-...
Classical results in unconditionally secure multi-party computation (MPC) protocols with a passive a...
We present a privacy-assured multiplication protocol using which an arbitrary arithmetic formula wit...