Cryptology ePrint Archive: Report 2016/247

Public Veri able Function Secret Sharing

Wang Qiang and Zhou Fucai and Chen Chunyu and Li Fuxiang and Xu Zifeng

Abstract: Function secret sharing(FSS) was introduced by Boyle et al. in Eurocrypt 2015, which allowed a dealer to split a secret function f into n separate pieces such that each piece enables the server who owns it to generate a secret share of the evaluation of f(x). However, when just only one collusive server returns a wrong result, reconstructing the secret will fail. Therefore, we are required to nd an applicable approach to check the correctness of result returned by the untrusted server. To solve this issue, we rstly introduce a primitive called Public Veri able Function Secret Sharing (PVFSS), and de ne three new important properties: public delegation, public veri cation and high eciency. Then we ini- tiate a systematic study of PVFSS and construct a PVFSS scheme for point function. Not only captures our scheme these three properties, but also allows the client to verify the outcome in time constant i.e., in indeed substantially less time than performing the computation locally. We conducted a performance analysis, which manifested that our scheme can be applied into practice such as cloud/outsource computing.

Category / Keywords: cryptographic protocols / PVFSS, high eciency, public delegation, public veri fication

Date: received 5 Mar 2016, withdrawn 27 Nov 2016

Contact author: wangq3635 at 126 com

Available format(s): (-- withdrawn --)

Version: 20161128:032927 (All versions of this report)

Short URL: ia.cr/2016/247

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]