On key storage in secure networks

DOI10.1007/BF00191355zbMath0840.94015WikidataQ56324040 ScholiaQ56324040MaRDI QIDQ1903344

Martin Dyer, Trevor I. Fenner, Andrew G. Thomason, Alan M. Frieze

Publication date: 1995

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

zbMATH Keywords

keysprobabilistic constructionsecure networks

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

On optimal cryptographic key derivation, Linear Time Constructions of Some $$d$$-Restriction Problems, Constructions for key distribution patterns, Unnamed Item, Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels., Generalized cover-free families., Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks, Some new bounds for cover-free families, Chameleon — A new kind of stream cipher, Explicit constructions of perfect hash families from algebraic curves over finite fields, Broadcast authentication for group communication, Linear broadcast encryption schemes, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, Unnamed Item, Multireceiver authentication codes: Models, bounds, constructions, and extensions

Cites Work

• Unnamed Item
• Unnamed Item
• A matrix key-distribution scheme
• Families of finite sets in which no set is covered by the union of \(r\) others
• Key storage in secure networks
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Families of finite sets in which no set is covered by the union of two others