Secret sharing schemes based on additive codes over GF(4)

DOI10.1007/S00200-016-0296-5MaRDI QIDQ2397159zbMATH OpenOpenAlexFDO

Authors Jon-Lark Kim, Nari Lee

Publication date 29 May 2017

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1701.04183

zbMATH Keywords

access structureadditive codesgeneralized \(t\)-designminimal access structuresecret sharing scheme

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Authentication, digital signatures and secret sharing (94A62)

Abstract: A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed-Solomon code. SSSs based on linear codes have been studied by many researchers. However there is little research on SSSs based on additive codes. In this paper, we study SSSs based on additive codes over $GF(4)$ and show that they require at least two steps of calculations to reveal the secret. We also define minimal access structures of SSSs from additive codes over $GF(4)$ and describe SSSs using some interesting additive codes over $GF(4)$ which contain generalized 2-designs.

Recommendations

• Secret sharing schemes from three classes of linear codes
• Secret sharing schemes with nice access structures
• A new secret sharing scheme
• Linear algebra approach to secret sharing schemes
• Secret sharing schemes based on graphical codes

Cites work

• Designs in additive codes over GF(4)
• Four fundamental parameters of a code and their combinatorial significance
• Fundamentals of Error-Correcting Codes
• How to share a secret
• scientific article; zbMATH DE number 2040937 (Why is no real title available?)
• New 5-designs
• On additive GF(4) codes
• Secret sharing schemes from binary linear codes
• Secret sharing schemes from three classes of linear codes
• Secret-sharing with a class of ternary codes
• Self-dual codes over GF(4)
• Self-dual codes over the Kleinian four group
• The accessibility of an access structure

Cited in

(7)

• Additive and linear conjucyclic codes over \(\mathbb{F}_4\)
• Algebraic structure of additive conjucyclic codes over \(\mathbb{F}_4\)
• Additive codes with few weights
• Additive complementary pairs of codes
• Some optimal \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
• Quaternary conjucyclic codes with an application to EAQEC codes
• On -rank additive intersection pairs (RAIP) of codes

This page was built for publication: Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397159)