Applying Hash Functions in the Latin Square Based Secret Sharing Schemes
暂无分享,去创建一个
[1] J. Seberry,et al. Secret sharing schemes arising from latin squares , 1994 .
[2] Wade Trappe,et al. Introduction to Cryptography with Coding Theory , 2002 .
[3] Charles J. Colbourn. The complexity of completing partial Latin squares , 1984, Discret. Appl. Math..
[4] Jennifer Seberry,et al. Latin squares: critical sets and their lower bounds , 1995 .
[5] Jennifer Seberry,et al. Secret Sharing Schemes Based on Room Squares , 1996, DMTCS.
[6] Douglas R. Stinson,et al. Cryptography: Theory and Practice , 1995 .
[7] John Kelsey,et al. Herding Hash Functions and the Nostradamus Attack , 2006, EUROCRYPT.
[8] Ralph C. Merkle,et al. One Way Hash Functions and DES , 1989, CRYPTO.
[9] Paul Feldman,et al. A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[10] Ivan Damgård,et al. A Design Principle for Hash Functions , 1989, CRYPTO.
[11] Jennifer Seberry,et al. Reusing Shares in Secret Sharing Schemes , 1994, Comput. J..
[12] G. R. BLAKLEY. Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).
[13] Adi Shamir,et al. How to share a secret , 1979, CACM.
[14] P. Hall. On Representatives of Subsets , 1935 .
[15] Jennifer Seberry,et al. Perfect Secret Sharing Schemes from Room Squares , 1998 .