Research Reports

Permanent URI for this collectionhttp://dl.cerist.dz/handle/CERIST/34

Browse

Has files: YesSubject: search.filters.subject.Security

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    A Lightweight Key Management Scheme for E-health applications in the context of Internet of Things
    (CERIST, 2014-03-15) Abdmeziem, Riad; Tandjaoui, Djamel
    In the context of Internet of Things where real world objects will automatically be part of the Internet, ehealth applications have emerged as a promising approach to provide unobtrusive support for elderly and frail people based on their situation and circumstances. However, due to the limited resource available in such systems and privacy concerns that might rise from the capture of personal data, security issues constitute a major obstacle to their deployment. Authentication of the different entities involved and data confidentiality constitute the main concerns for users that need to be addressed. In this paper, we propose a new key management scheme for an ehealth application to allow sensors and the Base Station (BS) to negotiate certain security credentials that will be used to protect the information flow. Our prtocol provides a strong level of security guaranteeing authentication and data confidentiality while the scarcity of resources is taken into consideration. The scheme is based on a lightweight Public Key Infrastructure (PKI) where the sensors have to perform only one Elliptic Curve Cryptography (ECC) decryption in the key establishment process. Data exchanges are then secured by the use of symmetric encryption. In addition, Time Stamps are used to prevent replay attacks along with Message Code Authentication (MAC) to ensure integrity.
  • Thumbnail Image
    Item
    Securing Distance Vector Routing Protocols for Hybrid Wireless Mish Networks
    (CERIST, 2010-04) Babakhouya, Abdelaziz; Challal, Yacine; Bouabdallah, Abdelmadjid; Gharout, Said
    Hybrid Wireless Mesh Networks (HWMNs) are currently emerging as a promising technology for a wide range of applications such as public safety, emergency response, and disaster recovery operations. HWMNs combine the concepts of mesh networks and ad hoc networks to maintain network connectivity. Routing is essential for HWMN in order to discover the network topology and built routes. The problem of all the current ad hoc routing protocols is that they trust all nodes and assume that they behave properly; therefore they are more vulnerable to nodes misbehavior. Misbehaving nodes can advertise incorrect routing information and disturb the topology building process. This attack is difficult to detect in distance vector routing protocols since nodes have no information regarding the network topology beyond the immediate neighbors. In this paper we propose a Consistency Check protocol for Distance Vector routing in HWMN environment. Our Consistency Check protocol can detect and reject false routes under the assumption that some mesh routers are trusted and do not cheat. Trough security analysis and simulation, we show that our approach is resilient to false accusation attacks while inducing an acceptable routing overhead.
  • Thumbnail Image
    Item
    Efficient Monitoring Mechanisms for Cooperative Storage in Mobile Ad-Hoc Networks : Detection Time and Accuracy Tradeoffs
    (CERIST, 2009-02) Derhab, Abdelouahid; Senouci, Mustapha Reda; Badache, Nadjib
    Distributed cooperative storage systems are designed to share the storage resources of network nodes for the common good of everyone, especially in dynamic ad hoc networks (MANETs) where the risk of data loss is high. In ad hoc networks, as mobile nodes operate on low-power battery and use limited storage capacity, data holders might behave selfishly by discarding some data they promised to store for other nodes in order to optimize their storage space for their own usage. To detect such a behavior, a monitoring mechanism, which checks whether a data is still held by the data holder, must be used. In this paper, we propose novel monitoring mechanisms that consider MANETs constraints and overcome the limitations of the existing monitors. Simulation results show that the proposed mechanism can o er a good trade-off between the rate of false positives and the time to detect misbehaved nodes.