Secure Multi-party Computation for selecting a solution according to a uniform distribution over all solutions of a general combinatorial problem.
Marius-Cǎlin Silaghi · 2004
Secure simulations of arithmetic circuit and boolean circuit evaluations are known to save privacy while providing solutions to any probabilistic function over a field. The problem we want to solve is to select a random solution of a general combinatorial problem. Here we discuss how to specify the need of selecting a random solution of a general combinatorial problem, as a probabilistic function. Arithmetic circuits for finding the set of all solutions are simple to design [24].