Explore a cutting-edge cryptographic paper presented at Crypto 2017 that delves into the intricacies of private multiplication over finite fields. Learn about the groundbreaking research conducted by Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, and Damien Vergnaud in this 24-minute conference talk. Gain insights into advanced cryptographic techniques and their applications in secure computation. Discover how this work contributes to the field of cryptography and its potential impact on privacy-preserving technologies.
Overview
Syllabus
Private Multiplication over Finite Fields
Taught by
TheIACR
Related Courses
-
Robust Non Interactive Multiparty Computation Against Constant Size Collusion
-
Unconditional UC Secure Computation with Stronger Malicious PUFs
-
On the Exact Round Complexity of Secure Three Party Computation
-
Limits of Practical Sublinear Secure Computation
-
More Efficient Universal Circuit Constructions
-
Constrained PRFs for NC1 in Traditional Groups
