Search Results

My question is about this paper: Privacy-preserving set operations: http://www.cs.cmu.edu/~leak/papers/set-tech.pdf Let all polynomials be defined over a ring $\mathbb{Z}_p$, where $p$ is a prime …

As we know, in order to have multi-party protocol secure against the malicious parties, researchers usually utilise the standard techniques such as zero-knowledge proofs or cut-and-choose technique. …

Let assume party $B$ wants to receive secure multi-party computation (MPC) output. The are many private set intersection (PSI) protocols that support only two parties but they cannot support multi-par …

Assume in the real model a party blinds a fixed element $b$ as: $v_i=r_i\cdot b$, where $r_i$ is a output of pseudorandom function. So we give $v_i$ to a semi-honest adversary. Now we want to sketch …

Please consider the following scenario: The user A and B use their keys, K1 and K2 respectively. Each client have a vector of elements. Each client separately permutes his vector using his key and out …

Assume we have a pseudorandom function: PRF(.) We want the following property holds with a high probability: $\forall i, 0\leq i \leq n: PRF(k_1, i)\neq PRF(k_2,i)$ where $k_1$ and $k_2$ are two r …

My question in general is: Question 1: What are the differences between sketch of proof and full proof? In simulation-based proof, in semi-honest model, we construct a view that is computationally …

Let $E(m)$ a be the encryption operation using Paillier encryption scheme. Let $N$ be the public key and $p$ be a large prime number, such that $p<N$. Question: Is there any protocol, that given $E( …

Assume $N$ is a public key for paillier encryption, generated by a third party. Question: Given $N$ can each client generate its own private key, such that its public key is $N$? So all parties separ …