Bounds for key distribution patterns

DOI10.1007/S001459900054MaRDI QIDQ1819120zbMATH OpenOpenAlexFDO

Authors Kathleen A. S. Quinn

Publication date 24 September 2000

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s001459900054

zbMATH Keywords

key distribution patternssecure networks

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Few Steiner systems \(S(3,k,v)\) are KDPs
• Key storage in secure networks
• Constructions for key distribution patterns
• Some constructions for key distribution patterns
• Key distribution patterns using tangent circle structures

Cited in

(15)

• Few Steiner systems \(S(3,k,v)\) are KDPs
• Key storage in secure networks
• A Review of Secret Key Distribution Based on Bounded Observability
• Binary representations of underdetermined data and superimposed codes
• Some new bounds for cover-free families
• On key storage in secure networks
• Some constructions of mutually orthogonal Latin squares and superimposed codes
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Tree-Based Key Distribution Patterns
• Advances in Cryptology - ASIACRYPT 2003
• Constructions for key distribution patterns
• Steiner key distribution patterns
• Key distribution patterns using tangent circle structures
• Uniqueness of some optimal superimposed codes
• Bounds and constructions for key distribution schemes

This page was built for publication: Bounds for key distribution patterns

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