Key storage in secure networks
From MaRDI portal
Publication:1113873
DOI10.1016/0166-218X(88)90068-6zbMath0661.94012OpenAlexW2088379485MaRDI QIDQ1113873
Fred C. Piper, Chris J. Mitchell
Publication date: 1988
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(88)90068-6
cryptographynetwork securityblock designssecure communicationskey managementfinite incidence structureskey distribution patternskey storage problem
Related Items (42)
Almost cover-free codes ⋮ SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS ⋮ On key storage in secure networks ⋮ On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks ⋮ Signal-flow-based analysis of wireless security protocols ⋮ On optimal cryptographic key derivation ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Unnamed Item ⋮ Constructions for key distribution patterns ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Asymptotic bounds for the rate of colored superimposed codes ⋮ Unnamed Item ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Generalized cover-free families. ⋮ Uniqueness of some optimal superimposed codes ⋮ Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks ⋮ Some new bounds for cover-free families ⋮ Cover-free codes and separating system codes ⋮ Almost cover-free codes and designs ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Bounds on the rate of separating codes ⋮ Incidence structures applied to cryptography ⋮ Threshold and Majority Group Testing ⋮ Some new bounds for cover-free families through biclique covers ⋮ Explicit constructions of perfect hash families from algebraic curves over finite fields ⋮ Bounds on the rate of disjunctive codes ⋮ Broadcast authentication for group communication ⋮ Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks ⋮ On the construction of \((w,r)\) cover-free codes ⋮ On \(\tau\)-time secure key agreement ⋮ Key distribution patterns using Minkowski planes ⋮ The Rise and Fall and Rise of Combinatorial Key Predistribution ⋮ Linear broadcast encryption schemes ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Multireceiver authentication codes: Models, bounds, constructions, and extensions ⋮ On the cardinality of intersection sets in inversive planes ⋮ Some constructions for key distribution patterns
Cites Work
This page was built for publication: Key storage in secure networks
