Abstract
AbstractIn the history of secret sharing schemes many constructions are based on geometric objects. In this paper we investigate generalizations of threshold schemes and related finite geometric structures. In particular, we analyse compartmented and hierarchical schemes, and deduce some more general results, especially bounds for special arcs and novel constructions for conjunctive 2-level and 3-level hierarchical schemes.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference21 articles.
1. Ball S., De Beule J.: On sets of vectors of a finite vector space in which every subset of basis size is a basis II. Des. Codes Cryptogr. 65, 5–14 (2012).
2. Beutelspacher A., Wettl F.: On 2-level secret sharing. Des. Codes Cryptogr. 3, 127–134 (1993).
3. Blakley G.R.: Safeguarding cryptographic keys. Proc. Natl. Compd. Conf. 48, 313–317 (1979).
4. Blakley E.F., Kabatianskii G.A.: Linear algebra approach to secret sharing schemes. Error Control, Cryptology, and Speech Compression LNCS 829, 33–40 (1994).
5. Brickell E.F.: Some ideal secret sharing schemes. J. Comb. Math. Comb. Comp. 9, 105–113 (1989).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献