000			nam a22 4500
999			_c32518 _d32518
008			230901b xxu||||| |||| 00| 0 eng d
020			_a9783031121630
082			_a005.8 _bCHO
100			_aChoudhury, Ashish
245			_aSecure MultiParty Computation Against Passive Adversaries
260			_bSpringer, _c2022 _aCham :
300			_axiii, 231 p. ; _bill., _c25 cm
365			_b54.99 _cEUR _d94.90
490			_aSynthesis lectures on distributed computing theory
504			_aIncludes bibliography.
520			_aThis 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 authors present seminal possibility and feasibility results in this model and includes formal security 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-trivial and demands sophisticated and highly advanced techniques. MPC is a fundamental concept, 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 private inputs to jointly and securely perform any computation on their inputs. Examples of such computation include, but not limited to, privacy-preserving data mining; secure e-auction; private set-intersection; and privacy-preserving machine learning. MPC protocols emulate the role of an imaginary, centralized trusted third party (TTP) that collects the inputs of the parties, performs the desired computation, and publishes the result. Due to its powerful abstraction, the MPC problem has been widely studied over the last four decades. In addition, this book: Includes detailed security proofs for seminal protocols and state-of-theart efficiency improvement techniques Presents protocols against computationally bounded as well as computationally unbounded adversaries Focuses on MPC protocols in the passive corruption model, presents seminal possibility and feasibility results, and features companion video lectures.
650			_aComputer security
650			_aAbelian group
650			_a Boolean circuit
650			_aCiphertexts
650			_aComputationally indistinguishable
650			_aCorrupt pareties
650			_a Evaluation
650			_aF Mult
650			_aGyao
650			_a Hard-core predicate
650			_a MPC protocol
650			_aMultiplication gates
650			_aOblivious transfer
650			_aProbability distribution
650			_aPseudorandom
650			_aSecuritycomputing
650			_aT-degree polynomial
650			_aXOR gate
700			_aPatra, Arpita
942			_2ddc _cBK