A Verifiable Agreement Protocol for Honest Majorities Sample Clauses

A Verifiable Agreement Protocol for Honest Majorities. Protocol 1. Let π be an agreement protocol (Definition 4) for an honesty struc- ture 7, input and output sets X and Y and a validity function F . – consensus[]: 1. The parties first run the protocol π on their inputs xi for the identifier tid. As soon as a party Pi obtains output yi to all participants. failed, it sends mi := signi(tid, ▇▇) { } { } ∈ 2. We call any set M = signj1 (tid, y), . . . , signjk (tid, y) where Pj1 , ..., Pjk a proof set for (tid, y). Pi waits until it has received a proof set for (tid, yi). – verify[]: The verifier V accepts the result y for some tid if and only if it receives a proof set for (tid, y) where y /= failed. ♦