Multiparty computation is raising importance because its 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 ‐permute that permutes n inputs in all n! possible ways. n‐permute network consists of 2logn−1 layers, and in each layer there are n/2 gates. Our second protocol is nπ‐permute shuffling that defines a permutation set Π=false{π1,…,πNfalse} where ∣Π∣
Funding informationNo Funding is available 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-per mut e 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 π -permute shuffling that defines a permutation set Π = {π 1 , . . . , π N } where |Π| < n!, and the resultant shuffling is a random permutation π i ∈ Π. The n π -permute network contains leases number of layers compare to n-permute network. Let n = n 1 n 2 , the n π -permute network would defineThe proposed shuffling protocols are unconditionally secure against malicious adversary who can corrupt at most t < n/3 parties. The probability that adversary can learn the outcome of n-permute is upper bound by ((n − t )!) −1 . Whereas, the probability that adversary can learn the outcome of n πpermute is upper bounded by f Π (n 1 − θ 1 ) n 2 2 θ 2 −1 , for some Abbreviations: ABC, a black cat; DEF, doesn't ever fret; GHI, goes home immediately.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.