The following pages link to Key storage in secure networks (Q1113873):
Displaying 46 items.
- Signal-flow-based analysis of wireless security protocols (Q385716) (← links)
- On optimal cryptographic key derivation (Q388109) (← links)
- Cover-free codes and separating system codes (Q510467) (← links)
- Almost cover-free codes and designs (Q510471) (← links)
- On the construction of \((w,r)\) cover-free codes (Q734287) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- Incidence structures applied to cryptography (Q1199628) (← links)
- Some constructions for key distribution patterns (Q1321567) (← links)
- Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. (Q1426451) (← links)
- Generalized cover-free families. (Q1428544) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Constructions for key distribution patterns (Q1692698) (← links)
- Bounds on the rate of separating codes (Q1752294) (← links)
- Some new bounds for cover-free families through biclique covers (Q1759404) (← links)
- Key distribution patterns using Minkowski planes (Q1804981) (← links)
- Linear broadcast encryption schemes (Q1811106) (← links)
- Bounds for key distribution patterns (Q1819120) (← links)
- Multireceiver authentication codes: Models, bounds, constructions, and extensions (Q1854288) (← links)
- On the cardinality of intersection sets in inversive planes (Q1865389) (← links)
- On key storage in secure networks (Q1903344) (← links)
- Some new bounds for cover-free families (Q1976329) (← links)
- Encrypted key-value stores (Q2152022) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Almost cover-free codes (Q2364463) (← links)
- A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
- Threshold behavior of multi-path random key pre-distribution for sparse wireless sensor networks (Q2450522) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Key pre-distribution in a non-uniform rectangular grid for wireless sensor networks (Q2511446) (← links)
- On \(\tau\)-time secure key agreement (Q2515458) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- The Rise and Fall and Rise of Combinatorial Key Predistribution (Q3084246) (← links)
- SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES (Q3166740) (← links)
- UNCONDITIONALLY SECURE CONFERENCE KEY DISTRIBUTION: SECURITY NOTIONS, BOUNDS AND CONSTRUCTIONS (Q3173476) (← links)
- Using encryption for authentication in large networks of computers (Q4168037) (← links)
- New constructions for perfect hash families and related structures using combinatorial designs and codes (Q4487082) (← links)
- Threshold and Majority Group Testing (Q4915253) (← links)
- Asymptotic bounds for the rate of colored superimposed codes (Q5121240) (← links)
- (Q5146114) (← links)
- (Q5150557) (← links)
- On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks (Q5323004) (← links)
- (Q5866327) (← links)
- Explicit constructions of perfect hash families from algebraic curves over finite fields (Q5929836) (← links)
- Broadcast authentication for group communication (Q5958610) (← links)
- Improved upper bounds for the rate of separating and completely separating codes (Q6173461) (← links)
- A survey of cover-free families: constructions, applications, and generalizations (Q6613366) (← links)
