Premium
A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets
Author(s) -
Liu Yanjun,
Harn Lein,
Chang ChinChen
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2760
Subject(s) - verifiable secret sharing , computer science , secret sharing , secrecy , computer security , chinese remainder theorem , cryptography , scheme (mathematics) , secure multi party computation , extension (predicate logic) , theoretical computer science , arithmetic , algorithm , mathematics , set (abstract data type) , programming language , mathematical analysis
Summary Verifiable secret sharing (VSS) has been extensively used as a cryptographic tool in many applications of information security in recent years. A VSS enables a dealer to divide a secret s into n shares and allows shareholders to verify whether their shares are generated by the dealer consistently without revealing the secrecy of both shares and the secret. More specifically, shareholders can verify that (i) the secret can be recovered by any t or more than t shares and (ii) the secret cannot be obtained by fewer than t shares. Many VSSs are based on polynomial, and only a few of them are based on the Chinese Remainder Theorem (CRT). Recently, Harn et al . proposed a CRT‐based VSS in which multiple verification secrets are used during the phase of verification. In this paper, we propose a VSS based on Asmuth‐Bloom's ( t, n ) SS scheme, which depends on the CRT. Our proposed VSS is simpler and more efficient than the scheme of Harn et al . Our proposed VSS is unconditionally secure. Copyright © 2014 John Wiley & Sons, Ltd.