Key storage in secure networks

Mitchell, Chris J.; Piper, Fred

doi:10.1016/0166-218x(88)90068-6

Cited by 149 publications

(72 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…An interesting compromise between these two trivial solutions is the idea of a w-key distribution pattern (KDP ) [12]. A w-KDP is an allocation of keys to nodes with the property that:…”

Section: The Rise and Fall Of Combinatorial Key Predistributionmentioning

confidence: 99%

The Rise and Fall and Rise of Combinatorial Key Predistribution

Martin

2011

Selected Areas in Cryptography

View full text Add to dashboard Cite

Abstract. There are many applications of symmetric cryptography where the only realistic option is to predistribute key material in advance of deployment, rather than provide online key distribution. The problem of how most effectively to predistribute keys is inherently combinatorial. We revisit some early combinatorial key predistribution shemes and discuss their limitations. We then explain why this problem is back "in fashion" after a period of limited attention by the research community. We consider the appropriateness of combinatorial techniques for key distribution and identify potential areas of further research.

show abstract

“…An interesting compromise between these two trivial solutions is the idea of a w-key distribution pattern (KDP ) [12]. A w-KDP is an allocation of keys to nodes with the property that:…”

Section: The Rise and Fall Of Combinatorial Key Predistributionmentioning

confidence: 99%

The Rise and Fall and Rise of Combinatorial Key Predistribution

Martin

2011

Selected Areas in Cryptography

View full text Add to dashboard Cite

show abstract

“…The applications employing preloaded subsets range from discovery of shared secrets for pairwise communications [16] - [23], and more general group communications [22], [24], and broadcast authentication [26], [27], [28]. While the earlier methods based on preloaded subsets favored deterministic allocation of keys to nodes [29] (most of them perhaps motivated by Erdos et. al's seminal work on intersections of finite sets [25]), Dyer et al [27] was perhaps the first to point out the advantages of random allocation of subsets.…”

Section: Random Key Pre-distribution Schemesmentioning

confidence: 99%

On Broadcast Encryption with Random Key Pre-distribution Schemes

Ramkumar

2005

Information Systems Security

View full text Add to dashboard Cite

Broadcast encryption (BE) deals with the problem of establishing a secret, shared by g = G − r privileged nodes, among a set G nodes. Specifically, a set of r revoked nodes are denied access to the secret. Many schemes to address this problem, based on key pre-distribution schemes (KPS), have been proposed in the literature. Most state-ofthe-art methods employ tree-based techniques. However, random key pre-distribution schemes (RKPS), which have received a lot of attention in the recent past (especially in the context of ad hoc and sensor network security), also cater for BE. In this paper we analyze the performance of BE using RKPSs. While in most tree-based methods the source of the broadcast is assumed to be the root of the tree (unless asymmetric cryptographic primitives can be used), BE using RKPSs caters for BE by peers -without the need for asymmetric cryptography. Furthermore, unlike most BE schemes where the identities of the revoked nodes have to be explicitly specified, 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.

show abstract

“…Stinson et al [37] discusses relations between these structures. We choose the language of cover-free families since they have found multiple applications in cryptography (see [20,26,36] for examples).…”

Section: Nonadaptive Group Testing With Cover-free Familiesmentioning

confidence: 99%

Group Testing and Batch Verification

Zaverucha

Stinson

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We observe that finding invalid signatures in batches of signatures that fail batch verification is an instance of the classical group testing problem. We present and compare new sequential and parallel algorithms for finding invalid signatures based on group testing algorithms. Of the five new algorithms, three show improved performance for many parameter choices, and the performance gains are especially notable when multiple processors are available.

show abstract

Key storage in secure networks

Cited by 149 publications

References 2 publications

The Rise and Fall and Rise of Combinatorial Key Predistribution

The Rise and Fall and Rise of Combinatorial Key Predistribution

On Broadcast Encryption with Random Key Pre-distribution Schemes

Group Testing and Batch Verification

Contact Info

Product

Resources

About