Multiparty Protocol that Usually Shuffles

Dhaneshwar Mardi, Surbhi Tanwar, Jaydeep Howlader

Multiparty computation is raising importance because it's primary objective is 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 a random permutation while keeping the permutation secret. The proposed shuffling protocols are based on permutation network, thereby data-oblivious. The first proposal is $n\text{-}permute$ that permutes $n$ inputs in all $n!$ possible ways. $n$-permute network consists of $2\log{n}-1$ layers, and in each layer there are $n/2$ gates. Our second protocol is $n_{\pi}$-permute shuffling that defines a permutation set $\Pi=\{\pi_1,\dots,\pi_N\}$ where $|\Pi| < n!$, and the resultant shuffling is a random permutation $\pi_i \in \Pi$. The $n_{\pi}$-permute network contains leases number of layers compare to $n$-permute network. Let $n=n_1n_2$, the $n_{\pi}$-permute network would define $2\log{n_1}-1+\log{n_2}$ layers. \par The proposed shuffling protocols are unconditionally secure against malicious adversary who can corrupt at most $t

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment