Amortizing Secure Computation with Penalties

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.

CCS 2016 - Amortizing Secure Computation with Penalties