A threshold decryption scheme without session keys
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. (C) 2000 Elsevier Science Ltd. All rights reserved.
threshold scheme secret sharing cryptography