PPT-Lower Bounds on Assumptions behind Indistinguishability Obfuscation

Author : briana-ranney | Published Date : 2018-10-30

Mohammad Mahmoody University of Virginia Ameer Mohammed University of Virginia Soheil Nematihaji University of Virginia a bhi shelat University of Virginia Rafael

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Lower Bounds on Assumptions behind Indis..." 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.

Lower Bounds on Assumptions behind Indistinguishability Obfuscation: Transcript

Mohammad Mahmoody University of Virginia Ameer Mohammed University of Virginia Soheil Nematihaji University of Virginia a bhi shelat University of Virginia Rafael Pass Cornell University. Shubhangi. . Saraf. Rutgers University. Based on joint works with . Albert Ai, . Zeev. . Dvir. , . Avi. . Wigderson. Sylvester-. Gallai. Theorem (1893). v. v. v. v. Suppose that every line through . Evasive Functions. Boaz . Barak, . Nir. . Bitansky. , Ran Canetti,. Yael Tauman . Kalai, . Omer . Paneth, . Amit Sahai. Program Obfuscation . Obfuscated Program. Approved . Document . Signature . Obfuscation. Boaz . Barak . Sanjam. . Garg. Yael . Tauman . Kalai . Omer Paneth . Amit . Sahai. Program Obfuscation . Public Key. . . Obfuscation. . . . Virtual Black-Box (VBB). [. Barak-. Goldreich. -. 3-Round . Zero-Knowledge. Nir Bitansky and Omer Paneth. Interactive Proofs. An interactive proof . :. . . . . Interactive Proofs. Negligible. soundness error. . . . Prover’s security . Nir. . Bitansky. and Omer . Paneth. Program Obfuscation. Compute . . . . Program Obfuscation. . . Program Obfuscation. Sign email . with . If . starts with “omer@bu.edu”. . . . Shubhangi. . Saraf. Rutgers University. Based on joint works with . Albert Ai, . Zeev. . Dvir. , . Avi. . Wigderson. Sylvester-. Gallai. Theorem (1893). v. v. v. v. Suppose that every line through . unseen problems. David . Corne. , Alan Reynolds. My wonderful new algorithm, . Bee-inspired Orthogonal Local Linear Optimal . Covariance . K. inetics . Solver. Beats CMA-ES on 7 out of 10 test problems !!. Shai Halevi. Obfuscation. China Summer School on Lattices and Cryptography, June 2014. Code Obfuscation. Encrypting programs, maintaining functionality. Only the functionality should be “visible” in the output. Program . Obfuscation. Omer Singer. June 8, 2009. Practical Background. What is program obfuscation?. Obfuscation is deliberately making software code so confusing that even those with access to the code can’t figure out what a program is going to do.. for Cryptographic. . Agents. Shashank Agrawal, . Manoj. . Prabhakaran. , . Ching-Hua Yu. Security Guarantee in Cryptography. A cryptographic scheme can provide certain security properties. Modern cryptography have involved properties. Goyal. . Venkata. . Koppula. Brent Waters. Lockable Obfuscation. . . Correctness: . Challenger. Attacker. Lockable . Obfuscation: Security. OR. Guess. could . be from . high . entropy . dist. . Sanjam. . Garg. , Craig Gentry*, . Shai Halevi*. ,. Mariana . Raykova. , . Amit. . Sahai. , Brent Waters. Faces in Modern Cryptography, Oct-2013. A Celebration in Honor of . . Goldwasser. . and . Searching. : Given a large set of distinct keys, preprocess them so searches can be performed as quickly as possible. 1. CS 840 Unit 1: Models, Lower Bounds and getting around Lower bounds. Searching. dynamic data structures. Shachar. Lovett. IAS. Ely . Porat. Bar-. Ilan. University. Synergies in lower bounds, June 2011. Information theoretic lower bounds. Information theory. is a powerful tool to prove lower bounds, e.g. in data structures.

Download Document

Here is the link to download the presentation.
"Lower Bounds on Assumptions behind Indistinguishability Obfuscation"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.