000			03965nam a22004455i 4500
999			_c386921 _d386921
001			386921
003			ES-MaUEC
005			20230205131712.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			221007s2022 sz | s |||| 0|eng d
020			_a9783031121647
024	7		_a10.1007/978-3-031-12164-7 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA76.9.A25 _b2022 EB
100	1		_aChoudhury, Ashish _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686603
245	1	0	_aSecure Multi-Party Computation Against Passive Adversaries _cby Ashish Choudhury, Arpita Patra
250			_a1st edition 2022
264		1	_aCham _bSpringer International Publishing _c2022
300			_a1 recurso en línea (XIII, 231 páginas) _b85 ilustraciones, 50 ilustraciones en blanco y negro
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Distributed Computing Theory _x2155-1634
505	0		_aIntroduction -- Relevant Topics from Abstract Algebra -- Secret Sharing -- A Toy MPC Protocol -- The BGW Perfectly-Secure MPC Protocol for Linear Functions -- The BGW Perfectly-Secure MPC Protocol for Any Arbitrary Function -- Perfectly-Secure MPC in the Pre-Processing Model -- Perfectly-Secure MPC Tolerating General Adversaries -- Perfectly-Secure MPC for Small Number of parties -- The GMW MPC Protocol -- Oblivious Transfer.
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.
988			_aSynthesis Collection of Technology_2022
650		7	_2embne _9158200 _aSeguridad informática
650		7	_2embne _9150657 _aProtocolos de comunicación
650		7	_2embne _9145503 _aMatemáticas aplicadas
700	1		_aPatra, Arpita _eautor _0(orcid)0000-0002-8036-4407 _1https://orcid.org/0000-0002-8036-4407 _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686604
776	0	8	_iPrinted edition: _z9783031121630
776	0	8	_iPrinted edition: _z9783031121654
776	0	8	_iPrinted edition: _z9783031121661
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-12164-7 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2023 _dz _esc _zSI