|
[1]
|
Shamir, A. (1979) How to Share a Secret. Communications of the ACM, 22, 612-613. [Google Scholar] [CrossRef]
|
|
[2]
|
Blakley, G.R. (1979) Safeguarding Cryptographic Keys. 1979 International Workshop on Managing Requirements Knowledge (MARK), New York, 4-7 June 1979, 313-318. [Google Scholar] [CrossRef]
|
|
[3]
|
Asmuth, C. and Bloom, J. (1983) A Modular Approach to Key Safeguarding. IEEE Transactions on Information Theory, 29, 208-210. [Google Scholar] [CrossRef]
|
|
[4]
|
Chien, H.Y., Jan, J.K. and Tseng, Y.M. (2000) A Practical (t,n) Multi-Secret Sharing Scheme. IEICE Transactions on Fundamentals, 83, 2762-2765.
|
|
[5]
|
Tompa, M. and Woll, H. (n.d.) How to Share a Secret with Cheaters. In: Odlyzko, A.M., Eds., Advances in Cryptology—CRYPTO’86, Springer, 261-265. [Google Scholar] [CrossRef]
|
|
[6]
|
McEliece, R.J. and Sarwate, D.V. (1981) On Sharing Secrets and Reed-Solomon Codes. Communications of the ACM, 24, 583-584. [Google Scholar] [CrossRef]
|
|
[7]
|
Massey, J.L. (1993) Minimal Codewords and Secret Sharing. Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, 1993, 276-279.
|
|
[8]
|
宋云, 李志慧, 李永明. 基于极小线性码上的秘密共享方案[J]. 电子学报, 2013, 41(2): 220-226.
|
|
[9]
|
Tentu, A.N., Paul, P. and Venkaiah, V.C. (2013) Ideal and Perfect Hierarchical Secret Sharing Schemes Based on MDS Codes. IACR Cryptology ePrint Archive, Paper 2013/189. http://eprint.iacr.org/2013/189
|
|
[10]
|
Alahmadi, A., Altassan, A., AlKenani, A., Çalkavur, S., Shoaib, H. and Solé, P. (2020) A Multisecret-Sharing Scheme Based on LCD Codes. Mathematics, 8, Article 272. [Google Scholar] [CrossRef]
|
|
[11]
|
Ghosh, H., Bhowmick, S., Maurya, P.K. and Bagchi, S. (2021) Linear Complementary Dual Code-Based Multi-Secret Sharing Scheme. arXiv:2112.05469. [Google Scholar] [CrossRef]
|
|
[12]
|
伍高飞, 张玉清. 基于循环码的秘密共享方案[J]. 密码学报, 2024, 11(4): 895-910.
|
|
[13]
|
郭玉娟, 李志慧, 赖红. 基于线性码上的动态可验证的秘密共享方案[J]. 陕西师范大学学报, 2010, 38(4): 7-12.
|
|
[14]
|
李富林, 刘杨, 王娅如. 一种基于Hamming码的门限多秘密共享方案[J]. 合肥工业大学学报(自然科学版), 2021, 44(5): 711-714, 720.
|
|
[15]
|
Agrawal, D., Das, S. and Krishanaswamy, S. (2020) Secret Sharing Schemes Based on Nonlinear Codes. 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, 21-26 June 2020, 864-867. [Google Scholar] [CrossRef]
|
|
[16]
|
Agrawal, D. (2022) Nonlinear Secret Sharing Schemes Based on Z4 Linear Codes. 2022 IEEE Globecom Workshops (GC Wkshps), Rio de Janeiro, 4-8 December 2022, 608-611. [Google Scholar] [CrossRef]
|
|
[17]
|
Hossain, M.A. and Bandi, R. (2023) A Verifiable Multi-Secret Sharing Scheme Based on ℓ-Intersection Pair of Cyclic Codes. International Journal of Foundations of Computer Science, 1-21. [Google Scholar] [CrossRef]
|
|
[18]
|
庞辽军, 裴庆祺, 李慧贤, 等. 秘密共享技术及其应用[J]. 通信学报, 2017, 38(3): 204.
|
|
[19]
|
MacWilliams, F.J. and Sloane, N.J.A. (1977) The Theory of Error-Correcting C-Odes. Elsevier.
|
|
[20]
|
Çalkavur, S., Bonnecaze, A., Cruz, R.D. and Solé, P. (2021) Code Based Secret Sharing Schemes: Applied Combinatorial Coding Theory. World Scientific. [Google Scholar] [CrossRef]
|