Corpus ID: 12198447

I-HARPS: An Efficient Key Pre-distribution Scheme

@article{Ramkumar2005IHARPSAE,
  title={I-HARPS: An Efficient Key Pre-distribution Scheme},
  author={M. Ramkumar},
  journal={IACR Cryptol. ePrint Arch.},
  year={2005},
  volume={2005},
  pages={138}
}
  • M. Ramkumar
  • Published 2005
  • Computer Science
  • IACR Cryptol. ePrint Arch.
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 improvement is achieved by increasing insecurestorage complexity (for example using external flash memory). The proposed scheme is a combination of the Kerberos-like key distribution scheme (KDS) proposed by Leighton and Micali, and random key pre-distribution schemes based on subset intersections. We… Expand
Non-Centralized Key Pre-Distribution in Computer Networks
  • Alexander Frolov, I. Shchurov
  • Computer Science
  • 2008 Third International Conference on Dependability of Computer Systems DepCoS-RELCOMEX
  • 2008
TLDR
The technology of confidential connections in a computer network using key information pre-distributed independently and may be simultaneously in its segments or domains is proposed and the modification of Kerberos-type protocol is considered. Expand
Probabilistic synthesis of KDP satisfying mutually complementary correctness conditions
On the basis of probabilistic estimates and computer experiments with application of probabilistic algorithms of synthesis of key distribution patterns in a computer network, it is shown that aExpand

References

SHOWING 1-10 OF 53 REFERENCES
An efficient random key pre-distribution scheme
  • M. Ramkumar, N. Memon
  • Computer Science
  • IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.
  • 2004
TLDR
It is argued that random KPD schemes, in general, perform an "advantageous" trade-off which renders them more suitable for practical large scale deployments of resource constrained nodes. Expand
A hierarchical key pre-distribution scheme
We present an efficient, scalable, and renewable hierarchical random key predistribution (KPD) scheme as an enabler for a low complexity security infrastructure. As the proposed KPD scheme employsExpand
Safe renewal of a random key pre-distribution scheme for trusted devices
  • M. Ramkumar
  • Computer Science
  • Proceedings from the Sixth Annual IEEE SMC Information Assurance Workshop
  • 2005
TLDR
The author address issues involved in safe renewal of a recently proposed random key pre-distribution scheme, HARPS (hashed random preloaded subsets) (Ramkumar, et al., 2005). Expand
A matrix key-distribution scheme
TLDR
A new key-distribution scheme is presented that lets each node have a set of keys of which it shares a distinct subset with every other node that has the advantage that the numbers of keys that must be generated is proportional to the number of nodes. Expand
A pairwise key pre-distribution scheme for wireless sensor networks
TLDR
This paper proposes a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes, and exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes are affected is close to zero. Expand
Random key predistribution schemes for sensor networks
TLDR
The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation. Expand
An Optimal Class of Symmetric Key Generation Systems
  • R. Blom
  • Computer Science
  • EUROCRYPT
  • 1984
TLDR
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
Some New Results on Key Distribution Patterns and Broadcast Encryption
This paper concerns methods by which a trusted authority can distribute keys and/or broadcast a message over a network, so that each member of a privileged subset of users can compute a specified keyExpand
Pre-loaded key based multicast and broadcast authentication in mobile ad-hoc networks
  • M. Ramkumar, Nasir Menon
  • Computer Science
  • GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)
  • 2003
TLDR
This paper introduces a novel key management scheme, RPS - random preloaded subset key distribution - which satisfies all the stringent requirements on primitives that could be used to secure mobile ad hoc networks. Expand
Secret Key Agreement without Public-Key Cryptography
TLDR
This project focuses primarily on Leighton and Micali's secret-key agreement without the use of public-key encryption techniques, which is extremely efficient when implemented in software and has significant advantages over existing systems like Kerberos. Expand
...
1
2
3
4
5
...