En Zhang1,2, Xintao Duan1,2, Siuming Yiu3, Junbin Fang4, Zoe L. Jiang5,*, Tsz HonYuen6, Jie Peng1
CMC-Computers, Materials & Continua, Vol.56, No.3, pp. 401-414, 2018, DOI:10.3970/cmc.2018.03733
Abstract In the setting of (t, n) threshold secret sharing, at least t parties can reconstruct the secret, and fewer than t parties learn nothing about the secret. However, to achieve fairness, the existing secret sharing schemes either assume a trusted party exists or require running multi-round, which is not practical in a real application. In addition, the cost of verification grows dramatically with the number of participants and the communication complexity is O(t), if there is not a trusted combiner in the reconstruction phase. In this work, we propose a fair server-aided multi-secret sharing scheme for weak… More >
Login
Register
