Fourier-based Function Secret Sharing with General Access Structure

2017/12/03 by Koshiba, Takeshi
#Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1712.00735

Abstract

Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in 0,1ⁿ which is shared among p parties, by using distributed functions f_i:0,1ⁿ -> G, where G is an Abelian group, while the function f:0,1ⁿ -> G is kept secret to the parties. Ohsawa et al. in 2017 observed that any function f can be described as a linear combination of the basis functions by regarding the function space as a vector space of dimension 2ⁿ and gave new FSS schemes based on the Fourier basis. All existing FSS schemes are of (p,p)-threshold type. That is, to compute f(x), we have to collect f_i(x) for all the distributed functions. In this paper, as in the secret sharing schemes, we consider FSS schemes with any general access structure. To do this, we observe that Fourier-based FSS schemes by Ohsawa et al. are compatible with linear secret sharing scheme. By incorporating the techniques of linear secret sharing with any general access structure into the Fourier-based FSS schemes, we show Fourier-based FSS schemes with any general access structure.

Related

• On Mignotte Secret Sharing Schemes over Gaussian Integers
• Finding Significant Fourier Coefficients: Clarifications, Simplifications, Applications and Limitations
• Secret sharing schemes based on additive codes over GF(4)
• A Secret Sharing Scheme Based on Group Presentations and the Word Problem
• MDS Ideal Secret Sharing Scheme from AG-codes on Elliptic Curves