A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes
暂无分享,去创建一个
[1] G. R. Blakley,et al. Secret Sharing Schemes , 2011, Encyclopedia of Cryptography and Security.
[2] Ehud D. Karnin,et al. On secret sharing systems , 1983, IEEE Trans. Inf. Theory.
[3] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[4] M. Harada. A Generalization of the Simmons' Bounds on Secret-Key Authentication Systems , 2000 .
[5] Ueli Maurer,et al. Authentication theory and hypothesis testing , 2000, IEEE Trans. Inf. Theory.
[6] Adi Shamir,et al. How to share a secret , 1979, CACM.
[7] Kaoru Kurosawa,et al. Optimum Secret Sharing Scheme Secure against Cheating , 1996, EUROCRYPT.
[8] Satoshi Obana,et al. Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution , 2006, ASIACRYPT.
[9] Hirosuke Yamamoto,et al. Coding theorems for secret-key authentication systems , 1998, 1998 Information Theory Workshop (Cat. No.98EX131).
[10] R. J. McEliece,et al. On sharing secrets and Reed-Solomon codes , 1981, CACM.
[11] Gustavus J. Simmons,et al. Authentication Theory/Coding Theory , 1985, CRYPTO.
[12] Martin Tompa,et al. How to share a secret with cheaters , 1988, Journal of Cryptology.
[13] Richard E. Blahut,et al. Principles and practice of information theory , 1987 .