TY - CHAP

T1 - Function secret sharing using fourier basis

AU - Ohsawa, Takuya

AU - Kurokawa, Naruhiro

AU - Koshiba, Takeshi

PY - 2018

Y1 - 2018

N2 - Function secret sharing (FSS) scheme, formally introduced by Boyle et al. at EUROCRYPT 2015, is a mechanism that calculates a function 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. We observe 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 n and give a new framework for FSS schemes based on this observation. Based on the new framework, we introduce a new FSS scheme using the Fourier basis. This method provides efficient computation for a different class of functions (e.g., hard-core predicates of one-way functions), which may be inefficient to compute if we use the standard basis such as point functions. Our FSS scheme based on the Fourier basis is quite simple due to the fact that the Fourier basis is closed under the multiplication, while the previous constructions have to incorporate some complex mechanisms to overcome the difficulty.

AB - Function secret sharing (FSS) scheme, formally introduced by Boyle et al. at EUROCRYPT 2015, is a mechanism that calculates a function 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. We observe 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 n and give a new framework for FSS schemes based on this observation. Based on the new framework, we introduce a new FSS scheme using the Fourier basis. This method provides efficient computation for a different class of functions (e.g., hard-core predicates of one-way functions), which may be inefficient to compute if we use the standard basis such as point functions. Our FSS scheme based on the Fourier basis is quite simple due to the fact that the Fourier basis is closed under the multiplication, while the previous constructions have to incorporate some complex mechanisms to overcome the difficulty.

KW - Akavia

KW - Fourier Basis

KW - Hard-core Predicate

KW - Point Function

KW - Succinct Description

UR - http://www.scopus.com/inward/record.url?scp=85054713252&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054713252&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-65521-5_78

DO - 10.1007/978-3-319-65521-5_78

M3 - Chapter

AN - SCOPUS:85054713252

T3 - Lecture Notes on Data Engineering and Communications Technologies

SP - 865

EP - 875

BT - Lecture Notes on Data Engineering and Communications Technologies

PB - Springer

ER -