國立虎尾科技大學 |

Secure Multi-Party Computation Against Passive Adversaries

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Secure Multi-Party Computation Against Passive Adversaries/ by Ashish Choudhury, Arpita Patra.
Author:	Choudhury, Ashish.
other author:	Patra, Arpita.
Description:	XIII, 231 p. 85 illus., 50 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Cryptography. -
Online resource:	https://doi.org/10.1007/978-3-031-12164-7
ISBN:	9783031121647

Secure Multi-Party Computation Against Passive Adversaries
Choudhury, Ashish.

Secure Multi-Party Computation Against Passive Adversaries[electronic resource] /by Ashish Choudhury, Arpita Patra. - 1st ed. 2022. - XIII, 231 p. 85 illus., 50 illus. in color.online resource. - Synthesis Lectures on Distributed Computing Theory,2155-1634. - Synthesis Lectures on Distributed Computing Theory,.

Introduction -- 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.

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 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.

ISBN: 9783031121647

Standard No.: 10.1007/978-3-031-12164-7doiSubjects--Topical Terms:

567927
Cryptography.

LC Class. No.: QA268

Dewey Class. No.: 005.824

Secure Multi-Party Computation Against Passive Adversaries
LDR:03441nam a22004095i 4500 001 1084085
003 DE-He213
005 20221007122013.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031121647 $9 978-3-031-12164-7
024 7 $a 10.1007/978-3-031-12164-7 $2 doi
035 $a 978-3-031-12164-7
050 4 $a QA268
072 7 $a GPJ $2 bicssc
072 7 $a URY $2 bicssc
072 7 $a COM053000 $2 bisacsh
072 7 $a GPJ $2 thema
072 7 $a URY $2 thema
082 0 4 $a 005.824 $2 23
100 1 $a Choudhury, Ashish. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1390294
245 1 0 $a Secure Multi-Party Computation Against Passive Adversaries $h [electronic resource] / $c by Ashish Choudhury, Arpita Patra.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XIII, 231 p. 85 illus., 50 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Synthesis Lectures on Distributed Computing Theory, $x 2155-1634
505 0 $a Introduction -- 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 $a 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 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 0 $a Cryptography. $3 567927
650 0 $a Data encryption (Computer science). $3 1051084
650 0 $a Data protection. $3 557764
650 0 $a Data protection—Law and legislation. $3 1366218
650 0 $a Computer security. $3 557122
650 0 $a Computer networks—Security measures. $3 1366173
650 1 4 $a Cryptology. $3 1211076
650 2 4 $a Security Services. $3 1211616
650 2 4 $a Data and Information Security. $3 1365785
650 2 4 $a Privacy. $3 575491
650 2 4 $a Principles and Models of Security. $3 1225876
650 2 4 $a Mobile and Network Security. $3 1211619
700 1 $a Patra, Arpita. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1197108
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031121630
776 0 8 $i Printed edition: $z 9783031121654
776 0 8 $i Printed edition: $z 9783031121661
830 0 $a Synthesis Lectures on Distributed Computing Theory, $x 2155-1634 $3 1390295
856 4 0 $u https://doi.org/10.1007/978-3-031-12164-7
912 $a ZDB-2-SXSC
950 $a Synthesis Collection of Technology (R0) (SpringerNature-85007)