A Multisecret-Sharing Scheme Based on LCD Codes

被引：22

作者：

Alahmadi, Adel ^{[1
]}

Altassan, Alaa ^{[1
]}

AlKenani, Ahmad ^{[1
]}

Calkavur, Selda ^{[2
]}

Shoaib, Hatoon ^{[1
]}

Sole, Patrick ^{[3
]}

机构：

[1] King Abdulaziz Univ, Math Dept, Jeddah 21589, Saudi Arabia

[2] Kocaeli Univ, Kosekoy Vocat Sch, Math Dept, TR-41135 Kocaeli, Turkey

[3] Aix Marseille Univ, Cent Marseille, CNRS, I2M, F-13009 Marseille, France

来源：

MATHEMATICS | 2020年 / 8卷 / 02期

关键词：

secret sharing; multisecret-sharing; linear codes; LINEAR CODES; SECRET;

D O I：

10.3390/math8020272

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Secret sharing is one of the most important cryptographic protocols. Secret sharing schemes (SSS) have been created to that end. This protocol requires a dealer and several participants. The dealer divides the secret into several pieces ( the shares), and one share is given to each participant. The secret can be recovered once a subset of the participants (a coalition) shares their information. In this paper, we present a new multisecret-sharing scheme inspired by Blakley's method based on hyperplanes intersection but adapted to a coding theoretic situation. Unique recovery requires the use of linear complementary (LCD) codes, that is, codes in which intersection with their duals is trivial. For a given code length and dimension, our system allows dealing with larger secrets and more users than other code-based schemes.

引用

页数：10

共 31 条

[1]

Al Ebri N., 2011, 2011 6th International Conference for Internet Technology and Secured Transactions (ICITST), P40

[2]

[Anonymous], 2008, CODING CRYPTOGRAPHY

[3]

Beimel Amos, 2011, Coding and Cryptology. Proceedings of the Third International Workshop, IWCC 2011, P11, DOI 10.1007/978-3-642-20901-7_2

[4]

Blakley G.R., 1979, P 1979 AFIPS NAT COM, P313

[5]

Bozkurt I.N., 2008, P INF SEC CRYPT 2008

[6] Multisecret-sharing schemes and bounded distance decoding of linear codes [J].

Calkavur, Selda ;

Sole, Patrick .

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2017, 94 (01) :107-114

[7]

Carlet C., 2014, P 4 ICMCTA M PALM PO

[8]

Csirmaz L., 2011, P 13 INT C INF COMM

[9]

Ding C., 1997, J Univers Comput Sci, V3, P1023

[10]

Dougherty S. T., 2017, Int. J. Inf. Coding Theory, V4, P116

← 1 2 3 4 →