x
Menu

Secure Computation: Part I

IISc Bangalore, , Prof. Ashish Choudhury

Updated On 02 Feb, 19

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.

Includes

Lecture 39: Lec 38 RSA Assumption and RSA Hard-Core Predicate

4.1 ( 11 )


Lecture Details

RSA assumption, Hard-core predicate for the RSA function

Ratings

0


0 Ratings
55%
30%
10%
3%
2%
Comments
comment person image

Sam

Excellent course helped me understand topic that i couldn't while attendinfg my college.

Reply
comment person image

Dembe

Great course. Thank you very much.

Reply
Send