Amortizing Randomness in Private Multiparty Computations

We study the relationship between the number of rounds needed to repeatedly perform a private computation i.e., where there are many sets of inputs sequentially given to the players on which the players must compute a function privately and the overall randomness needed for this task. For the xor function, we show that by re-using the same ` random bits we can signi cantly speedup the round-complexity of each computation compared to what is achieved by the naive strategy of partitioning the ` random bits between the computations. Moreover, we prove that our protocols are optimal in the amount of randomness they require.

• Type: Conference
• Year: 1998
• Where: PODC
• Authors: Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén
• Keywords: Distributed And Parallel Computing, Overall Randomness, PODC 1998, Private Computation, Random Bits