Verifiable secret sharing based on the Chinese remainder theorem

Authors

  • Lein Harn,

    1. Department of Computer Science and Electrical Engineering, University of Missouri, Kansas City, MO, U.S.A.
    Search for more papers by this author
  • Miao Fuyou,

    1. School of Computer Science and Technology, University of Science & Technology of China, China
    Search for more papers by this author
  • Chin-Chen Chang

    Corresponding author
    1. Department of Information Engineering and Computer Science, Feng Chia University, Taichung, Taiwan
    2. Department of Computer Science and Information Engineering, Asia University, Taichung, Taiwan
    • Correspondence: Chin-Chen Chang, Department of Computer Science and Information Engineering, Asia University, Taichung 413, Taiwan.

      E-mail: alan3c@gmail.com

    Search for more papers by this author

ABSTRACT

A (t,n) secret sharing scheme (SS) enables a dealer to divide a secret into n shares in such a way that (i) the secret can be recovered successfully with t or more than t shares, and (ii) the secret cannot be recovered with fewer than t shares. A verifiable secret sharing scheme (VSS) has been proposed to allow shareholders to verify that their shares are generated by the dealer consistently without compromising the secrecy of both shares and the secret. So far, there is only one secure Chinese remainder theorem-based VSS using the RSA assumption. We propose a Chinese remainder theorem-based VSS scheme without making any computational assumptions, which is a simple extension of Azimuth–Bloom (t,n) SS. Just like the most well-known Shamir's SS, the proposed VSS is unconditionally secure. We use a linear combination of both the secret and the verification secret to protect the secrecy of both the secret and shares in the verification. In addition, we show that no information is leaked when there are fewer than t shares in the secret reconstruction. Copyright © 2013 John Wiley & Sons, Ltd.

Ancillary