PDF-Secure Multiparty Computation and Secret Sharing

Its no secret that this world we live in can be pretty stressful sometimes If you find yourself feeling outofsorts pick up a bookAccording to a recent study reading can significantly reduce stress levels In as little as six minutes you can reduce your stress levels by 68. Minimal Interaction, Revisited . Yuval . Ishai. (. Technion. ). . Ranjit . Kumaresan. (MIT). Eyal. . Kushilevitz. . (. Technion. ). Anat. . Paskin-Cherniavsky. (Ariel). Secure Multiparty Computation. problems and directions. Piotr. . Mardziel. , Adam Bender, . Michael Hicks. , . Dave Levin, . Mudhakar. . Srivatsa. *, Jonathan Katz. * IBM Research, T.J. Watson Lab, USA. University of Maryland, College Park, USA. for Cloud Computing and Beyond. . Shlomi. . Dolev. Joint works with . Limor. . Lahiani. , . Moti. Yung, Juan . Garay. , . Niv. . Gilboa. and Vladimir . Kolesnikov. . Secret Swarm Unit . Reactive K-Secret Sharing. (Lecture 1). Arpita. . Patra. Welcome to an exciting Journey .  . >> . Course Homepage. : . http://. drona.csa.iisc.ernet.in. /~. arpita. /SecureComputation15. .html . >> References:. Nisarg Raval. Sep 24, 2014. http://www.cs.cornell.edu/courses/cs513/2000sp/SecretSharing.html. Material is adapted from CS513 lecture notes (Cornell). CPS 290 - Computer Security. Why share a secret?. Illinois Institute of . Technology. Nexus of Information and Computation Theories. Paris, Feb 2016. Salim. El . Rouayheb. . “How to Share a Secret?”. (. n,k. )=(4,2) threshold secret sharing . Nisarg Raval. Sep 24, 2014. http://www.cs.cornell.edu/courses/cs513/2000sp/SecretSharing.html. Material is adapted from CS513 lecture notes (Cornell). Why share a secret?. http://s3.amazonaws.com/rapgenius/1604757_1306648362304.08res_250_319.jpg. Ranjit . Kumaresan. (MIT). Based on joint works with . Iddo. . Bentov. (. Technion. ), Tal Moran (IDC), Guy . Zyskind. (MIT). x. f. . (. x,y. ). y. f. . (. x,y. ). Secure Computation. Most general problem in cryptography. Re-Visited. CRYPTO 2009. Arpita Patra (IIT Madras. ). Ashish Choudhary (IIT Madras). Tal Rabin (IBM Research). C. Pandu Rangan (IIT Madras). Verifiable Secret Sharing (VSS). Fundamental building block in secure distributed computing. Tore Frederiksen. , . Thomas . Jakobsen. , . Jesper. Nielsen, Peter . Nordholt. , Claudio . Orlandi. 27-08-2016. The LEGO Approach for. Maliciously Secure Two-Party Computation. 1. What we will present. Payman. . Mohassel. Yahoo Labs. 1. Do We Have the Same Person. in Mind?. Alice. Bob. Jack. . Joe. o. nly reveal . Yes/No. Solutions?. You have access to a trusted computer. You can use an airline reservation service. Chongwon Cho. . (HRL Laboratories). Sanjam. . Garg. (IBM T.J. Watson). . Rafail. . Ostrovsky. (UCLA). 2. Secure . Computation [Yao, GMW]. Alice and Bob. Alice holds input . x. .. Bob holds input . Arpita. . Patra. Recap . >> Scope of MPC . . . . > models of computation . . > network models . . > . modelling. distrust (centralized/decentralized adversary). Arpita. . Patra. Recap . >Three orthogonal problems- (. n,t. )-sharing, reconstruction, multiplication protocol. > Verifiable Secret Sharing (VSS) will take care first two problems. >> .