Key Establishment Algorithms for Some Deterministic Key Predistribution Schemes

Sushmita Ruj; Bimal Roy

Research.Publish.Connect.

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Key Establishment Algorithms for Some Deterministic Key Predistribution Schemes

In Proceedings of the 6th International Workshop on Security in Information Systems - Volume 0ICEIS, 68-77, 2008 , Barcelona, Spain

Authors: Sushmita Ruj and Bimal Roy

Affiliation: Applied Statistics Unit, Indian Statistical Institute, India

Abstract: Key establishment is a major problem in sensor networks because of resource constraints. Several key predistribution schemes have been discussed in literature. Though the key predistribution algorithms have been described very well in these papers, no key establishment algorithm has been presented in some of them. Without efficient key establishment algorithm the key predistribution schemes are incomplete. We present efficient shared-key discovery algorithms for some known deterministic key predistribution schemes. Our algorithms run in O(1) and O( ∛N) time and the communication overhead is at most O(log √N) bits, where N is the size of the network. The efficient key establishment schemes make deterministic key predistribution an attractive option over randomized schemes.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 13.59.113.226

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Ruj, S. and Roy, B. (2008). Key Establishment Algorithms for Some Deterministic Key Predistribution Schemes. In Proceedings of the 6th International Workshop on Security in Information Systems (ICEIS 2008) - WOSIS; ISBN 978-989-8111-44-9, SciTePress, pages 68-77. DOI: 10.5220/0001729900680077

@conference{wosis08,
author={Sushmita Ruj. and Bimal Roy.},
title={Key Establishment Algorithms for Some Deterministic Key Predistribution Schemes},
booktitle={Proceedings of the 6th International Workshop on Security in Information Systems (ICEIS 2008) - WOSIS},
year={2008},
pages={68-77},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001729900680077},
isbn={978-989-8111-44-9},
}

TY - CONF

JO - Proceedings of the 6th International Workshop on Security in Information Systems (ICEIS 2008) - WOSIS
TI - Key Establishment Algorithms for Some Deterministic Key Predistribution Schemes
SN - 978-989-8111-44-9
AU - Ruj, S.
AU - Roy, B.
PY - 2008
SP - 68
EP - 77
DO - 10.5220/0001729900680077
PB - SciTePress