Anonymous veto network
In cryptography, the anonymous veto network is a multi-party secure computation protocol to compute the boolean-OR function. It was first proposed by Feng Hao and Piotr Zieliński in 2006. This protocol presents an efficient solution to the Dining cryptographers problem.
A related protocol that securely computes a boolean-count function is open vote network.
Description
All participants agree on a group with a generator of prime order in which the discrete logarithm problem is hard. For example, a Schnorr group can be used. For a group of participants, the protocol executes in two rounds.Round 1: each participant selects a random value and publishes the ephemeral public key together with a zero-knowledge proof for the proof of the exponent. A detailed description of a method for such proofs is found in.
After this round, each participant computes:
Round 2: each participant publishes and a zero-knowledge proof for the proof of the exponent. Here, the participants chose if they want to send a "0" bit, or a random value if they want to send a "1" bit.
After round 2, each participant computes. If no one vetoed, each will obtain. On the other hand, if one or more participants vetoed, each will have.