TY - GEN
T1 - Secure multi-party computation
T2 - 16th International Conference on Cryptology in India, INDOCRYPT 2015
AU - Prabhakaran, Manoj M.
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Secure Multi-Party Computation (MPC) is a central problem in modern cryptography, that allows mutually distrusting parties to collaborate with each other on computational tasks, without compromising their private data (beyond what the output of the computation reveals). In this tutorial we shall cover some of the basic concepts behind MPC, informed by recent developments in the field. The first half of the tutorial will introduce the concept of MPC and briefly present some of the classic constructions, including Yao’s Garbled Circuits, the GMW protocol and the BGW protocol. We shall then see some blackbox transformations that can be applied to simpler protocols, to achieve higher security or efficiency goals. The second half of the tutorial will deal with fundamental issues in the theory of MPC. These include definitions of security, classification of MPC tasks according to their cryptographic complexity (including characterization of tasks as possible or impossible to carry out), and questions regarding the communication complexity of MPC.
AB - Secure Multi-Party Computation (MPC) is a central problem in modern cryptography, that allows mutually distrusting parties to collaborate with each other on computational tasks, without compromising their private data (beyond what the output of the computation reveals). In this tutorial we shall cover some of the basic concepts behind MPC, informed by recent developments in the field. The first half of the tutorial will introduce the concept of MPC and briefly present some of the classic constructions, including Yao’s Garbled Circuits, the GMW protocol and the BGW protocol. We shall then see some blackbox transformations that can be applied to simpler protocols, to achieve higher security or efficiency goals. The second half of the tutorial will deal with fundamental issues in the theory of MPC. These include definitions of security, classification of MPC tasks according to their cryptographic complexity (including characterization of tasks as possible or impossible to carry out), and questions regarding the communication complexity of MPC.
UR - http://www.scopus.com/inward/record.url?scp=84951873933&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84951873933&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84951873933
SN - 9783319266169
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
BT - Progress in Cryptology – INDOCRYPT 2015 - 16th International Conference on Cryptology in India, Proceedings
A2 - Biryukov, Alex
A2 - Goyal, Vipul
PB - Springer
Y2 - 6 December 2015 through 9 December 2015
ER -