Welcome to the resource topic for 2020/570
Title:
On Optimality of d + 1 TI Shared Functions of 8 Bits or Less
Authors: Dušan Božilov
Abstract:We present a methodology for finding minimal number of output shares in d + 1 TI by modeling the sharing as set covering problem and using different discrete optimization techniques to find solutions. We demonstrate the results of our technique by providing optimal or near-optimal sharings of several classes of Boolean functions of any degree up to 8 variables, for first and second order TI. These solutions present new lower bounds for the total number of shares for these types of functions
ePrint: https://eprint.iacr.org/2020/570
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .