Secret-sharing with a class of ternary codes
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. In this paper, we describe a secret-sharing scheme based on a class of ternary codes (Ding et al. IEEE Tra...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/96090 http://hdl.handle.net/10220/9822 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| id |
sg-ntu-dr.10356-96090 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-960902023-02-28T19:32:35Z Secret-sharing with a class of ternary codes Kohel, David R. Ding, Cunsheng Ling, San School of Physical and Mathematical Sciences DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory 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. In this paper, we describe a secret-sharing scheme based on a class of ternary codes (Ding et al. IEEE Trans. Inform. Theory IT-46 (2000) 280–284). We determine the access structure and prove properties of the secret-sharing scheme. Accepted version 2013-04-18T03:27:27Z 2019-12-06T19:25:28Z 2013-04-18T03:27:27Z 2019-12-06T19:25:28Z 2000 2000 Journal Article Ding, C., Kohel, D. R., & Ling, S. (2000). Secret-sharing with a class of ternary codes. Theoretical Computer Science, 246(1-2), 285-298. 0304-3975 https://hdl.handle.net/10356/96090 http://hdl.handle.net/10220/9822 10.1016/S0304-3975(00)00207-3 en Theoretical computer science © 2000 Elsevier Science B.V. This is the author created version of a work that has been peer reviewed and accepted for publication by Theoretical Computer Science, Elsevier Science B.V. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: [http://dx.doi.org/10.1016/S0304-3975(00)00207-3]. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory |
| spellingShingle |
DRNTU::Engineering::Computer science and engineering::Data::Coding and information theory Kohel, David R. Ding, Cunsheng Ling, San Secret-sharing with a class of ternary codes |
| description |
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. In this paper, we describe a secret-sharing scheme based on a class of ternary codes (Ding et al. IEEE Trans. Inform. Theory IT-46 (2000) 280–284). We determine the access structure and prove properties of the secret-sharing scheme. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Kohel, David R. Ding, Cunsheng Ling, San |
| format |
Article |
| author |
Kohel, David R. Ding, Cunsheng Ling, San |
| author_sort |
Kohel, David R. |
| title |
Secret-sharing with a class of ternary codes |
| title_short |
Secret-sharing with a class of ternary codes |
| title_full |
Secret-sharing with a class of ternary codes |
| title_fullStr |
Secret-sharing with a class of ternary codes |
| title_full_unstemmed |
Secret-sharing with a class of ternary codes |
| title_sort |
secret-sharing with a class of ternary codes |
| publishDate |
2013 |
| url |
https://hdl.handle.net/10356/96090 http://hdl.handle.net/10220/9822 |
| _version_ |
1759853837458341888 |