Abstract
In the present study, a new threshold decryption scheme is proposed, which allows confidential messages to be encrypted in t-out-of- n shared secret schemes. Whenever the number of participants from the group is larger than or equal to a predetermined threshold value t, the confidential message can be obtained. There are three advantages of the present scheme. The first advantage is that both the key distribution and generation is not required in the present scheme, the second is that the scheme can efficiently encrypt large secret files or messages and the third is that other cryptosystems for enciphering/deciphering confidential messages are not needed.
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 callDisclaimer: 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.
