Title :
A non-interactive modular verifiable secret sharing scheme
Author :
Qiong, Li ; Zhifang, Wang ; Niu Xiamu ; Shenghe, Sun
Author_Institution :
Inf. Countermeasure Technique Inst., Harbin Inst. of Technol., China
Abstract :
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 log2 r) operations. It is also shown that the scheme is a perfect secret sharing scheme.
Keywords :
cryptography; cryptography; information security; key safeguarding scheme; modular secret sharing scheme; noninteractive secret sharing scheme; verifiable secret sharing scheme; Cryptography; Equations; Galois fields; Information security; Interpolation; Mathematics; Polynomials; Sun; Variable structure systems;
Conference_Titel :
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN :
0-7803-9015-6
DOI :
10.1109/ICCCAS.2005.1493367
