Paper 2016/247

Public Verifiable Function Secret Sharing

Wang Qiang, Zhou Fucai, Chen Chunyu, 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 find an applicable approach to check the correctness of result returned by the untrusted server. To solve this issue, we firstly introduce a primitive called Public Verifiable Function Secret Sharing (PVFSS), and define three new important properties: public delegation, public verification and high efficiency. 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.

Metadata
Available format(s)
-- withdrawn --
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Keywords
PVFSShigh efficiencypublic delegationpublic verification
Contact author(s)
wangq3635 @ 126 com
History
2016-11-28: withdrawn
2016-03-06: received
See all versions
Short URL
https://ia.cr/2016/247
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.