Fourier-based function secret sharing with general access structure

Takeshi Koshiba*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)


Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for f(x) for x ∈ {0,1}n which is shared among p parties, by using distributed functions fi:{0,1}n→G(1≤i≤p), where G is an Abelian group, while the function f:{0,1}n→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 2n 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 fi(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 propose Fourier-based FSS schemes with any general access structure.

Original languageEnglish
Title of host publicationSpringer Proceedings in Mathematics and Statistics
PublisherSpringer New York LLC
Number of pages12
Publication statusPublished - 2018
Externally publishedYes

Publication series

NameSpringer Proceedings in Mathematics and Statistics
ISSN (Print)2194-1009
ISSN (Electronic)2194-1017


  • Access structure
  • Distributed computation
  • Fourier basis
  • Function secret sharing
  • Linear secret sharing
  • Monotone span program

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'Fourier-based function secret sharing with general access structure'. Together they form a unique fingerprint.

Cite this