poster

A constrained random perturbation vector-based pairwise key establishment scheme for wireless sensor networks

Authors:

Chia-Mu Yu,

Ting-Yun Chi,

Chun-Shien Lu,

Sy-Yen KuoAuthors Info & Claims

MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

Pages 449 - 450

https://doi.org/10.1145/1374618.1374681

Published: 26 May 2008 Publication History

Get Access

Abstract

This paper presents a Constrained Random Perturbation Vector-based (CRPV) pairwise key establishment scheme and its variant, CRPV+ scheme, for wireless sensor networks (WSNs). Compared to all existing schemes which satisfy only some requirements in a so-called versatileness criteria, the CRPV+ scheme meets all requirements. In particular, the performance improvement of our schemes does not rely on tradeoffs among different requirements, but comes from the use of our constrained random vector strategy.

References

[1]

R. Blom, "An optimal class of symmetric key generation systems," EUROCRYPT, 1984.

Digital Library

Google Scholar

[2]

W. Zhang, M. Tran, S. Zhu, and G. Cao, "A random perturbation-based scheme for pairwise key establishment in sensor networks," ACM MobiHoc, 2007.

Digital Library

Google Scholar

[3]

homepage.ntu.edu.tw/~d95921015/MobiHoc08.pdf

Google Scholar

Cited By

View all

Yu CLu CKuo S(2018)Noninteractive pairwise key establishment for sensor networksIEEE Transactions on Information Forensics and Security10.1109/TIFS.2010.20501405:3(556-569)Online publication date: 25-Dec-2018
https://dl.acm.org/doi/10.1109/TIFS.2010.2050140
Kellner AAlfandi OHogrefe D(2012)A Survey on Measures for Secure Routing in Wireless Sensor NetworksInternational Journal of Sensor Networks and Data Communications10.4303/ijsndc/2355481(1-17)Online publication date: 2012
https://doi.org/10.4303/ijsndc/235548
Nikounia SAmin FJahangir A(2009)A lightweight key establishment scheme for wireless sensor networksProceedings of the 3rd international conference on New technologies, mobility and security10.5555/1790343.1790398(286-290)Online publication date: 20-Dec-2009
https://dl.acm.org/doi/10.5555/1790343.1790398
Show More Cited By

Index Terms

A constrained random perturbation vector-based pairwise key establishment scheme for wireless sensor networks
1. Networks
  1. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

A random perturbation-based scheme for pairwise key establishment in sensor networks
MobiHoc '07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing

A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes have been proposed in recent years, most of them have no guarantee for ...
Group-based key predistribution for wireless sensor networks

Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected ...
Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools

Sensor nodes are tiny, low-power, computationally limited and battery constrained electromechanical devices. A sensor node contains a sensing unit and a wireless communication unit. Sensor nodes are deployed over a field for sensing an event data in the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing

May 2008

474 pages

ISBN:9781605580739

DOI:10.1145/1374618

General Chair:
Xiaohua Jia
City University of Hong Kong, Hong Kong
,
Program Chairs:
Ness B. Shroff
Ohio State University, USA
,
Peng-Jun Wan
Illinois Institute of Technology, USA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 May 2008

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Poster

Conference

MobiHoc08

Sponsor:

MobiHoc08: The Ninth ACM International Symposium on Mobile Ad Hoc Networking and Computing

May 26 - 30, 2008

Hong Kong, Hong Kong, China

Acceptance Rates

Overall Acceptance Rate 296 of 1,843 submissions, 16%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
250
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yu CLu CKuo S(2018)Noninteractive pairwise key establishment for sensor networksIEEE Transactions on Information Forensics and Security10.1109/TIFS.2010.20501405:3(556-569)Online publication date: 25-Dec-2018
https://dl.acm.org/doi/10.1109/TIFS.2010.2050140
Kellner AAlfandi OHogrefe D(2012)A Survey on Measures for Secure Routing in Wireless Sensor NetworksInternational Journal of Sensor Networks and Data Communications10.4303/ijsndc/2355481(1-17)Online publication date: 2012
https://doi.org/10.4303/ijsndc/235548
Nikounia SAmin FJahangir A(2009)A lightweight key establishment scheme for wireless sensor networksProceedings of the 3rd international conference on New technologies, mobility and security10.5555/1790343.1790398(286-290)Online publication date: 20-Dec-2009
https://dl.acm.org/doi/10.5555/1790343.1790398
Yu CLu CKuo S(2009)A constrained function based message authentication scheme for sensor networksProceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference10.5555/1688345.1688728(2180-2185)Online publication date: 5-Apr-2009
https://dl.acm.org/doi/10.5555/1688345.1688728
Yu CLu CKuo S(2009)A Constrained Function Based Message Authentication Scheme for Sensor Networks2009 IEEE Wireless Communications and Networking Conference10.1109/WCNC.2009.4917492(1-6)Online publication date: Apr-2009
https://doi.org/10.1109/WCNC.2009.4917492
Nikounia SAmin FJahangir A(2009)A Lightweight Key Establishment Scheme for Wireless Sensor Networks2009 3rd International Conference on New Technologies, Mobility and Security10.1109/NTMS.2009.5384737(1-5)Online publication date: Dec-2009
https://doi.org/10.1109/NTMS.2009.5384737

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A random perturbation-based scheme for pairwise key establishment in sensor networks

Group-based key predistribution for wireless sensor networks

Simple, extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools