The Whole is Greater than the Sum of its Parts: Linear Garbling and Applications

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


Duration: 24:46
649 views
2

Valerio Pastro, Columbia University
Securing Computation
http://simons.berkeley.edu/talks/tal-malkin-2015-06-10



Other Videos By Simons Institute for the Theory of Computing


2015-06-15How to use Bitcoin to Enhance Secure Computation
2015-06-15Obfuscation with Constant Multiplicative Size Overhead
2015-06-15Upending Stock Market Structure Using Secure Computation
2015-06-15Lower Bounds for Information-Theoretic MPC
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-15The Whole is Greater than the Sum of its Parts: Linear Garbling and Applications
2015-06-15Provably Secure Blockchain Protocols and Applications to Secure Computation
2015-06-15Sequential Composition of Rational Proofs
2015-06-15How to Construct Indistinguishability Obfuscation from Compact Functional Encryption
2015-06-15Cryptocurrencies and Smart Contracts
2015-06-15A Brief History of Practical Garbled Circuit Optimizations
2015-06-15SNARKs and their Practical Applications
2015-06-15Contention in Cryptography: Obfuscation, Leakage, UCE and the AI-DHI Assumptions
2015-06-15Obfuscation: Past, Present, and Possible Futures
2015-06-15New Developments in Multilinear Maps: Zeroizing Attacks, Defenses, and Post-Zeroizing Obfuscation
2015-06-04On the Growth of Cryptography


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Valerio Pastro