A combinatorial characterization of regular anonymous perfect threshold schemes

DOI10.1016/S0020-0190(02)00368-XzbMath1011.68065OpenAlexW2062749206MaRDI QIDQ1853687

Ying Miao

Publication date: 22 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00368-x

zbMATH Keywords

combinatorial problemsdifference familyregularinformation securitythreshold schemecombinatorial characterization

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (1)

Extremal properties of \(t\)-SEEDs and recursive constructions

Cites Work

• Orthogonal arrays. Theory and applications
• How to share a secret
• A Combinatorial Approach to Threshold Schemes
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A combinatorial characterization of regular anonymous perfect threshold schemes