Secret-sharing with a class of ternary codes
From MaRDI portal
Publication:1583097
Secret-sharing is an important topic of cryptography and has applications in information security. One approach to the construction of secret-sharing schemes is based on error-correcting codes. We describe a secret-sharing scheme based on a class of ternary codes [the authors, IEEE Trans. Inform. Theory IT-46, 280--284 (2000; Zbl 0998.94026)]. We determine the access structure and prove properties of the secret-sharing scheme.
Recommendations
- Secret sharing schemes from three classes of linear codes
- Secret sharing schemes from binary linear codes
- On the composition of secret sharing schemes related to codes
- Code based secret sharing schemes. Applied combinatorial coding theory
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Secret sharing with linear codes
- Secret Sharing Schemes from Two-Weight Codes
- Coding and Cryptography
- Secret sharing using near-MDS codes
- Secret sharing schemes based on the dual of Golay codes
Cites work
- Elementary 2-group character codes
- How to build robust shared control systems
- How to share a secret
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1088900 (Why is no real title available?)
- scientific article; zbMATH DE number 1122449 (Why is no real title available?)
- scientific article; zbMATH DE number 4195886 (Why is no real title available?)
- scientific article; zbMATH DE number 3404329 (Why is no real title available?)
Cited in
(26)- The weight distribution of a class of \(p\)-ary cyclic codes and their applications
- A family of group character codes
- On the maximum number of minimal codewords
- A geometric characterization of minimal codes and their asymptotic performance
- Secret sharing schemes based on the dual of Golay codes
- New classes of codes over \(R_{q,p,m}=\mathbb{Z}_{p^m}[u_1, u_2, \dots , u_q]/ \langle u_i^2=0,u_iu_j=u_ju_i\rangle\) and their applications
- Secret sharing schemes based on additive codes over \(\mathrm{GF}(4)\)
- Secret Sharing Schemes from Two-Weight Codes
- Secret sharing schemes from three classes of linear codes
- Recursive hiding of biometrics-based secret sharing scheme using adversary structure
- Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads
- Secret sharing schemes based on extension fields
- A new approach to construct secret sharing schemes based on field extensions
- Relationship between MDS codes and threshold schemes
- A novel secret sharing scheme based on minimal linear codes
- Secret sharing with linear codes
- Secret sharing schemes for compartmented access structures
- Weight distribution of a class of cyclic codes of length \(2^n\)
- Multisecret-sharing schemes and bounded distance decoding of linear codes
- Two classes of ternary codes and their weight distributions
- On the minimum number of minimal codewords
- Some codes over \(\mathcal{R} = \mathcal{R}_1\mathcal{R}_2\mathcal{R}_3\) and their applications in secret sharing schemes
- Secret sharing schemes from binary linear codes
- Multi-recipient and threshold encryption based on hidden multipliers
- Linear codes over \(\mathbb{Z}_p\mathcal{R}_1 \mathcal{R}_2\) and their applications
- Error-correcting codes and cryptography
This page was built for publication: Secret-sharing with a class of ternary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583097)
