Title: Publicly verifiable function secret sharing

Authors: Qiang Wang; Fucai Zhou; Su Peng; Jian Xu

Addresses: Software College, Northeastern University, No. 3-11, Wenhua Road, Heping District, Shenyang, China ' Software College, Northeastern University, No. 3-11, Wenhua Road, Heping District, Shenyang, China ' School of Computer Science and Engineering, Northeastern University, No. 3-11, Wenhua Road, Heping District, Shenyang, China ' Software College, Northeastern University, No. 3-11, Wenhua Road, Heping District, Shenyang, China

Abstract: Function secret sharing (FSS) allows a dealer to split a secret function into n sub-functions, described by n evaluation keys, such that only a combination of all of these keys could reconstruct the secret function. However, it is impossible to recover the secret correctly if there exist some sharers deviating from intended behaviours. To settle this problem, we propose a new primitive called publicly verifiable function secret sharing (PVFSS), in which any client could verify the validity of secret in constant time. Furthermore, we define three important properties: public delegation, public verification and high efficiency, which are an essential part of our scheme. Finally, we construct a PVFSS scheme for point function then we prove its security and make performance analysis in two major directions: key length and algorithm efficiency. The analysis validates that our proposed scheme is asymptotic to FSS. It would be applicable to cloud computing.

Keywords: computational science; cloud computing; high efficiency; public delegation; public verification.

DOI: 10.1504/IJCSE.2019.10018801

International Journal of Computational Science and Engineering, 2019 Vol.20 No.4, pp.526 - 535

Received: 18 Apr 2017
Accepted: 11 Oct 2017

Published online: 12 Jan 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article