Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application
Articles

NEW SCHEME OF MIGNOTTE (t,n) COLLABORATIVE SECRET SHARING ON CLOUD STORAGE

pdf
  • Dhea Ekaputri,
  • Sugi Guritman,
  • Jaharuddin Jaharuddin
Dhea Ekaputri
Departement of Mathematics, School of Data Science, Mathematics, and Informatics, IPB University, Indonesia
Sugi Guritman
Departement of Mathematics, School of Data Science, Mathematics, and Informatics, IPB University, Indonesia
Jaharuddin Jaharuddin
Departement of Mathematics, School of Data Science, Mathematics, and Informatics, IPB University, Indonesia
DOI: https://doi.org/10.30598/barekengvol19iss4pp2981-2992
Published September 1, 2025
Keywords
  • Cheating detection,
  • Cloud storage,
  • Collaborative secret sharing,
  • Mignotte
How to Cite
[1]
D. Ekaputri, S. Guritman, and J. Jaharuddin, “NEW SCHEME OF MIGNOTTE (t,n) COLLABORATIVE SECRET SHARING ON CLOUD STORAGE”, BAREKENG: J. Math. & App., vol. 19, no. 4, pp. 2981-2992, Sep. 2025.

Copyright (c) 2025 Dhea Ekaputri, Sugi Guritman, Jaharuddin Jaharuddin

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Abstract

Cloud storage is an internet-based data storage service that allows users to collaborate to store, manage, and access data remotely. However, this collaborative characteristic creates challenges in security and privacy. One potential solution to these issues is implementing a collaborative secret sharing scheme. This research proposes a modified Mignotte  collaborative secret sharing scheme by introducing a detector parameter  to detect cheating. Additionally, the scheme is designed so that participants with multiple privileges only need to store a single share. The main contribution of this research is the integration of a cheating detection mechanism into the Mignotte  collaborative secret sharing scheme while maintaining storage efficiency. Experimental results show that the scheme produces correct outputs across various test cases. The proposed modification enhances the security of the secret sharing scheme for cloud storage applications by protecting against cheating and unauthorized access. However, the current scheme is limited to detection without identifying the cheater. Future research can focus on developing mechanisms for further identifying cheaters to enhance overall security.

pdf

Downloads

Download data is not yet available.

