# A matrix key-distribution scheme

@article{Gong2005AMK, title={A matrix key-distribution scheme}, author={L. Gong and D. J. Wheeler}, journal={Journal of Cryptology}, year={2005}, volume={2}, pages={51-59} }

A new key-distribution scheme is presented. It is based on the distinctive idea that lets each node have a set of keys of which it shares a distinct subset with every other node. This has the advantage that the numbers of keys that must be generated is proportional to the number of nodes. Moreover, two nodes can start a session with virtually no delay. The scheme suits an environment where there is a certain level of trust among the insiders. The security property to an outsider remains… Expand

#### Figures from this paper

#### 76 Citations

A unified model for unconditionally secure key distribution

- Computer Science
- J. Comput. Secur.
- 2006

This paper presents a model for unconditionally secure key distribution schemes, i.e., schemes whose security is independent of the power of the adversary, and proves lower bounds on the amount of information the trusted party has to generate and each user has to keep secret in such schemes. Expand

Perfectly-secure Dynamic-conference Key Distribution Extended Abstract

A conference key (key) distribution scheme is a method to distribute some pieces of information among a set of users is such a way each group (pair) of users can compute a common key to use for… Expand

SKAIT: A Parameterized Key Assignment Scheme for Wireless Networks

- Computer Science
- 2010 Ninth International Symposium on Parallel and Distributed Computing
- 2010

SKAIT is proposed, a parameterized symmetric key pre-distribution scheme that guarantees a secure and confidential channel between every pair of nodes in a wireless network and allows users to trade increased key space complexity for improved collusion resistance. Expand

Space-Efficient Keying in Wireless Communication Networks

- Computer Science
- 2007

This paper proposes a key assignment scheme that assigns at most [log n]2 keys to each node, where n is the number of nodes in the network, and is the most efficient secureKey assignment scheme in terms of space that has been proposed so far. Expand

Space-Efficient Keying in Wireless Communication Networks

- Computer Science
- Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2007)
- 2007

This paper proposes a key assignment scheme that assigns at most [log n]2 keys to each node, where n is the number of nodes in the network, and is the most efficient secureKey assignment scheme in terms of space that has been proposed so far. Expand

A key-chain-based keying scheme for many-to-many secure group communication

- Computer Science
- TSEC
- 2004

A novel secure group keying scheme using hash chain for many-to-many secure group communication and is suitable for applications where the population of a system is stable, group size is moderate, subgroup formation is frequent, and the application is delay sensitive. Expand

I-HARPS: An Efficient Key Pre-distribution Scheme

- Computer Science
- IACR Cryptol. ePrint Arch.
- 2005

We introduce an efficient random key pre-distribution scheme (RKPS) whose performance is 2 to 3 orders of magnitudebetter than schemes of comparable complexity in the literature. This dramatic… Expand

On Broadcast Encryption with Random Key Pre-distribution Schemes

- Computer Science
- ICISS
- 2005

Unlike most BE schemes, BE using RKPSs allow for protecting the identities of the revoked nodes, which could be a useful property in application scenarios where privacy is a crucial issue. Expand

A Family of Efficient Key Predistribution Schemes for Pairwise Authentication

- Computer Science
- 2007 IEEE SMC Information Assurance and Security Workshop
- 2007

This work introduces a class of simple scalable KPSs with several compelling advantages over other K PSs in the literature. Expand

On the security of random key pre-distribution schemes

- Computer Science
- Proceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004.
- 2004

It is argued that a "limited extent of tamper-resistance" when used in conjunction with a mechanism for "periodic key updates", drastically improves the security of (especially random) KPD schemes. Expand

#### References

SHOWING 1-6 OF 6 REFERENCES

An Optimal Class of Symmetric Key Generation Systems

- Computer Science
- EUROCRYPT
- 1984

The objective of this paper is to present a class of SKGS for which the amount of secret information needed by each user to generate his keys is the least possible while at the same time a certain minimum number of users have to cooperate to resolve the uncertainty of unknown keys. Expand

Security Mechanisms in High-Level Network Protocols

- Computer Science
- CSUR
- 1983

The implications of adding security mechanisms to high-level network protocols operating in an open-system environment are analyzed, and a brief description of the two basic approaches to communications security, link-oriented measures and end-to-end measures concludes that end- to- end measures are more appropriate in anopen- system environment. Expand

Using encryption for authentication in large networks of computers

- Computer Science
- CACM
- 1978

Use of encryption to achieve authenticated communication in computer networks is discussed. Example protocols are presented for the establishment of authenticated connections, for the management of… Expand

Generation, Distribution, and Installation of Cryptographic Keys

- Computer Science
- IBM Syst. J.
- 1978

This paper discusses possible key generation, distribution, and installation procedures for the key management scheme presented in the preceding paper. Expand

New directions in cryptography

- Computer Science
- IEEE Trans. Inf. Theory
- 1976

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing. Expand