Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead

Explore a 25-minute conference talk presented at Asiacrypt 2017 that delves into the paper "Maliciously Secure Oblivious Linear Function Evaluation with Constant Overhead" by Satrajit Ghosh, Jesper Buus Nielsen, and Tobias Nilges. Gain insights into advanced cryptographic concepts and learn about the authors' approach to achieving malicious security in oblivious linear function evaluation while maintaining constant overhead. Discover the implications of this research for secure multiparty computation and its potential applications in privacy-preserving technologies.