Scholarlink

<p>A multisecret-sharing scheme is a method for distributing <Emphasis Type="BoldItalic">n</Emphasis> randomly associated secrets <Emphasis Type="BoldItalic">s</Emphasis><sub>1</sub>, <Emphasis Type="BoldItalic">s</Emphasis><sub>2</sub>,..., <Emphasis Type="BoldItalic">s</Emphasis><sub>n</sub> among a set of attendants. Linear codes with complementary duals, LCD codes, form an important class of linear codes, while weighing orthogonal matrices play a significant role in cryptography. In this paper, we design novel multisecret-sharing schemes based on LCD codes derived from weighing orthogonal matrices. We analyze the access structures, coalition statistics, security aspects, and information-theoretic efficiency compared to existing multisecret-sharing methods.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月18日

查看全文
  • Selda Çalkavur,
  • Patrick Solé

摘要

A multisecret-sharing scheme is a method for distributing n randomly associated secrets s1, s2,..., sn among a set of attendants. Linear codes with complementary duals, LCD codes, form an important class of linear codes, while weighing orthogonal matrices play a significant role in cryptography. In this paper, we design novel multisecret-sharing schemes based on LCD codes derived from weighing orthogonal matrices. We analyze the access structures, coalition statistics, security aspects, and information-theoretic efficiency compared to existing multisecret-sharing methods.