Secure multi-party computation against passive adversaries / Ashish Choudhury, Arpita Patra.

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

Full description

Saved in:
Bibliographic Details
Main Authors: Choudhury, Ashish (Author), Patra, Arpita (Author)
Format: Ebook
Language:English
Published: Cham : Springer, [2022]
Series:Synthesis lectures on distributed computing theory.
Subjects:
Online Access:Springer Nature Synthesis Collection of Technology (R0) eBook Collection 2022
Description
Summary:"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."--Publisher's website.
Physical Description:1 online resource (xiii, 231 pages) : illustrations (some colour).
Bibliography:Includes bibliographical references.
ISBN:3031121635
3031121643
9783031121630
9783031121647
Requests
Request this item Request this AUT item so you can pick it up when you're at the library.
Interlibrary Loan With Interlibrary Loan you can request the item from another library. It's a free service.