A Fair and Efficient Secret Sharing Scheme Based on Cloud Assisting

  • Mingwu ZhangEmail author
  • Xiao Chen
  • Gang Shen
  • Yong Ding
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11806)


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.


Secret sharing Fairness Unconditional security Matrix operations 


  1. 1.
    Araki, T.: Efficient \((k, n)\) threshold secret sharing schemes secure against cheating from \(n-1\) cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133–142. Springer, Heidelberg (2007). Scholar
  2. 2.
    Blakley, G.R., et al.: Safeguarding cryptographic keys. In: AFIPS Conference Proceedings, vol. 48, pp. 313–317 (1979)Google Scholar
  3. 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
  4. 4.
    Harn, L., Lin, C.: Strong (n, t, n) verifiable secret sharing scheme. Inf. Sci. 180(16), 3059–3064 (2010)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Harn, L.: Efficient sharing (broadcasting) of multiple secrets. IEE Proc. - Comput. Digit. Tech. 142, 237–240 (1995)CrossRefGoogle Scholar
  6. 6.
    Kumar, K., Lu, Y.-H.: Cloud computing for mobile users: can offloading computation save energy? Computer 4, 51–56 (2010)CrossRefGoogle Scholar
  7. 7.
    Li, Y., Yu, Y., Min, G., Susilo, W., Ni, J., Choo, K.R.: Fuzzy identity-based data integrity auditing for reliable cloud storage systems. IEEE Trans. Dependable Secure Comput. 16(1), 72–83 (2019)CrossRefGoogle Scholar
  8. 8.
    Li, P., Li, J., Huang, Z., Gao, C.-Z., Chen, W.-B., Chen, K.: Privacy-preserving outsourced classification in cloud computing. Cluster Comput. 21(1), 277–286 (2018)CrossRefGoogle Scholar
  9. 9.
    Li, X., Zhu, Y., Wang, J., Liu, Z., Liu, Y., Zhang, M.: On the soundness and security of privacy-preserving SVM for outsourcing data classification. IEEE Trans. Dependable Secure Comput. 15(5), 906–912 (2018)CrossRefGoogle Scholar
  10. 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
  11. 11.
    Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129–140. Springer, Heidelberg (1992). Scholar
  12. 12.
    Rahman, M., Khalil, I., Alabdulatif, A., Yi, X.: Privacy preserving service selection using fully homomorphic encryption scheme on untrusted cloud service platform. Knowl.-Based Syst. 180, 104–115 (2019)CrossRefGoogle Scholar
  13. 13.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Shao, J., Cao, Z.: A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Appl. Math. Comput. 168(1), 135–140 (2005)MathSciNetzbMATHGoogle Scholar
  15. 15.
    Subashini, S., Kavitha, V.: A survey on security issues in service delivery models of cloud computing. J. Netw. Comput. Appl. 34(1), 1–11 (2011)CrossRefGoogle Scholar
  16. 16.
    Wei, L., et al.: Security and privacy for storage and computation in cloud computing. Inf. Sci. 258, 371–386 (2014)CrossRefGoogle Scholar
  17. 17.
    Vaikuntanathan, V., Vasudevan, P.N.: Secret sharing and statistical zero knowledge. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 656–680. Springer, Heidelberg (2015). Scholar
  18. 18.
    Yu, Y., Li, H., Chen, R., Zhao, Y., Yang, H., Du, X.: Enabling secure intelligent network with cloud-assisted privacy-preserving machine learning. IEEE Netw. 33(3), 82–87 (2019)CrossRefGoogle Scholar
  19. 19.
    Zhang, M., Yao, Y., Li, B., Tang, C.: Accountable mobile e-commerce scheme in intelligent cloud system transactions. J. Ambient Intell. Humaniz. Comput. 9(6), 1889–1899 (2018)CrossRefGoogle Scholar
  20. 20.
    Zhang, M., Zhang, Y., Jiang, Y., Shen, J.: Obfuscating eves algorithm and its application in fair electronic transactions in public cloud systems. IEEE Syst. J. 13(2), 1478–1486 (2019)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Mingwu Zhang
    • 1
    • 2
    Email author
  • Xiao Chen
    • 1
  • Gang Shen
    • 1
  • Yong Ding
    • 2
  1. 1.School of Computer ScienceHubei University of TechnologyWuhanChina
  2. 2.School of Computer Science and Information SecurityGuilin University of Electronic TechnologyGuilinChina

Personalised recommendations