Function secret sharing using fourier basis

Takuya Ohsawa, Naruhiro Kurokawa, Takeshi Koshiba

研究成果: Chapter

2 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルLecture Notes on Data Engineering and Communications Technologies
出版社Springer
ページ865-875
ページ数11
DOI
出版ステータスPublished - 2018

出版物シリーズ

名前Lecture Notes on Data Engineering and Communications Technologies
7
ISSN(印刷版)2367-4512
ISSN(電子版)2367-4520

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Networks and Communications
  • Information Systems

フィンガープリント 「Function secret sharing using fourier basis」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル