Secret-sharing with a class of ternary codes (Q1583097)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1521656
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Secret-sharing with a class of ternary codes |
scientific article; zbMATH DE number 1521656 |
Statements
Secret-sharing with a class of ternary codes (English)
0 references
26 October 2000
0 references
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.
0 references
group character codes
0 references
secret sharing
0 references
cryptography
0 references
0.91081226
0 references
0.90208536
0 references
0.8985847
0 references
0 references
0.88890946
0 references
0 references
0.88135576
0 references
0 references
0.8771272
0 references
