Enhancing secret sharing security: A cheating detection approach based on inverse polynomial coefficients

Document Type : Original Article

Authors

1 PhD student, University of Science and Technology, Tehran, Iran

2 Professor, Iran University of Science and Technology, Tehran, Iran

Abstract

Secret sharing is the process of distributing a secret among n shareholders, in such a way that only a subset of them can recover the secret, while unauthorized subsets, referred to as dishonest shareholders, cannot access the secret. During the secret reconstruction phase, when shareholders present their shares, a dishonest shareholder or shareholders can always obtain the secret exclusively by presenting fake shares, thus leaving the honest shareholders with nothing but a fake secret. Detecting cheating is crucial for achieving a fair secret reconstruction. In this paper, it has been proposed a cheating-detecting secret sharing scheme that utilizes polynomial coefficients for cheat detection in secret reconstruction. It is leveraged the invertibility property of polynomial coefficients in the z_q field to detect cheat and employ relationships that follow a linear equation.
 

Keywords

Main Subjects


[1]     A. Shamir, "How to share a secret," Communications of the ACM, vol. 22, 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. Doi: 10.1109/AFIPS.1979.98
[3]     M. Tompa and H. Woll, "How to share a secret with cheaters," journal of Cryptology, vol. 1, no. 3, pp. 133-138, 1989. Doi: https://doi.org/10.1007/BF02252871
[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. Doi: https://doi.org/10.1007/3-540-48285-7_10
[5]     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. Doi: https://doi.org/10.1007/3-540-45450-0_9
[6]     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
[7]     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. Doi: https://doi.org/10.1007/978-981-99-7563-1_21
[8]     M. A. Hossain and R. Bandi, "A verfiable multi-secret sharing scheme based on  -intersection pair of cyclic codes," International Journal of Foundations of Computer Science, pp. 1-21, 2023. Doi: https://doi.org/10.1142/S0129054123500284
[9]     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. Doi: 10.1109/CANDARW53999.2021.00069
[10]  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. Doi: https://doi.org/10.1023/A:1013856431727
[11]  L. Cianciullo and H. Ghodosi, "Outsourced cheating detection for secret sharing," International Journal of Information Security, vol. 20, no. 6, pp. 871-878, 2021. Doi: https://doi.org/10.1007/s10207-021-00538-7
[12]  L. Harn and C. Lin, "Detection and identification of cheaters in (t, n) secret sharing scheme," Designs, Codes and Cryptography, vol. 52, no. 1, pp. 15-24, 2009. Doi: https://doi.org/10.1007/s10623-008-9265-8
Volume 12, Issue 2 - Serial Number 46
September 2024
Pages 109-114
  • Receive Date: 28 May 2024
  • Revise Date: 01 August 2024
  • Accept Date: 13 August 2024
  • Publish Date: 31 August 2024