The Simplest Oblivious Transfer Protocol

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


Duration: 16:59
9,250 views
58

Claudio Orlandi, Aarhus University
Securing Computation
http://simons.berkeley.edu/talks/claudio-orlandi-2015-06-10



Other Videos By Simons Institute for the Theory of Computing


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-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-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
2015-06-15Capacity Inversion and MPC over Elastic Noisy Channels
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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Claudio Orlandi