Abstract
On the basis of the properties of the Jordan matrix, we proposed a secret sharing scheme which can realize both the (t,n) threshold and the adversary structure and share a large secret while each participant has a short share. At the same time, the scheme can prevent the participants from cheating. The shares can be kept secret in the process of reconstruction and do not need to be renewed when the shared secret is changed. If n participants want to share a large secret using a short share such that t or more participants can reconstruct the shared secret and there are some subsets that each contain at least t participants that cannot reconstruct the shared secret, our scheme will be effective.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
