1. Home
  2. Vol 4, No 4 (2020)
  3. Çalkavur

A Study on Multisecret-Sharing Schemes Based on Linear Codes

Selda Çalkavur

Abstract


Secret sharing has been a subject of study since 1979. In the secret sharing schemes there are some participants and a dealer. The dealer chooses a secret. The main principle is to distribute a secret amongst a group of participants. Each of whom is called a share of the secret. The secret can be retrieved by participants. Clearly the participants combine their shares to reach the secret. One of the secret sharing schemes is  threshold secret sharing scheme. A  threshold secret sharing scheme is a method of distribution of information among  participants such that  can recover the secret but  cannot. The coding theory has been an important role in the constructing of the secret sharing schemes. Since the code of a symmetric  design is a linear code, this study is about the multisecret-sharing schemes based on the dual code  of  code  of a symmetric  design. We construct a multisecret-sharing scheme Blakley’s construction of secret sharing schemes using the binary codes of the symmetric design. Our scheme is a threshold secret sharing scheme. The access structure of the scheme has been described and shows its connection to the dual code. Furthermore, the number of minimal access elements has been formulated under certain conditions. We explain the security of this scheme.

Keywords


Secret Sharing; Multisecret-Sharing; Linear Code; Symmetric Design.

References


Blakley, G. R. “Safeguarding Cryptographic Keys.” 1979 International Workshop on Managing Requirements Knowledge (MARK) (June 1979). doi:10.1109/mark.1979.8817296.

Shamir, Adi. “How to Share a Secret.” Communications of the ACM 22, no. 11 (November 1, 1979): 612–613. doi:10.1145/359168.359176.

Stinson, D. R. “An Explication of Secret Sharing Schemes.” Designs, Codes and Cryptography 2, no. 4 (December 1992): 357–390. doi:10.1007/bf00125203.

McEliece, R. J., and D. V. Sarwate. “On Sharing Secrets and Reed-Solomon Codes.” Communications of the ACM 24, no. 9 (September 1, 1981): 583–584. doi:10.1145/358746.358762.

Massey, James L. "Minimal codewords and secret sharing." In Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, (1993): 276-279.

Dougherty, Steven T., Sihem Mesnager, and Patrick Sole. “Secret-Sharing Schemes Based on Self-Dual Codes.” 2008 IEEE Information Theory Workshop (May 2008). doi:10.1109/itw.2008.4578681.

Harn, L. "Comment on" Multistage secret sharing based on one-way function"." Electronics Letters 31, no. 4 (1995): 262. doi:10.1049/el:19950201.

He, Jingmin, and Edward Dawson. "Multistage secret sharing based on one-way function." Electronics Letters 30, no. 19 (1994): 1591-1592. doi:10.1049/el:19941076.

Li, HuiXian, ChunTian Cheng, and LiaoJun Pang. “A New (t, N)-Threshold Multi-Secret Sharing Scheme.” Lecture Notes in Computer Science (2005): 421–426. doi:10.1007/11596981_61.

Pang, Liao-Jun, and Yu-Min Wang. “A New (t,n) Multi-Secret Sharing Scheme Based on Shamir’s Secret Sharing.” Applied Mathematics and Computation 167, no. 2 (August 2005): 840–848. doi:10.1016/j.amc.2004.06.120.

Bai, Li. “A Reliable (k, N) Image Secret Sharing Scheme.” 2006 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing (2006). doi:10.1109/dasc.2006.11.

Çalkavur, Selda, and Patrick Solé. “Multisecret-Sharing Schemes and Bounded Distance Decoding of Linear Codes.” International Journal of Computer Mathematics 94, no. 1 (October 16, 2015): 107–114. doi:10.1080/00207160.2015.1091071.

Alahmadi, Adel, Alaa Altassan, Ahmad AlKenani, Selda Çalkavur, Hatoon Shoaib, and Patrick Solé. “A Multisecret-Sharing Scheme Based on LCD Codes.” Mathematics 8, no. 2 (February 18, 2020): 272. doi:10.3390/math8020272.

Çalkavur, Selda, and Patrick Solé. “Some Multisecret-Sharing Schemes over Finite Fields.” Mathematics 8, no. 5 (April 25, 2020): 654. doi:10.3390/math8050654.

Çalkavur, Selda. “Secret Sharing Schemes Based on Extension Fields.” European Journal of Pure and Applied Mathematics 11, no. 2 (April 27, 2018): 410–416. doi:10.29020/nybg.ejpam.v11i2.3226.

Molla, Fatih, and Selda Çalkavur. “A New Approach to Construct Secret Sharing Schemes Based on Field Extensions.” European Journal of Pure and Applied Mathematics 11, no. 2 (April 27, 2018): 468–475. doi:10.29020/nybg.ejpam.v11i2.3250.

Calkavur, Selda. “An Image Secret Sharing Method Based on Shamir Secret Sharing.” Current Trends in Computer Sciences & Applications 1, no. 2 (November 20, 2018). doi:10.32474/ctcsa.2018.01.000106.

Lander, E. S. “Symmetric Designs: an Algebraic Approach” Cambridge University (January 20, 1983): 1–41. doi:10.1017/cbo9780511662164.002.

Padró, Carles. “Robust Vector Space Secret Sharing Schemes.” Information Processing Letters 68, no. 3 (November 1998): 107–111. doi:10.1016/s0020-0190(98)00149-5.

Ding, Cunsheng, Tero Laihonen, and Ari Renvall. "Linear multisecret-sharing schemes and error-correcting codes." Journal of Universal Computer Science 3, no. 9 (1997): 1023-1036.


Full Text: PDF

DOI: 10.28991/esj-2020-01229

Refbacks

  • There are currently no refbacks.


Copyright (c) 2020 Selda Çalkavur