Table of Content

Open Access iconOpen Access

ARTICLE

Server-Aided Multi-Secret Sharing Scheme for Weak Computational Devices

En Zhang1,2, Xintao Duan1,2, Siuming Yiu3, Junbin Fang4, Zoe L. Jiang5,*, Tsz HonYuen6, Jie Peng1

College of Computer and Information Engineering, Henan Normal University, Xinxiang, 453007, China.
Lab of Intelligence Business & Internet of Things of Henan Province, Xinxiang, 453007, China.
Department of Computer Science, University of Hong Kong, Hong Kong, China.
Department of Optoelectronic Engineering, Jinan University, Guangzhou, 510632, China.
School of Computer Science and Technology, Harbin nstitute of Technology Shenzhen Graduate School, Shenzhen, 518055, China.
Huawei, Singapore.

* Corresponding Author: Zoe L. Jiang. Email: email.

Computers, Materials & Continua 2018, 56(3), 401-414. https://doi.org/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 malicious behavior of clients or server providers in the scheme can be verified, and the server provider learns nothing about the secret shadows and the secrets. Unlike other secret sharing schemes, our scheme does not require interaction among users and can work in asynchronous mode, which is suitable for mobile networks or cloud computing environments since weak computational mobile devices are not always online. Moreover, in the scheme, the secret shadow is reusable, and expensive computation such as reconstruction computation and homomorphic verification computation can be outsourced to the server provider, and the users only require a small amount of computation

Keywords


Cite This Article

APA Style
Zhang, E., Duan, X., Yiu, S., Fang, J., Jiang, Z.L. et al. (2018). Server-aided multi-secret sharing scheme for weak computational devices. Computers, Materials & Continua, 56(3), 401-414. https://doi.org/10.3970/cmc.2018.03733
Vancouver Style
Zhang E, Duan X, Yiu S, Fang J, Jiang ZL, HonYuen T, et al. Server-aided multi-secret sharing scheme for weak computational devices. Comput Mater Contin. 2018;56(3):401-414 https://doi.org/10.3970/cmc.2018.03733
IEEE Style
E. Zhang et al., "Server-Aided Multi-Secret Sharing Scheme for Weak Computational Devices," Comput. Mater. Contin., vol. 56, no. 3, pp. 401-414. 2018. https://doi.org/10.3970/cmc.2018.03733



cc Copyright © 2018 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2093

    View

  • 1088

    Download

  • 0

    Like

Related articles

Share Link