Secure Multi-Party Computation Against Passive Adversaries [#489311]

Secure Multi-Party Computation Against Passive Adversaries
English | 2022 | ISBN: 3031121635 | 238 Pages | PDF (True) | 12 MB
This book focuses on multi-party computation (MPC) protocols in the passive corruption model (also known as the semi-honest or honest-but-curious model). The authorspresent seminal possibility and feasibility results in this model and includes formalsecurity proofs. Even though the passive corruption model may seem very weak,achieving security against such a benign form of adversary turns out to be non-trivialand demands sophisticated and highly advanced techniques. MPC is a fundamentalconcept, both in cryptography as well as distributed computing. On a very high level, an MPC protocol allows a set of mutually-distrusting parties with their privateinputs to jointly and securely perform any computation on their inputs. Examples ofsuch computation include, but not limited to, privacy-preserving data mining; securee-auction; private set-intersection; and privacy-preserving machine learning. MPCprotocols emulate the role of an imaginary, centralized trusted third party (TTP) thatcollects the inputs of the parties, performs the desired computation, and publishes theresult. Due to its powerful abstraction, the MPC problem has been widely studied overthe last four decades.