A Fair and Efficient Secret Sharing Scheme Based on Cloud Assisting
- 590 Downloads
In threshold secret sharing schemes, the secret s is divided into n shares by a dealer, such that learning t or more than t shares can reconstruct this secret, but knowing fewer than t shares cannot reveal any information about the secret s. In order to enhance the confidentiality of shares, reduce the participants’ computational costs, and guarantee the fairness of secret reconstruction, this paper proposes a fair and efficient secret sharing scheme based on cloud assisting. Specifically, we represent the computational process of Shamir’s scheme as a matrix operation and encrypt the shares by using a random one-dimensional matrix for guaranteeing the confidentially of shares. In addition, we employ cloud computation platform that assists to reduce the redundancy of reconstruction computation and participants’ computational costs. To ensure the fairness of secret reconstruction, our scheme enables participants to recover their secret without revealing their share to the other participants, and ensure that only when all participants are honest, they can reveal the correct secret. The performance analysis demonstrates that the proposed scheme achieves a stronger level of security and a lower computational cost. We also provide the experimental results and show that the proposed approach is feasible and efficient compared with related works.
KeywordsSecret sharing Fairness Unconditional security Matrix operations
- 2.Blakley, G.R., et al.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)Google Scholar
- 3.Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science (SFCS 1985), pp. 383–395. IEEE (1985)Google Scholar
- 10.Mahmood, Z.H., Ibrahem, M.K.: New fully homomorphic encryption scheme based on multistage partial homomorphic encryption applied in cloud computing. In: 2018 1st Annual International Conference on Information and Sciences (AiCIS), pp. 182–186. IEEE (2018)Google Scholar