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

Swayam

Secure Computation: Part I

Indian Institute of Technology Bangalore and NPTEL via Swayam

Overview

This course will discuss about how using various cryptographic primitives, one can do computation on distributed and sensitive data, also known as secure multi-party computation (MPC), which arguably is one of the most fundamental problems in cryptography as well as distributed computing.The need for distributed computation on private data arises in several real-world applications that require computations involving sensitive data from two or more mutually distrusting entities. Consider the following example, which is one of the latest applications of secure computation: The Earth is orbited by thousands of man-made satellites and several thousands of orbital debris. The growing number of satellites and space debris orbiting the planet increases the danger of collisions. And this is not a hypothetical scenario, as several such “high-profile” collisions have been reported in the recent past. Given the expensive cost of satellites, the host countries would like to avoid collision. A collision can only be predicted if the detailed orbit information of the individual satellites is known. However, such information can be highly sensitive and in fact, it can even be a national secret. So, what is needed here is a way to determine whether two satellites are about to clash with each other based on the detailed locations of the satellites, but without the need of disclosing the locations of the satellites to other host countries.Secure MPC models the above and several such applications that make simultaneous demands for the privacy and usability of sensitive data. Other examples include secure e-voting, secure e-auction, secure signal-processing, secure bioinformatics, secure biometrics, secure machine-learning, secure outsourcing, privacy-preserving data mining, to name a few.INTENDED AUDIENCE : The course is intended for any student from the computer science and Mathematics disciplinePREREQUISITES : The participant should have done a basic course on Cryptography (such as the Foundations of Cryptography course available on NPTEL) and a basic course on Discrete Mathematics

Syllabus

Week 1: Secure Computation: motivation and real-world examples, various dimensions, recalling relevant topics from abstract algebra (groups, rings, fields) and cryptography Week 2: Secret sharing (motivation, definition and applications), Shamir secret-sharing, additive secret-sharing, replicated secret-sharing Week 3: Linear secret-sharing, monotone span programs (MSP), secure message transmission (SMT) Week 4: BenOr-Goldwasser-Wigderson (BGW) protocol: security proof and detailed analysis Week 5: Degree-Reduction problem and various solutions, efficient protocols for evaluating multiplication gates Week 6: Oblivious transfer (OT), OT protocols, OT extension Week 7: Goldreich-Micali-Wigderson (GMW) protocol: security proof and detailed analysis Week 8: Yao’s protocol for secure 2-party computation, various optimizations of Yao’s protocol Week 9: MPC for small number of parties, various optimizations Week 10: Mixed world MPC protocols Week 11: MPC protocols against general adversaries Week 12: Fail-stop corruptions: MPC and consensus protocols, asynchronous protocols

Taught by

Prof. Ashish Choudhury

Related Courses

Reviews

Start your review of Secure Computation: Part I

Never Stop Learning!

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

Sign up for free