Engineering secure two-party computation protocols

Meer over het boek

Secure two-party computation, or secure function evaluation (SFE), allows two mutually mistrusting parties, the client and server, to compute an arbitrary function on their private inputs without revealing anything beyond the result. Initially deemed inefficient for practical privacy applications, advancements in computing speed, communication networks, algorithmic improvements, and optimizations have made SFE applicable in various scenarios. The author provides a comprehensive overview of modern techniques for designing and implementing secure computation and related protocols. Beginning with an introduction that contextualizes secure computation within other privacy-enhancing technologies like secure channels and trusted computing, the book delves into the fundamentals of efficient secure function evaluation, circuit optimizations, hardware-assisted garbled circuit protocols, and the modular design of effective SFE protocols. The author's research focuses on employing algorithm engineering methods to develop efficient secure protocols, balancing theory with practical application. This work is vital for researchers, students, and practitioners in applied cryptography and information security looking to create practical cryptographic protocols for real-world privacy-preserving applications.