Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

On the Feasibility of Consistent Computations

TheIACR via YouTube

Overview

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

Taught by

TheIACR

Reviews

Start your review of On the Feasibility of Consistent Computations

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.