PPT-Secure Computation

Author : test | Published Date : 2016-06-19

Lecture 2 Arpita Patra Vishwaroop of MPC Expanding the scope of MPC Dimension 1 Any polynomially computable function can be computed securely gtgt So far you have

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Secure Computation" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Secure Computation: Transcript

Lecture 2 Arpita Patra Vishwaroop of MPC Expanding the scope of MPC Dimension 1 Any polynomially computable function can be computed securely gtgt So far you have seen how to compute addition and bit multiplication securely. (. Lecture 3 & 4). Arpita. . Patra. Recap . >> Why secure computation?. >> What is secure (multi-party) computation (MPC)?. >> Secret Sharing and Secure sum protocol. >> OT and Secure multiplication protocol. 2.1TheArithmeticBlack-boxThearithmeticblack-boxallowsnparties,P1;:::;Pn,tosecurelystoreandretrieveelementsofaringZM.Here,MwillbeeitheraprimeoranRSA-modulus,i.e.theproductoftwooddprimes.Thesecurestorag Jae-. Deok. Lim*, . Joon-Suk. Yu*, . Jeong-Nyeo. Kim*. *Electronics and Telecommunications Research Institute(ETRI) , KOREA. Method of providing Secure Network Channel among Secure OSs. Prepared By:. Professor, Computer Science, UMD. Director, Maryland Cybersecurity Center. . Secure . Computation. Mathematics. Complexity . theory. C. ryptography. Cybersecurity. Science of . Cybersecurity. C. ryptography. 1. Query Optimization in Cooperation with an Ontological Reasoning Service. Hui. Shi, Kurt Maly, and Steven Zeil. Contact. : maly@cs.odu.edu. 2. Outline. Problem. What are we reasoning about?. What are the challenges?. Secure . Computation. Chongwon Cho. . (HRL Laboratories). Sanjam. . Garg. (IBM T.J. Watson). . Rafail. . Ostrovsky. (UCLA). 2. Secure . Computation [Yao, GMW]. Alice and Bob. Alice holds input . 1. Topics ahead. Computation in general. Hilbert’s Program: Is mathematics. c. omplete,. c. onsistent and. decidable? (. Entscheidungsproblem. ). Answers. Goedel’s. theorem. Turing’s machine. Chapter 4: Computation. 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. Adrian Farrel. Old Dog Consulting. adrian@olddog.co.uk. History of PCE. We know where PCE comes from. Simple CSPF computation of paths for MPLS-TE. But RFC 4655 was not quite so limited in its definition. 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. 1. Computation. In general, a . partial function. f on a set S. m. is a function whose domain is a subset of S. m. .. If a partial function on S. m. has the domain S. m. , then it is called . total. Active contributions to computation. Dendrites as computational elements:. Examples. Dendritic. computation. r. V. m. = . I. m. . R. m. Current flows uniformly out through the cell: . I. m. = . I. K. p. ).. Computation of Potential and Actual Evapotranspiration (ET) status by using pan evaporation data and . K. p. value.. Arpita. . Patra. Recap . >Three orthogonal problems- (. n,t. )-sharing, reconstruction, multiplication protocol. > Verifiable Secret Sharing (VSS) will take care first two problems. >> .

Download Document

Here is the link to download the presentation.
"Secure Computation"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.