A new secret sharing scheme from linear code

Author(s):  
Ding Yuan ◽  
Rong-Sheng Huang
2016 ◽  
Vol 27 (05) ◽  
pp. 595-605 ◽  
Author(s):  
Xianfang Wang ◽  
Jian Gao ◽  
Fang-Wei Fu

In principle, every linear code can be used to construct a secret sharing scheme. However, determining the access structure of the scheme is a very difficult problem. In this paper, we study MacDonald codes over the finite non-chain ring [Formula: see text], where p is a prime and [Formula: see text]. We provide a method to construct a class of two-weight linear codes over the ring. Then, we determine the access structure of secret sharing schemes based on these codes.


Author(s):  
Ting Liu ◽  
Zhe Cui ◽  
Hongquan Pu ◽  
Jintao Rao

The article for the journal Recent Advances in Electrical and Electronic Engineering has been withdrawn on the request of the authors due to some technical errors in the article. Bentham Science apologizes to the readers of the journal for any inconvenience this may cause. BENTHAM SCIENCE DISCLAIMER: It is a condition of publication that manuscripts submitted to this journal have not been published and will not be simultaneously submitted or published elsewhere. Furthermore, any data, illustration, structure or table that has been published elsewhere must be reported, and copyright permission for reproduction must be obtained. Plagiarism is strictly forbidden, and by submitting the article for publication the authors agree that the publishers have the legal right to take appropriate action against the authors, if plagiarism or fabricated information is discovered. By submitting a manuscript the authors agree that the copyright of their article is transferred to the publishers if and when the article is accepted for publication.


Sign in / Sign up

Export Citation Format

Share Document