On the Feasibility of Consistent Computations

Explore a talk from PKC 2010 on the feasibility of consistent computations, presented by authors Sven Laur and Helger Lipmaa. Delve into topics such as privacy, two-party security models, complaint handling, and client disclosure of secrets. Learn about the motivations behind consistent computations, their construction, communication aspects, and security implications. Examine the simulation process and discover how to make computations consistent. Conclude with a summary and engage in a question-and-answer session to deepen your understanding of this cryptographic concept.

Syllabus

Introduction
Motivation
Privacy
Twoparty security model
Complaint handling
Motivations
Construction
Communication
Security
Simulation
Client
Disclosure of Secrets
Making it Consistent
Summary
Questions