Secret sharing schemes based on the dual of Golay codes-Reference-Cited by-同舟云学术

Secret sharing schemes based on the dual of Golay codes

Published:2021-11 Issue:6 Volume:13 Page:1025-1041
ISSN:1936-2447
Container-title:Cryptography and Communications
language:en
Short-container-title:Cryptogr. Commun.

Author:

Ding Jian,Lin Changlu^ORCID,Mesnager Sihem

Funder

National Natural Science Foundation of China

Natural Science Foundation of Fujian Province

University Natural Science Research Project of Anhui Province

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications

Link

https://link.springer.com/content/pdf/10.1007/s12095-021-00531-w.pdf

Reference31 articles.

1. Ashikhmin, A., Barg, A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010–2017 (1998)

2. Bartoli, D., Bonini, M.: Minimal linear codes in odd characteristic. IEEE Trans. Inf. Theory 65(7), 4152–4155 (2019)

3. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the national computer conference’79, AFIPS Proceedings, vol. 48, pp 313–317 (1979)

4. Bouyuklieva, S., Varbanov, Z.: Some connections between self-dual codes, combinatorial designs and secret sharing schemes. Adv. Math. Commun. 5(2), 191–198 (2011)

5. Carlet, C., Ding, C., Yuan, J.: Linear codes from perfect nonlinear mappings and their secret sharing schemes. IEEE Trans. Inf. Theory 51(6), 2089–2102 (2005)

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secret Sharing Scheme: Based on LCD Code;2022 International Interdisciplinary Conference on Mathematics, Engineering and Science (MESIICON);2022-11-11