Verifiably Randomized Quick-Sort Protocols in the Presence of Malicious Adversaries

The sorting protocols are applied extensively in the real-world (say, a key to the auto-partitions problem and the kthranked element problem). This paper studies random quick-sort protocols in the presence of malicious adversaries and makes the following twofold contributions. · In the first fold, a new notion which we call verifiably randomized quick-sort protocols is introduced and formalized. · In the second fold, an efficient implementation of the primitive from homomorphic commitment schemes is proposed and analyzed. We show that our implementation is provably secure assuming that the underlying homomorphic commitment scheme is statistically hiding and computationally binding in the common reference model.