A Dynamic Trade-off Between Active and Passive Corruptions in Secure Multi-Party Computation

Multi-Party Computation (MPC) allows a set of n parties to securely compute a (probabilistic) function f in a distributed manner, where security means that secrecy of the inputs and correctness of the output are maintained even when some of the parties are dishonest. The dishonesty of parties is modeled with a central adversary who corrupts parties. The adversary can be passive, i.e., can read the internal state of the corrupted parties, or active, i.e., can make the corrupted parties deviate arbitrarily from the protocol.

Provided by: ETH Zurich Topic: Security Date Added: Aug 2013 Format: PDF

Find By Topic