Amortizing Secure Computation with Penalties
Offered By: Association for Computing Machinery (ACM) via YouTube
Course Description
Overview
Explore a conference talk presented at the 23rd ACM Conference on Computer and Communications Security (CCS 2016) that delves into the concept of amortizing secure computation with penalties. Learn from authors Ranjit Kumaresan (MIT) and Iddo Bentov (Cornell) as they discuss their research findings in this 31-minute presentation. Gain insights into advanced cryptographic techniques and their applications in secure multi-party computation, with a focus on improving efficiency through amortization and the use of penalty mechanisms. Understand how these concepts can enhance the security and practicality of distributed systems and blockchain technologies.
Syllabus
CCS 2016 - Amortizing Secure Computation with Penalties
Taught by
ACM CCS
Related Courses
Peeling the Onion's User Experience Layer - Examining Naturalistic Use of the Tor BrowserAssociation for Computing Machinery (ACM) via YouTube DeepCorr - Strong Flow Correlation Attacks on Tor Using Deep Learning
Association for Computing Machinery (ACM) via YouTube SandScout - Automatic Detection of Flaws in iOS Sandbox Profiles
Association for Computing Machinery (ACM) via YouTube Game of Decoys - Optimal Decoy Routing Through Game Theory
Association for Computing Machinery (ACM) via YouTube PREDATOR - Proactive Recognition and Elimination of Domain Abuse at Time-Of-Registration
Association for Computing Machinery (ACM) via YouTube