Overview
- 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 and presents seminal possibility and feasibility results
Part of the book series: Synthesis Lectures on Distributed Computing Theory (SLDCT)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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.
Similar content being viewed by others
Keywords
Table of contents (13 chapters)
-
Front Matter
-
Back Matter
Authors and Affiliations
About the authors
Ashish Choudhury, Ph.D., is an Associate Professor at the Inter national Institute of Information Technology, Bangalore, India. He received his M.S. and Ph.D. degrees from the Indian Institute of Technology, Madras, India. His research interests include theoretical cryptography, with specialization in cryptographic protocols.
Arpita Patra, Ph.D., is an Associate Professor at the Indian Institute of Science. She received her Ph.D from the Indian Institute of Technology and held post-doctoral positions at the University of Bristol, ETH Zurich, and Aarhus University. Her research interests include cryptography, with a focus on theoretical and practical aspects of secure multiparty computation protocols.
Arpita Patra, Ph.D., is an Associate Professor at the Indian Institute of Science. She received her Ph.D from the Indian Institute of Technology and held post-doctoral positions at the University of Bristol, ETH Zurich, and Aarhus University. Her research interests include cryptography, with a focus on theoretical and practical aspects of secure multiparty computation protocols.
Bibliographic Information
Book Title: Secure Multi-Party Computation Against Passive Adversaries
Authors: Ashish Choudhury, Arpita Patra
Series Title: Synthesis Lectures on Distributed Computing Theory
DOI: https://doi.org/10.1007/978-3-031-12164-7
Publisher: Springer Cham
eBook Packages: Synthesis Collection of Technology (R0), eBColl Synthesis Collection 11
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
Hardcover ISBN: 978-3-031-12163-0Published: 08 October 2022
Softcover ISBN: 978-3-031-12166-1Published: 09 October 2023
eBook ISBN: 978-3-031-12164-7Published: 07 October 2022
Series ISSN: 2155-1626
Series E-ISSN: 2155-1634
Edition Number: 1
Number of Pages: XIII, 231
Number of Illustrations: 35 b/w illustrations, 50 illustrations in colour
Topics: Cryptology, Security Services, Systems and Data Security, Privacy, Principles and Models of Security, Mobile and Network Security