On the classification of ideal secret sharing schemes-Reference-Cited by-同舟云学术

On the classification of ideal secret sharing schemes

Published:1991-01 Issue:2 Volume:4 Page:123-134
ISSN:0933-2790
Container-title:Journal of Cryptology
language:en
Short-container-title:J. Cryptology

Author:

Brickell Ernest F.,Davenport Daniel M.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00196772.pdf

Reference12 articles.

1. J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In Advances in Cryptology-Crypto '88, New York, pp. 27–36, 1990.

2. G. R. Blakley. Safeguarding cryptographic keys. In Proceedings of the AFIPS 1979 National Computer Conference, vol. 48, pp. 313–317, 1979.

3. E. F. Brickell. Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing, 6:105–113, 1989.

4. M. Hall, Jr. Combinatorial Theory. Wiley, New York, 1986.

5. M. Ito, A. Saito, and T. Nishizeki. Secret sharing scheme realizing general access structure. In Proceedings of IEEE Globecom '87, Tokyo, pp. 99–102, 1987.

Cited by 199 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Representation of Lattice Path Matroids;Annals of Combinatorics;2024-08-29

2. On Boolean functions derived from linear maps over $$\mathbb {Z}_4$$ and their application to secret sharing;Designs, Codes and Cryptography;2024-08-16

3. Ideal uniform multipartite secret sharing schemes;Information Sciences;2024-01

4. Secret Sharing and Shamir Threshold Scheme;Encyclopedia of Cryptography, Security and Privacy;2024

5. Partial Secret Sharing Schemes;IEEE Transactions on Information Theory;2023-08