Practitioners and researchers seeking a concise, accessible introduction to secure multi-party computation which quickly enables them to build practical systems or conduct further research will find this essential reading.

This book provides information on theoretically secure multiparty computation (MPC) and secret sharing, and the fascinating relationship between the two concepts.

Cryptography is a field that is constantly advancing, due to exponential growth in new technologies within the past few decades. Applying strategic algorithms to cryptic issues can help save time and energy in solving the expanding problems within this field. Algorithmic Strategies for Solving Complex Problems in Cryptography is an essential reference source that discusses the evolution and current trends in cryptology, and it offers new insight into how to use strategic algorithms to aid in solving intricate difficulties within this domain. Featuring relevant topics such as hash functions, homomorphic encryption schemes, two party computation, and integer factoring, this publication is ideal for academicians, graduate students, engineers, professionals, and researchers interested in expanding their knowledge of current trends and techniques within the cryptology field.

This book constitutes the refereed proceedings of the 32nd Annual International Cryptology Conference, CRYPTO 2012, held in Santa Barbara, CA, USA, in August 2012. The 48 revised full papers presented were carefully reviewed and selected from 225 submissions. The volume also contains the abstracts of two invited talks. The papers are organized in topical sections on symmetric cryptosystems, secure computation, attribute-based and functional encryption, proofs systems, protocols, hash functions, composable security, privacy, leakage and side-channels, signatures, implementation analysis, black-box separation, cryptanalysis, quantum cryptography, and key encapsulation and one-way functions.

Secure Multi-Party Computation MPC is one of the most powerful tools developed by modern cryptography it facilitates collaboration among mutually distrusting parties by implementing a virtual trusted party. Despite the remarkable potential of such a tool, and decades of active research in the theoretical cryptography community, it remains a relatively inaccessible and lesser-known concept outside of this field. Only a handful of resources are available to students and researchers wishing to learn more about MPC. The editors of this book have assembled a comprehensive body of basic and advanced material on MPC, authored by

In the setting of multiparty computation, sets of two or more parties with p- vate inputs wish to jointly compute some (predetermined) function of their inputs. The computation should be such that the outputs received by the parties are correctly distributed, and furthermore, that the privacy of each party’s input is preserved as much as possible, even in the presence of - versarial behavior. This encompasses any distributed computing task and includes computations as simple as coin-tossing and broadcast, and as c- plex as electronic voting, electronic auctions, electronic cash schemes and anonymous transactions. The feasibility (and infeasibility) of multiparty c- putation has been extensively studied, resulting in a rather comprehensive understanding of what can and cannot be securely computed, and under what assumptions. The theory of cryptography in general, and secure multiparty computation in particular, is rich and elegant. Indeed, the mere fact that it is possible to actually achieve the aforementioned task is both surprising and intriguing.

CCS '17: 2017 ACM SIGSAC Conference on Computer and Communications Security Oct 30, 2017-Nov 03, 2017 Dallas, USA. You can view more information about this proceeding and all of ACM�s other published conference proceedings from the ACM Digital Library: http://www.acm.org/dl.