JISE


  [1] [2] [3] [4] [5] [6] [7] [8]


Journal of Information Science and Engineering, Vol. 15 No. 5, pp. 691-699


An Improved Threshold Scheme Based On Modular Arithmetic

Ren-Junn Hwang and Chin-Chen Chang+
Department of Computer Science and Information Engineering 
Chung Cheng Institute of Technology 
Taoyuan, Taiwan 335, R.O.C. 
+Department of Computer Science and Information Engineering 
National Chung Cheng University 
Chiayi, Taiwan 621, R.O.C.

    An efficient threshold scheme is proposed in this paper. It overcomes the weakness of Asmuth et al.'s scheme. The (r, n)-threshold scheme proposed below only takes O(r) operations to recover the shared secret while Shamir's scheme takes O(rlog2r) operations. We show that our scheme is perfect. Further, we also propose a method to generate a pairwise relatively prime integer set which satisfies the requirements of Asmuth et al.'s and our schemes.

Keywords: Chinese remainder theorem, cryptography, key safeguarding, secret sharing, threshold scheme

  Retrieve PDF document (JISE_199905_05.pdf)