Yanyan Han^1,2, Jiangping Yu³, Guangyu Hu⁴, Chenglei Pan⁴, Dingbang Xie⁵, Chao Guo^1,2,6,*, Abdul Waheed⁷

CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4789-4802, 2022, DOI:10.32604/cmc.2022.027496

Abstract Verifiable secret sharing mainly solves the cheating behavior between malicious participants and the ground control center in the satellite network. The verification stage can verify the effectiveness of secret shares issued by the ground control center to each participant and verify the effectiveness of secret shares shown by participants. We use a lot of difficult assumptions based on mathematical problems in the verification stage, such as solving the difficult problem of the discrete logarithm, large integer prime factorization, and so on. Compared with other verifiable secret sharing schemes designed for difficult problems under the same security, the verifiable secret sharing… More >

En Zhang^1,2, Xintao Duan^1,2, Siuming Yiu³, Junbin Fang⁴, Zoe L. Jiang^5,*, Tsz HonYuen⁶, Jie Peng¹

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 computational devices. The… More >