234 research outputs found
A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
These days, with the emergence of the concept of ubiquitous computing, sensor networks that collect, analyze and process all the information through the sensors have become of huge interest. However, sensor network technology fundamentally has wireless communication infrastructure as its foundation and thus has security weakness and limitations such as low computing capacity, power supply limitations and price. In this paper, and considering the characteristics of the sensor network environment, we propose a group key agreement method using a keyset pre-distribution of two-dimension arrays that should minimize the exposure of key and personal information. The key collision problems are resolved by utilizing a polygonal shape’s center of gravity. The method shows that calculating a polygonal shape’s center of gravity only requires a very small amount of calculations from the users. The simple calculation not only increases the group key generation efficiency, but also enhances the sense of security by protecting information between nodes
Reduction in adolescent depression after contact with mental health services: a longitudinal cohort study in the UK
Background: Evidence regarding the association between service contact and subsequent mental health in adolescents is scarce, and previous findings are mixed. We aimed to longitudinally assess the extent to which depressive symptoms in adolescents change after contact with mental health services. Methods: As part of a longitudinal cohort study, between April 28, 2005, and March 17, 2010, we recruited 1238 14-year-old adolescents and their primary caregivers from 18 secondary schools in Cambridgeshire, UK. Participants underwent follow-up assessment at months 18 and 36. Trained researchers assessed the adolescents for current mental disorder using the Schedule for Affective Disorders and Schizophrenia for School-Age Children Present and Lifetime version (K-SADS-PL). Caregivers and adolescents reported contact with mental health services in the year before baseline. Adolescents self-reported depressive symptoms (Mood and Feelings Questionnaire [MFQ]) at each timepoint. We assessed change in MFQ sum scores from baseline contact with mental health services using multilevel mixed-effects regression adjusted for sociodemographic, environmental, individual, and mental health confounders, with multiple imputation of missing data. We used propensity score weighting to balance confounders between treatment (users of mental health services) and control (non-users of mental health services) groups. We implemented an MFQ clinical cutoff following the results of receiver operating characteristic analysis. Findings: 14-year-old adolescents who had contact with mental health services in the past year had a greater decrease in depressive symptoms than those without contact (adjusted coefficient −1·68, 95% CI −3·22 to −0·14; p=0·033). By age 17 years, the odds of reporting clinical depression were higher in individuals without contact than in service users who had been similarly depressed at baseline (adjusted odds ratio 7·38, 1·73–31·50; p=0·0069). Interpretation: Our findings show that contact with mental health services at age 14 years by adolescents with a mental disorder reduced the likelihood of depression by age 17 years. This finding supports the improvement of access to adolescent mental health services.This study was funded by The Wellcome Trust (grant number 074296), and the National Institute for Health Research Collaboration for Leadership in Applied Health Research & Care for Cambridgeshire and Peterborough
A Key Establishment Scheme for Mobile Wireless Sensor Networks Using Post-Deployment Knowledge
Establishment of pairwise keys between sensor nodes in a sensor network is a
difficult problem due to resource limitations of sensor nodes as well as
vulnerability to physical captures of sensor nodes by the enemy. Public-key
cryptosystems are not much suited for most resource-constrained sensor
networks. Recently, elliptic curve cryptographic techniques show that public
key cryptosystem is also feasible for resource-constrained sensor networks.
However, most researchers accept that the symmetric key cryptosystems are
viable options for resource-constrained sensor networks. In this paper, we
first develop a basic principle to address the key pre-distribution problem in
mobile sensor networks. Then, using this developed basic principle, we propose
a scheme which takes the advantage of the post-deployment knowledge. Our scheme
is a modified version of the key prioritization technique proposed by Liu and
Ning. Our improved scheme provides reasonable network connectivity and
security. Moreover, the proposed scheme works for any deployment topology.Comment: Published in International Journal of Computer Networks &
Communications (IJCNC) Vol.3, No.4, July 201
Secure and Privacy-Preserving Data Aggregation Protocols for Wireless Sensor Networks
This chapter discusses the need of security and privacy protection mechanisms
in aggregation protocols used in wireless sensor networks (WSN). It presents a
comprehensive state of the art discussion on the various privacy protection
mechanisms used in WSNs and particularly focuses on the CPDA protocols proposed
by He et al. (INFOCOM 2007). It identifies a security vulnerability in the CPDA
protocol and proposes a mechanism to plug that vulnerability. To demonstrate
the need of security in aggregation process, the chapter further presents
various threats in WSN aggregation mechanisms. A large number of existing
protocols for secure aggregation in WSN are discussed briefly and a protocol is
proposed for secure aggregation which can detect false data injected by
malicious nodes in a WSN. The performance of the protocol is also presented.
The chapter concludes while highlighting some future directions of research in
secure data aggregation in WSNs.Comment: 32 pages, 7 figures, 3 table
An Identity Based Key Management Scheme in Wireless Sensor Networks
Pairwise key establishment is one of the fundamental security services in
sensor networks which enables sensor nodes in a sensor network to communicate
securely with each other using cryptographic techniques. It is not feasible to
apply traditional public key management techniques in resource-constrained
sensor nodes, and also because the sensor nodes are vulnerable to physical
capture. In this paper, we introduce a new scheme called the identity based key
pre-distribution using a pseudo random function (IBPRF), which has better
trade-off between communication overhead, network connectivity and resilience
against node capture compared to the other key pre-distribution schemes. Our
scheme can be easily adapted in mobile sensor networks. This scheme supports
the addition of new sensor nodes after the initial deployment and also works
for any deployment topology. In addition, we propose an improved version of our
scheme to support large sensor networks.Comment: 7 pages, Published in Proceedings of 4th Asian International Mobile
Computing Conference (AMOC 2006), Kolkata, India, pp. 70-76, January 4-7,
200
Reliability of Authenticated Key Establishment Protocols in a Complex Sensor System
Griffith Sciences, School of Information and Communication TechnologyFull Tex
How to Specify and How to Prove Correctness of Secure Routing Protocols for MANET
Secure routing protocols for mobile ad hoc networks have been developed
recently, yet, it has been unclear what are the properties they achieve, as a
formal analysis of these protocols is mostly lacking. In this paper, we are
concerned with this problem, how to specify and how to prove the correctness of
a secure routing protocol. We provide a definition of what a protocol is
expected to achieve independently of its functionality, as well as
communication and adversary models. This way, we enable formal reasoning on the
correctness of secure routing protocols. We demonstrate this by analyzing two
protocols from the literature
- …