Skip to main content
SpringerLink
Log in

An Efficient Proactive Secret Sharing Scheme for Cloud Storage

  • Conference paper
  • First Online:
Applied Cryptography and Network Security Workshops (ACNS 2021)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 12809))

Included in the following conference series:

  • 1445 Accesses

Abstract

Aiming at the security problems of cloud storage industry, this paper proposes an efficient proactive secret sharing (PSS) scheme for cloud storage. The scheme divides the secret of large amount of data into multi-secrets, and uses secret sharing to make multi-secrets meet the security of the \((k,\,n)\) threshold scheme. The scheme periodically updates and verifies the shadow shares held by cloud service providers. In this way, an adversary can recover the secret if and only if it captures at least \(k\) shares during a period of update rather than any time. The scheme only calculates a few of multi-secrets at a time, which reduces the computational cost of the system. The scheme takes into account the long-term security issues and processing performance of the system, which can effectively protect the confidentiality and integrity of data, and can also be used to prove the integrity of remote data. Compared with the previous PSS scheme, the scheme has higher execution efficiency, less interaction between shareholders, and lower requirements for communication channels, which can better to meet the needs of cloud storage in the current era.

This work was supported by the Key Laboratory of Information and Network Securi-ty, Ministry of Public Security, the Third Research Institute of the Ministry of Public Security(C19605).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ateniese, G., et al.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur. (TISSEC) 14, 1–34 (2011)

    Article  Google Scholar 

  2. Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  3. Blakley, G.R.: Safeguarding cryptographic keys. In: International Workshop on Managing Requirements Knowledge, vol. 313. IEEE Computer Society (1979)

    Google Scholar 

  4. Mignotte, M.: How to share a secret. In: Beth, Thomas (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 371–375. Springer, Heidelberg (1983). https://doi.org/10.1007/3-540-39466-4_27

    Chapter  Google Scholar 

  5. Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theor. (1983)

    Google Scholar 

  6. Harn, L., Fuyou, M., Chang, C.C.: Verifiable secret sharing based on the Chinese remainder theorem. Secur. Commun. Netw. 7, 950–957 (2014)

    Article  Google Scholar 

  7. Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneous broadcast. In: Proceedings of the 26th Symposium on Foundations of Computer Science, pp. 335–344 (1985)

    Google Scholar 

  8. Feldman, P.: A practical scheme for non-interactive verifiable secret sharing, pp. 427–438. IEEE (1987)

    Google Scholar 

  9. Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) Annual International Cryptology Conference, pp. 129–140. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-46766-1_9

  10. Kaya, K., Selçuk, A.A.: A verifiable secret sharing scheme based on the chinese remainder theorem. In: Chowdhury, D.R., Rijmen, V., Das, A. (eds.) International Conference on Cryptology in India, pp. 414–425. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89754-5_32

  11. Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, pp. 51–59 (1991)

    Google Scholar 

  12. Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: how to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-44750-4_27

    Chapter  Google Scholar 

  13. Feng, B., Guo, C., Li, M., Wang, Z.: A novel proactive multi-secret sharing scheme. IJ Netw. Secur. 17, 123–128 (2015)

    Google Scholar 

  14. Zou, H., Jiandong, Y.U.: Multilevel threshold multi-secret sharing scheme with proactive security: multilevel threshold multi-secret sharing scheme with proactive security. J. Comput. Appl. 29, 2218–2219 (2009)

    Google Scholar 

  15. Zhou, L., Schneider, F.B., Van Renesse, R.: APSS: Proactive secret sharing in asynchronous systems. ACM Trans. Inf. Syst. Secur. (TISSEC) 8, 259–286 (2005)

    Article  Google Scholar 

  16. Schultz, D., Liskov, B., Liskov, M.: MPSS: mobile proactive secret sharing. ACM Trans. Inf. Syst. Secur. (TISSEC) 13, 1–32 (2010)

    Article  Google Scholar 

  17. Qin, H., Dai, Y.: Proactive quantum secret sharing. Quantum Inf. Process. 14(11), 4237–4244 (2015). https://doi.org/10.1007/s11128-015-1106-x

    Article  MathSciNet  MATH  Google Scholar 

  18. Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM REV 43, 129–159 (2001)

    Article  MathSciNet  Google Scholar 

  19. Fan, Y., Lin, X., Tan, G., Zhang, Y., Dong, W., Lei, J.: One secure data integrity verification scheme for cloud storage. Futur. Gener. Comput. Syst. 96, 376–385 (2019)

    Article  Google Scholar 

  20. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) International Conference on the Theory and Application of Cryptology and Information Security, pp. 90–107. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-89255-7_7

  21. Harn, L., Hsu, C., Xia, Z., Zhou, J.: How to share secret efficiently over networks. Secur. Commun. Netw. 2017 (2017)

    Google Scholar 

  22. Harn, L., Xia, Z., Hsu, C., Liu, Y.: Secret sharing with secure secret reconstruction. Inform. Sci. 519, 1–8 (2020)

    Article  MathSciNet  Google Scholar 

  23. Dehkordi, M.H., Mashhadi, S., Oraei, H.: A proactive multi stage secret sharing scheme for any given access structure. Wireless Pers. Commun. 104, 491–503 (2019)

    Article  Google Scholar 

  24. Maram, S.K.D., et al.: CHURP: dynamic-committee proactive secret sharing. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2369–2386 (2019)

    Google Scholar 

  25. Qiu, S., Wang, D., Xu, G., Kumari, S.: Practical and provably secure three-factor authentication protocol based on extended chaotic-maps for mobile lightweight devices. IEEE T Depend. Secur. (2020)

    Google Scholar 

  26. Wang, D., Wang, P.: Two birds with one stone: two-factor authentication with security beyond conventional bound. IEEE Trans. Depend. Secur. Comput. 1 (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information and Electrical Engineering, China Agricultural University, Beijing, China

    Shuihai Zhang, Jingfu Wang, Yan Zhang & Chunli Lyu

  2. The 3rd Research Institute of the Ministry of Public Security, Shanghai, China

    Bei Pei

Authors
  1. Shuihai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jingfu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Bei Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Chunli Lyu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chunli Lyu .

Editor information

Editors and Affiliations

  1. Singapore University of Technology and Design, Singapore, Singapore

    Jianying Zhou

  2. University of Strathclyde, Glasgow, UK

    Chuadhry Mujeeb Ahmed

  3. ICIS, Radboud University, Nijmegen, The Netherlands

    Lejla Batina

  4. Singapore University of Technology and Design, Singapore, Singapore

    Sudipta Chattopadhyay

  5. LIACS, Leiden University, Leiden, The Netherlands

    Olga Gadyatskaya

  6. Centrum Wiskunde & Informatica, Amsterdam, The Netherlands

    Chenglu Jin

  7. University of Science and Technology of China, Hefei, China

    Jingqiang Lin

  8. University of Padua, Padua, Italy

    Eleonora Losiouk

  9. University of Kansas, Lawrence, KS, USA

    Bo Luo

  10. CIISE, Concordia University, Montréal, Canada

    Suryadipta Majumdar

  11. New York University, Abu Dhabi, United Arab Emirates

    Mihalis Maniatakos

  12. Illinois at Singapore Pte Ltd, Singapore, Singapore

    Daisuke Mashima

  13. Technical University of Denmark, Kongens Lyngby, Denmark

    Weizhi Meng

  14. Delft University of Technology, Delft, The Netherlands

    Stjepan Picek

  15. SECOM Co., Ltd., Tokyo, Japan

    Masaki Shimaoka

  16. University of Aizu, Aizu-Wakamatsu, Japan

    Chunhua Su

  17. City University of Hong Kong, Hong Kong, Hong Kong

    Cong Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, S., Wang, J., Zhang, Y., Pei, B., Lyu, C. (2021). An Efficient Proactive Secret Sharing Scheme for Cloud Storage. In: Zhou, J., et al. Applied Cryptography and Network Security Workshops. ACNS 2021. Lecture Notes in Computer Science(), vol 12809. Springer, Cham. https://doi.org/10.1007/978-3-030-81645-2_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-81645-2_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-81644-5

  • Online ISBN: 978-3-030-81645-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation