A non-interactive modular verifiable secret sharing scheme

We prove that the verifiable secret sharing scheme of C. Asmuth and J. Bloom (see IEEE Trans. Inform. Theory, vol.IT-29.547, p.208-10, 1983) is not realizable although their basic modular secret sharing scheme is efficient and perfect. An efficient non-interactive modular verifiable secret sharing scheme is proposed, based on their basic scheme. The verification needs about (2|q|n+(n-1))r multiplications. The secret recovery takes O(r) operations while A. Shamir's scheme (1979) takes O(r log/sup 2/ r) operations. It is also shown that the scheme is a perfect secret sharing scheme.

[1]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[2]  Tal Rabin,et al.  Simplified VSS and fast-track multiparty computations with applications to threshold cryptography , 1998, PODC '98.

[3]  Song Y. Yan,et al.  Elementary Number Theory , 2002 .

[4]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[5]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[6]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[8]  Chin-Chen Chang,et al.  An Improved Threshold Scheme Based on Modular ARithmetic , 1999, J. Inf. Sci. Eng..

[9]  Torben P. Pedersen.  Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing , 1991, CRYPTO.