References

  1. Y. E. Rachmad, R. Dewantara, R. S. Junaidi, M. Firdaus, S. S. W., S. and E. , MASTERING CLOUD COMPUTING (FOUNDATIONS AND APPLICATIONS PROGRAMMING), Jambi: Sonpedia Publishing Indonesia, 2023.
  2. I. Odun-Ayo, O. Ajayi, B. Akanle and R. Ahuja, "AN OVERVIEW OF DATA STORAGE IN CLOUD COMPUTING," in IEEE, New York (NY), 2017, doi: https://doi.org/10.1109/ICNGCIS.2017.9.
  3. N. Vurukonda and B. T. Rao, "A STUDY ON DATA STORAGE SECURITY ISSUES IN CLOUD COMPUTING," in Elsevier, Belanda, 2016, doi: ttps://doi.org/10.1016/j.procs.2016.07.335
  4. P. Yang, N. Xiong and J. Ren, "DATA SECURITY AND PRIVACY PROTECTION FOR CLOUD STORAGE: A SURVEY," IEEE Access, vol. 8, pp. 131723-131740, 2020, doi: https://doi.org/10.1109/ACCESS.2020.3009876.
  5. Y.-H. Chen and P.-C. Huang, "COLLABORATIVE ACCESS CONTROL OF CLOUD STORAGE SYSTEMS," in IEEE, New York (NY), 2018, doi: https://doi.org/10.1109/ICASI.2018.8394460
  6. L. Yuan, M. Li, C. Guo, K.-K. R. Choo and Y. Ren, "NOVEL THRESHOLD CHANGEABLE SECRET SHARING SCHEMES BASED ON POLYNOMIAL INTERPOLATION," PLOS ONE, vol. 11, no. 10, pp. 1-19, 2016, doi: https://doi.org/10.1371/journal.pone.0165512
  7. X. Jia, D. Wang, D. Nie, X. Luo and J. Z. Sun, "A NEW THRESHOLD CHANGEABLE SECRET SHARING SCHEME BASED ON THE CHINESE REMAINDER THEOREM," Information Sciences, vol. 473, pp. 13-30, 2019, doi: https://doi.org/10.1016/j.ins.2018.09.024.
  8. A. J. Menezes, P. C. Van Oorschot and S. A. Vanstone, HanDBOOK OF APPLIED CRYPTOGRAPHY, Florida: CRC Press, 1996.
  9. X. Jia, Y. Song, D. Wang, D. Nie and J. Wu, "A COLLABORATIVE SECRET SHARING SCHEME BASED ON THE CHINESE REMAINDER THEOREM," Mathematical Biosciences and Engineering, vol. 16, no. 3, pp. 1280-1299, 2019, doi: https://doi.org/10.3934/mbe.2019062
  10. Y. Liu, C. Yang, Y. Wang, L. Zhu and W. Ji, "CHEATING IDENTIFIABLE SECRET SHARING SCHEME USING SYMMETRIC BIVARIATE POLYNOMIAL," Information Sciences, vol. 453, pp. 21-29, 2018, doi: https://doi.org/10.1016/j.ins.2018.04.043.
  11. M. Gharahi and S. Khazaei, "OPTIMAL LINEAR SECRET SHARING SCHEMES FOR GRAPH ACCESS STRUCTURES ON SIX PARTICIPANTS," Theoretical Computer Science, vol. 771, pp. 1-8, 2019, doi: https://doi.org/10.1016/j.tcs.2018.11.007
  12. X. Jia, Y. Guo, X. Luo, D. Wang and C. Zhang, "A PERFECT SECRET SHARING SCHEME FOR GENERAL ACCESS STRUCTURES," Information Sciences, vol. 595, pp. 54-69, 2022, doi: https://doi.org/10.1016/j.ins.2022.02.016
  13. V. P. Binu and A. Sreekumar, "SECURE AND EFFICIENT SECRET SHARING SCHEME WITH GENERAL ACCESS STRUCTURES BASED ON ELLIPTIC CURVE AND PAIRING," Wireless Personal Communications, vol. 92, no. 4, pp. 1531-1543, 2017, doi: https://doi.org/10.1007/s11277-016-3619-8
  14. X. Dong, "A MULTI-SECRET SHARING SCHEME BASED ON THE CRT AND RSA," International Journal of Electronics and Information Engineering, vol. 2, no. 1, pp. 47-51, 2015, doi: 10.6636/IJEIE.201503.2(1).05.
  15. L. Tan, Y. Lu, X. Yan, L. Liu and L. Li, "WEIGHTED SECRET IMAGE SHARING FOR A (K,N) THRESHOLD BASED ON THE CHINESE REMAINDER THEOREM," IEEE Access, vol. 7, pp. 59278-59286, 2019, doi: https://doi.org/10.1109/ACCESS.2019.2914515
  16. K. Meng, F. Miao, Y. Ning, W. Huang, Y. Xiong and C.-C. Chang, "A PROACTIVE SECRET SHARING SCHEME BASED ON CHINESE REMAINDER THEOREM," Frontiers of Computer Science, vol. 15, no. 2, pp. 1-10, 2020, doi: https://doi.org/10.1007/s11704-019-9123-z
  17. A. N. Tentu, V. Venkaiah and V. K. Prasad, "CRT BASED MULTI-SECRET SHARING SCHEMES: REVISITED," International Journal of Security and Networks, vol. 13, no. 1, pp. 1-9, 2018, doi: https://doi.org/10.1504/IJSN.2018.090637
  18. M. Mignotte and S. , HOW TO SHARE A SECRET, Verlag: Springer, 1983.
  19. C. Asmuth and J. Bloom, "A MODULAR APPROACH TO KEY SAFEGUARDING," IEEE Transactions on Information Theory, vol. 29, no. 2, pp. 208-210, 1983, doi: https://doi.org/10.1109/TIT.1983.1056651
  20. K. K. Phiri and H. Kim, "LINEAR (t,n) SECRET SHARING SCHEME WITH REDUCED NUMBER OF POLYNOMIALS," HINDAWI, vol. 2019, pp. 1-16, 2019, doi: https://doi.org/10.1155/2019/5134534
  21. Y. Liu, "LINEAR (k,n) SECRET SHARING SCHEME WITH CHEATING DETECTION," Security and Communication Networks, vol. 9, no. 13, pp. 2115-2121, 2016, doi: https://doi.org/10.1002/sec.1467
  22. X. Yan, Y. Lu, L. Liu, J. Liu and G. Yang, "CHINESE REMAINDER THEOREM-BASED TWO-IN-ONE IMAGE SECRET SHARING WITH THREE DECODING OPTIONS," Digital Signal Processing, vol. 82, pp. 80-90, 2018, doi: https://doi.org/10.1016/j.dsp.2018.07.015
  23. K. H. Rosen, ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS, Reading, Mass. u.a: Addison-Wesley, 1986.
  24. D. M. Burton, ELEMENTARY NUMBER THEORY, New York (US): McGraw-Hill, 2011.
  25. E. Kranakis, PRIMALITY AND CRYPTOGRAPHY, Wiesbaden: Springer, 1986. doi: https://doi.org/10.1007/978-3-322-96647-6
  26. D. Romik, TOPICS IN COMPLEX ANALYSIS, Berlin: De Gruyter, 2023. doi: https://doi.org/10.1515/9783110796810