Explore a coding-theoretic approach to blackbox secret sharing in this 27-minute conference talk presented at Eurocrypt 2020. Delve into the research findings of Ronald Cramer and Chaoping Xing as they revisit and analyze blackbox secret sharing schemes. Gain insights into their novel application of coding theory to address expansionless near-threshold schemes. Understand the implications of their work for cryptographic protocols and secure multiparty computation.
Blackbox Secret Sharing Revisited - A Coding-Theoretic Approach with Application to Expansionless
Overview
Syllabus
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionles...
Taught by
TheIACR
Related Courses
-
Secret Sharing - Continued
-
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing
-
On the Local Leakage Resilience of Linear Secret Sharing Schemes
-
Non Malleable Secret Sharing for General Access Structures
-
Evolving Ramp Secret Sharing with a Small Gap
-
Essentially Optimal Robust Secret Sharing with Maximal Corruptions
