國立虎尾科技大學 |

Compilation for secure multi-party computation

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Compilation for secure multi-party computation/ by Niklas Buscher, Stefan Katzenbeisser.
Author:	Buscher, Niklas.
other author:	Katzenbeisser, Stefan.
Published:	Cham :Springer International Publishing : : 2017.,
Description:	x, 93 p. :ill., digital ; : 24 cm.;
Contained By:	Springer eBooks
Subject:	Data protection. -
Online resource:	http://dx.doi.org/10.1007/978-3-319-67522-0
ISBN:	9783319675220

Compilation for secure multi-party computation
Buscher, Niklas.

Compilation for secure multi-party computation[electronic resource] /by Niklas Buscher, Stefan Katzenbeisser. - Cham :Springer International Publishing :2017. - x, 93 p. :ill., digital ;24 cm. - SpringerBriefs in computer science,2191-5768. - SpringerBriefs in computer science..

1 Motivation -- 2 Related Work -- 3 Introduction into MPC Protocols -- 4 A general framework to compile circuits for MPC -- 5 Compiling size-optimized circuits for MPC protocols with constant rounds -- 6 Compiling depth-optimized circuits for round-based MPC protocols -- 7 Compiling parallel circuits for MPC protocols -- 8 Appendix.

This book presents a holistic view on compiler assisted practical secure multi-party computation (MPC) over Boolean circuits. It discusses that two or more parties jointly evaluate a function over their inputs in such a way that each party keeps its input unknown to the other parties in MPC. MPC provides a generic way to construct Privacy-Enhancing Technologies, which protect sensitive data during processing steps in untrusted environments. A major obstacle in the past was to generate MPC applications by hand. Recently, special compilers have been developed to build all kinds of applications. This book also explains in detail how efficient MPC applications can be created automatically from ANSI-C, thus, bridging the areas of cryptography, compilation and hardware synthesis. It also gives an insight into the requirements for creating efficient applications for MPC and is hence of interest to not only researchers in the area of MPC but also developers realizing practical applications with MPC. For a better understanding of the complete compile chain from ANSI-C to circuits, which is the 'machine code' of MPC, the authors first give the necessary background information on MPC protocols, Boolean logic, and logic synthesis. Then the authors describe the various compilation steps required to translate any code into an adequate circuit description. Afterwards, the authors introduce a variety of optimization techniques for two classes of MPC protocols, namely techniques that improve the runtime of applications in constant- and multi-round MPC protocols. The authors also illustrate how efficient parallelization of MPC protocols can be achieved using the assistance of compilers. It presents the effectiveness of the proposed techniques by giving a detailed evaluation on benchmarking applications. Most of the aforementioned techniques are implemented in our open source compiler that is accompanying this book and allows to study compilation for MPC in practice.Researchers who are interested in practical secure multi-party computation (MPC), and developers who are interested in realizing MPC applications in practice will find this book useful as a reference, as well as advanced-level students in computer science.

ISBN: 9783319675220

Standard No.: 10.1007/978-3-319-67522-0doiSubjects--Topical Terms:

557764
Data protection.

LC Class. No.: QA76.9.A25

Dewey Class. No.: 005.8

Compilation for secure multi-party computation
LDR:03604nam a2200337 a 4500 001 921871
003 DE-He213
005 20171116140032.0
006 m d
007 cr nn 008maaau
008 190624s2017 gw s 0 eng d
020 $a 9783319675220 $q (electronic bk.)
020 $a 9783319675213 $q (paper)
024 7 $a 10.1007/978-3-319-67522-0 $2 doi
035 $a 978-3-319-67522-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A25
072 7 $a UR $2 bicssc
072 7 $a UTN $2 bicssc
072 7 $a COM053000 $2 bisacsh
082 0 4 $a 005.8 $2 23
090 $a QA76.9.A25 $b B977 2017
100 1 $a Buscher, Niklas. $3 1197056
245 1 0 $a Compilation for secure multi-party computation $h [electronic resource] / $c by Niklas Buscher, Stefan Katzenbeisser.
260 $a Cham : $c 2017. $b Springer International Publishing : $b Imprint: Springer,
300 $a x, 93 p. : $b ill., digital ; $c 24 cm.
490 1 $a SpringerBriefs in computer science, $x 2191-5768
505 0 $a 1 Motivation -- 2 Related Work -- 3 Introduction into MPC Protocols -- 4 A general framework to compile circuits for MPC -- 5 Compiling size-optimized circuits for MPC protocols with constant rounds -- 6 Compiling depth-optimized circuits for round-based MPC protocols -- 7 Compiling parallel circuits for MPC protocols -- 8 Appendix.
520 $a This book presents a holistic view on compiler assisted practical secure multi-party computation (MPC) over Boolean circuits. It discusses that two or more parties jointly evaluate a function over their inputs in such a way that each party keeps its input unknown to the other parties in MPC. MPC provides a generic way to construct Privacy-Enhancing Technologies, which protect sensitive data during processing steps in untrusted environments. A major obstacle in the past was to generate MPC applications by hand. Recently, special compilers have been developed to build all kinds of applications. This book also explains in detail how efficient MPC applications can be created automatically from ANSI-C, thus, bridging the areas of cryptography, compilation and hardware synthesis. It also gives an insight into the requirements for creating efficient applications for MPC and is hence of interest to not only researchers in the area of MPC but also developers realizing practical applications with MPC. For a better understanding of the complete compile chain from ANSI-C to circuits, which is the 'machine code' of MPC, the authors first give the necessary background information on MPC protocols, Boolean logic, and logic synthesis. Then the authors describe the various compilation steps required to translate any code into an adequate circuit description. Afterwards, the authors introduce a variety of optimization techniques for two classes of MPC protocols, namely techniques that improve the runtime of applications in constant- and multi-round MPC protocols. The authors also illustrate how efficient parallelization of MPC protocols can be achieved using the assistance of compilers. It presents the effectiveness of the proposed techniques by giving a detailed evaluation on benchmarking applications. Most of the aforementioned techniques are implemented in our open source compiler that is accompanying this book and allows to study compilation for MPC in practice.Researchers who are interested in practical secure multi-party computation (MPC), and developers who are interested in realizing MPC applications in practice will find this book useful as a reference, as well as advanced-level students in computer science.
650 0 $a Data protection. $3 557764
650 0 $a Computer security. $3 557122
650 1 4 $a Computer Science. $3 593922
650 2 4 $a Systems and Data Security. $3 677062
650 2 4 $a Data Structures, Cryptology and Information Theory. $3 669665
650 2 4 $a Circuits and Systems. $3 670901
700 1 $a Katzenbeisser, Stefan. $3 641475
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer eBooks
830 0 $a SpringerBriefs in computer science. $3 883114
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-67522-0
950 $a Computer Science (Springer-11645)