Obfuscation with Constant Multiplicative Size Overhead

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=NTQtwl_Hq3U


Duration: 32:42
350 views
4

Prabhanjan Ananth, UCLA
Securing Computation
http://simons.berkeley.edu/talks/prabhanjan-anath-06-08



Other Videos By Simons Institute for the Theory of Computing


2015-07-06The Oracle's Secrets
2015-06-23Quantum and Post-Quantum Cryptography
2015-06-15Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
2015-06-15Provably Secure Virus Detection: Using the Uncertainty to End Computer Malware
2015-06-15Oblivious RAM for MPC
2015-06-15On the Cryptographic Hardness of Finding a Nash Equilibrium
2015-06-15How Fair is your Protocol? A Utility-Based Approach to Protocol Optimality
2015-06-15New Advances in Secure RAM Computation
2015-06-15Efficient Multiparty Protocols via Log-Depth Threshold Formulae
2015-06-15Two Round MPC via Multi-Key FHE
2015-06-15Obfuscation with Constant Multiplicative Size Overhead
2015-06-15Obfuscation of Probabilistic Circuits and Applications
2015-06-15Fast Garbling of Circuits Under Standard Assumptions
2015-06-15Practical Private DB Querying
2015-06-15Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
2015-06-15Rethinking Secure Computation - A Greedy Approach
2015-06-15The Simplest Oblivious Transfer Protocol
2015-06-15A Wishlist for Verifiable Computation: An Applied CS Perspective
2015-06-15The Whole is Greater than the Sum of its Parts: Linear Garbling and Applications
2015-06-15A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
2015-06-15Public-Coin Differing-Inputs Obfuscation and its Applications


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Prabhanjan Ananth