Abstract
By using threshold schemes, λ-decompositions were introduced by Stinson [D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory IT-40 (1994) 118–125] and used to achieve often optimal worst-case information rates of secret sharing schemes based on graphs. By using the broader class of ramp schemes, ( λ , ω ) -decompositions were introduced in [M. van Dijk, W.-A. Jackson, K.M. Martin, A general decomposition construction for incomplete secret sharing schemes, Des. Codes Cryptogr. 15 (1998) 301–321] together with a general theory of decompositions. However, no improvements of existing schemes have been found by using this general theory. In this contribution we show for the first time how to successfully use ( λ , ω ) -decompositions. We give examples of improved constructions of secret sharing schemes based on connected graphs on six vertices.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
