Secure MultiParty Computation Against Passive Adversaries (Record no. 32518)

000 -LEADER
fixed length control field nam a22 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 230901b xxu||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783031121630
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.8
Item number CHO
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Choudhury, Ashish
245 ## - TITLE STATEMENT
Title Secure MultiParty Computation Against Passive Adversaries
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Name of publisher, distributor, etc Springer,
Date of publication, distribution, etc 2022
Place of publication, distribution, etc Cham :
300 ## - PHYSICAL DESCRIPTION
Extent xiii, 231 p. ;
Other physical details ill.,
Dimensions 25 cm
365 ## - TRADE PRICE
Price amount 54.99
Price type code EUR
Unit of pricing 94.90
490 ## - SERIES STATEMENT
Series statement Synthesis lectures on distributed computing theory
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc Includes bibliography.
520 ## - SUMMARY, ETC.
Summary, etc 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 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer security
Topical term or geographic name as entry element Abelian group
Topical term or geographic name as entry element Boolean circuit
Topical term or geographic name as entry element Ciphertexts
Topical term or geographic name as entry element Computationally indistinguishable
Topical term or geographic name as entry element Corrupt pareties
Topical term or geographic name as entry element Evaluation
Topical term or geographic name as entry element F Mult
Topical term or geographic name as entry element Gyao
Topical term or geographic name as entry element Hard-core predicate
Topical term or geographic name as entry element MPC protocol
Topical term or geographic name as entry element Multiplication gates
Topical term or geographic name as entry element Oblivious transfer
Topical term or geographic name as entry element Probability distribution
Topical term or geographic name as entry element Pseudorandom
Topical term or geographic name as entry element Securitycomputing
Topical term or geographic name as entry element T-degree polynomial
Topical term or geographic name as entry element XOR gate
700 ## - ADDED ENTRY--PERSONAL NAME
Personal name Patra, Arpita
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Item type Books
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Permanent location Current location Date acquired Cost, normal purchase price Full call number Barcode Date last seen Koha item type
          DAIICT DAIICT 2023-08-27 5218.55 005.8 CHO 034171 2023-09-01 Books

Powered by Koha