Fourier-based function secret sharing with general access structure

研究成果: Chapter

1 被引用数 (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.

本文言語English
ホスト出版物のタイトルSpringer Proceedings in Mathematics and Statistics
出版社Springer New York LLC
ページ417-428
ページ数12
DOI
出版ステータスPublished - 2018

出版物シリーズ

名前Springer Proceedings in Mathematics and Statistics
253
ISSN(印刷版)2194-1009
ISSN(電子版)2194-1017

ASJC Scopus subject areas

  • Mathematics(all)

フィンガープリント 「Fourier-based function secret sharing with general access structure」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル