Podrobná bibliografie
| Název: |
Multisecret-sharing schemes and bounded distance decoding of linear codes. |
| Autoři: |
Çalkavur, Selda, Solé, Patrick |
| Zdroj: |
International Journal of Computer Mathematics; Jan2017, Vol. 94 Issue 1, p107-114, 8p |
| Témata: |
ERROR-correcting codes, CRYPTOGRAPHY, LINEAR codes, DECODING algorithms, COALITIONS |
| Abstrakt: |
Error-correcting codes are used to correct errors when messages are transmitted through a noisy communication channel. Bounded distance decoding (i.e. decoding up to the error-correcting capacity) is a method of correcting errors that guarantees unique decoding. Secret sharing is a cryptographic protocol that allows a secret known from a person called the dealer to be distributed tonparticipants. No single participant knows the secret but some special subsets of participants called coalitions can. In this paper, we present a multisecret-sharing scheme based on an error-correcting code where secret reconstruction is made by using bounded distance decoding of the code. This scheme is ideal in the sense that the size of each secret equals the size of any share. Its security improves on that of multisecret-sharing schemes. [ABSTRACT FROM PUBLISHER] |
|
Copyright of International Journal of Computer Mathematics is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Full Text Finder 
Nájsť tento článok vo Web of Science