On the Security of the Threshold Scheme Based on the Chinese Remainder Theorem
暂无分享,去创建一个
Bart Preneel | Michaël Quisquater | Joos Vandewalle | B. Preneel | J. Vandewalle | Michaël Quisquater
[1] Dana Ron,et al. Chinese remaindering with errors , 2000, IEEE Trans. Inf. Theory.
[2] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[3] P. Ribenboim. The Book of Prime Number Records , 1988 .
[4] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.
[5] Maurice Mignotte,et al. How to Share a Secret? , 1982, EUROCRYPT.
[6] Douglas R. Stinson,et al. A Combinatorial Approach to Threshold Schemes , 1987, SIAM J. Discret. Math..
[7] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..
[8] R. Gallager. Information Theory and Reliable Communication , 1968 .
[9] John Bloom,et al. A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.