A combinatorial characterization of regular anonymous perfect threshold schemes

DOI10.1016/S0020-0190(02)00368-XMaRDI QIDQ1853687zbMATH OpenOpenAlexFDO

Authors 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 characterizationcombinatorial problemsdifference familyinformation securityregularthreshold scheme

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites work

• A Combinatorial Approach to Threshold Schemes
• How to share a secret
• scientific article; zbMATH DE number 446495 (Why is no real title available?)
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• scientific article; zbMATH DE number 874509 (Why is no real title available?)
• Orthogonal arrays. Theory and applications

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853687)