论文信息 - Ideal Secret Sharing Schemes from Permutations

Ideal Secret Sharing Schemes from Permutations

The work presents a new method for the design of ideal secret sharing. The method uses regular mappings that are well suited for construction of perfect secret sharing. The restriction of regular mappings to permutations gives a convenient tool for investigation of the relation between permutations and ideal secret sharing generated by them.

Xian-Mo Zhang | Josef Pieprzyk | J. Pieprzyk | Xian-Mo Zhang

[1] Yvo Desmedt,et al. Threshold Cryptosystems , 1989, CRYPTO.

[2] Ernest F. Brickell,et al. Some Ideal Secret Sharing Schemes , 1990, EUROCRYPT.

[3] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[4] Ronald Cramer,et al. Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups , 2002, CRYPTO.

[5] Josh Benaloh,et al. Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[6] Mitsuru Ito,et al. Secret sharing scheme realizing general access structure , 1989 .

[7] Ernest F. Brickell,et al. On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.

[8] G. R. Blakley,et al. Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[9] Ernest F. Brickell,et al. Some improved bounds on the information rate of perfect secret sharing schemes , 2006, Journal of Cryptology.

[10] Yvo Desmedt,et al. Perfect Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group , 1994, SIAM J. Discret. Math..

[11] Adi Shamir,et al. How to share a secret , 1979, CACM.