New Instantiations of the CRYPTO 2017 Masking Schemes
Pierre Karpman, Daniel S. Roche

TL;DR
This paper extends the practical applicability of CRYPTO 2017 masking schemes by finding new safe instantiations for higher share counts using algebraic, heuristic, and experimental methods, enabling more secure implementations.
Contribution
It introduces methods to find safe matrix instantiations for Bela"id et al's algorithms up to higher orders, improving their practical usability.
Findings
Explicit instantiations up to d=6 over large fields
Instantiations up to d=4 over _{2^8}
Enhanced practical security of masking schemes
Abstract
At CRYPTO 2017, Bela\"id et al presented two new private multiplication algorithms over finite fields, to be used in secure masking schemes. To date, these algorithms have the lowest known complexity in terms of bilinear multiplication and random masks respectively, both being linear in the number of shares . Yet, a practical drawback of both algorithms is that their safe instantiation relies on finding matrices satisfying certain conditions. In their work, Bela\"id et al only address these up to and 3 for the first and second algorithm respectively, limiting so far the practical usefulness of their schemes. In this paper, we use in turn an algebraic, heuristic, and experimental approach to find many more safe instances of Bela\"id et al's algorithms. This results in explicit such instantiations up to order over large fields, and up to over practically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
