Enhancing secret sharing security : A verifiable hierarchical threshold model and cheating detection based on integer factorization
Ali Havasia_havasi@mathdep.iust.ac.irSchool of Mathematics and Computer SciencesIran University of Science and TechnologyTehran, Iran0000-0002-1239-7610View full profile → , *Massoud Hadian DehkordiCorresponding authormhadian@iust.ac.irSchool of Mathematics and Computer SciencesIran University of Science and TechnologyTehran, Iran0009-0003-9753-4307View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 09 Jul 2024
- Published Online:
- 28 Jul 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2217
- Pages:
- 77–86
Abstract
Keywords
Subject Classifications
References
[1] A. Shamir, “How to share a secret,” Communications of the ACM, vol. 22, no. 11, pp. 612-613 (1979).
[2] G. R. Blakley, “Safeguarding cryptographic keys,” in Managing Requirements Knowledge, International Workshop on, pp. 313-313, IEEE Computer Society (1979).
[3] M. Tompa and H. Woll, “How to share a secret with cheaters,” Journal of Cryptology, vol. 1, no. 3, pp. 133-138 (1989).
[4] M. Carpentieri, A. D. Santis, and U. Vaccaro, “Size of shares and probability of cheating in threshold schemes,” in Workshop on the Theory and Application of of Cryptographic Techniques, pp. 118-125, Springer (1993).
[5] Y. Tian, C. Peng, and J. Ma, “Publicly veriable secret sharing schemes using bilinear pairings.,” Int. J. Netw. Secur., vol. 14, no. 3, pp. 142-148 (2012).
[6] J. Pieprzyk and X.-M. Zhang, “Cheating prevention in linear secret sharing,” in Australasian Conference on Information Security and Privacy, pp. 121-135, Springer (2002).
[7] M. P. Jhanwar and R. Safavi-Naini, “On the share eciency of robust secret sharing and secret sharing with cheating detection,” in International Conference on Cryptology in India, pp. 179-196, Springer (2013).
[8] S. Cabello, C. Padro, and G. Saez, “Secret sharing schemes with detection of cheaters for a general access structure,” Designs, Codes and Cryptography, vol. 25, pp. 175-188 (2002).
[9] Y. Liu, “Linear (k, n) secret sharing scheme with cheating detection,” Security and Communication Networks, vol. 9, no. 13, pp. 2115-2121, 2016.
[10] S. Dutta, S. Jiang, and R. Safavi-Naini, “Lower bounds on the share size of leakage resilient cheating detectable secret sharing,” in International Conference on Cryptology and Network Security, pp. 468{493, Springer (2023).
[11] M. A. Hossain and R. Bandi, “A veriable multi-secret sharing scheme based on ”intersection pair of cyclic codes,” International Journal of Foundations of Computer Science, pp. 1-21 (2023).
[12] K. Sato and S. Obana, “Cheating detectable secret sharing scheme from multiplicative homomorphic authentication function,” in 2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW), pp. 372-378, IEEE (2021).
[13] L. Cianciullo and H. Ghodosi, “Outsourced cheating detection for secret sharing,” International Journal of Information Security, vol. 20, no. 6, pp. 871-878 (2021).
[14] G. Meriem and S. Bouroubi, “A new ideal secret sharing scheme based on a tree,” Journal of Discrete Mathematical Sciences and Cryptography, pp. 1-18 (2021).
[15] H.-M. Sun, S.-P. Shieh, “Constructing perfect secret sharing schemes for general and uniform access structures,” Journal of information science and engineering, vol. 15, no. 5, pp. 679-689, 1999.
[16] N. M. Al-Saidi, N. Rajab, M. Md. Said, and K. Kadhim, “Perfect secret sharing scheme based on vertex domination set,” International Journal of Computer Mathematics, vol. 92, no. 9, pp. 1755-1763 (2015).
