PPT-Garbled RAM, Revisited

Daniel Wichs Northeastern University Joint work with Craig Gentry Shai Halevi Seteve Lu Rafail Ostrovsky Mariana Raykova Goals of Garbled RAM An analogue of Yao garbled circuits. OT `i;1 `i;0 f`i;x2igi2[n]=[n1]8i2[n]=[n1]!Figure1:MessagesinYao'sGarbeledCircuit17-2 EvaluationWithanencryptedgateg,inputkeysSw1Sw2fortheinputwires,andfourrandomlypermutedencryptionsoftheoutp Private RAM Computation. Daniel . Wichs. Northeastern University. with: Craig Gentry, . Shai. . Halevi. , Mariana . Raykova. Problem Overview. Weak client wants to leverage resources of a powerful server to compute . Garbling Circuits. Based on joint works with. Yuval . Ishai. . Eyal. . Kushilevitz. Brent Waters. University of Texas. Technion. Technion. . Benny . Applebaum. Tel Aviv University. Garbled Circuit. Lecture 13-14. Arpita. . Patra. Recap . >> Improving the complexity of GMW . > Step I: Offline: O(n. 2 . c. AND. ) OTs; Online: . i.t. ., no crypto. # Preprocessing of OT (on random inputs). from . A Fixed-key Blockcipher. Applied MPC workshop. February 20, 2014. Mihir Bellare. UC San Diego. Viet Tung Hoang. UC San Diego. Phillip Rogaway. UC Davis. Sriram Keelveedhi. UC San Diego. Garbled circuit. Nathaniel Husted, Steve Myers, . abhi. . shelat. , . Paul . Grubbs. Alice . and Bob want to compute a public function of their private inputs.. Secure Two-party Computation. Disease Database. Alice. Zero-knowledge. Claudio . Orlandi – . Aarhus. University. In this talk: 3 simple ideas from. Jawurek. , . Kerschbaum. , Orlandi. Zero-Knowledge from Garbled Circuits, CCS 2013. Frederiksen. , Nielsen, Orlandi. Secure Multi-Party Computation. Debayan Gupta. Yale University. May 11, 2016. Jai . Dadabhai. The Apparent Paradox of . Modern Cryptography. Intuitive ideas of secrecy. Encrypted data are safe; but they appear to be unusable. Garbling Circuits. Based on joint works with. Yuval . Ishai. . Eyal. . Kushilevitz. Brent Waters. University of Texas. Technion. Technion. . Benny . Applebaum. Tel Aviv University. Garbled Circuit Construction. Daniel . Wichs. Northeastern University. with: Craig Gentry, . Shai. . Halevi. , Mariana . Raykova. Problem Overview. Weak client wants to leverage resources of a powerful server to compute . without revealing . A Fixed-key Blockcipher. Applied MPC workshop. February 20, 2014. Mihir Bellare. UC San Diego. Viet Tung Hoang. UC San Diego. Phillip Rogaway. UC Davis. Sriram Keelveedhi. UC San Diego. Garbled circuit. Secure . Computation. David Evans. University of Virginia. http://www.cs.virginia.edu/evans. http://www.MightBeEvil.com. DHOSA MURI . PIs Meeting. Berkeley, CA. 28 April 2011. transformation. HARDWARE. Oblivious Transfer (OT). A Simple AND Garbled Circuit. Free XOR / NOT Garbled Circuits. Garbled Circuits’ Basic Cost. Oblivious Transfer (OT). 1 out of 2 or 1 out of N. Alice transfers to Bob . 2. or . An Efficient and Scalable Protocol. ECE 693 Big Data Security. Abstract. Large scale . data processing brings new challenges to the design of privacy-preserving protocols: how to meet the increasing requirements of speed and throughput of modern...