A non-interactive modular verifiable 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.