Verifiable secret sharing schemes based on non-homogeneous linear recursions and elliptic curves
暂无分享,去创建一个
[1] Dieter Gollmann,et al. Secret Sharing with Reusable Polynomials , 1997, ACISP.
[2] Tatsuaki Okamoto,et al. New Public-Key Schemes Based on Elliptic Curves over the Ring Zn , 1991, CRYPTO.
[3] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .
[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] Martin Tompa,et al. How to share a secret with cheaters , 1988, Journal of Cryptology.
[6] Rong Zhao,et al. A practical verifiable multi-secret sharing scheme , 2007, Comput. Stand. Interfaces.
[7] 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).
[8] Douglas R. Stinson,et al. Cryptography: Theory and Practice,Second Edition , 2002 .
[9] Zhenfu Cao,et al. A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme , 2005, Appl. Math. Comput..
[10] Chin-Chen Chang,et al. An on-line secret sharing scheme for multi-secrets , 1998, Comput. Commun..
[11] L. Harn. Efficient sharing (broadcasting) of multiple secrets , 1995 .
[12] Massoud Hadian Dehkordi,et al. An efficient threshold verifiable multi-secret sharing , 2008, Comput. Stand. Interfaces.
[13] Min-Shiang Hwang,et al. A (t, n) multi-secret sharing scheme , 2004, Appl. Math. Comput..