Browsing by Author "Abdullahi, Muhammad Bashir"

Now showing 1 - 6 of 6
  • No Thumbnail Available
    Item
    A Reliable and Secure Distributed In-Network Data Storage Scheme in Wireless Sensor Networks
    (IEEE, 2011) Musau, Felix; Wang, Guojun; Abdullahi, Muhammad Bashir
    In a battlefield surveillance scenario, data readings and events emerging from a wireless sensor network deployed that may not be used immediately by or simply impossible to transmit to an authorized user (a Soldier) in real time are stored in the network. Without proper protection for the sensitive data generated in this setting, a compromised storage node (by an enemy soldier) may divulge its stored sensitive data about the monitored environment, and even worse, it may alter the data. In this paper, we integrate an elliptic curve cryptography scheme and an erasure coding scheme to provide reliable and secure distributed in-network data storage for sensor networks. The main idea is to distribute each erasure coded fragment appended with a fingerprint to different storage nodes. The fingerprint is to allow each coded data fragment to be independently verified as a valid and correct subset of a specific data item. So, the scheme achieves localization of data error. The proposed scheme is resilient to collusion attack, pollution attack, and data dropping attack, and guarantees forward and backward data secrecy as well. The security of the proposed scheme relies on the intractability of the elliptic curve discrete logarithm problem. Different from the existing solutions, the uniqueness of our method comes from the use of lightweight encryption scheme, which is well suited for resource constrained wireless sensors.
  • No Thumbnail Available
    Item
    Group formation with neighbor similarity trust in P2P E-commerce
    (Springer Linker, 2011) Musau, Felix; Wang, Guojun; Abdullahi, Muhammad Bashir
    The simplicity with which products and prices are compared in e-commerce has introduced an attractive option for many online merchants. The completion of online business transactions with personal information provisioning has always been an act that beckons hesitation. Most online traders are highly conscious of various threats and attacks such as credit card fraud, identity theft, spoofing, hacking, phishing, and other abuses, leading to low trust in online business transactions. Online transactions take place among Peer-to-Peer (P2P) systems at the edge of the Internet. Peer communities are often established dynamically with peers that are unrelated and unknown to each other. In our proposed mechanism, peers form groups in order to ensure trust and security. Each group is established based on interest among peers. In this paper, we show how peers form groups, and select group leaders. A peer can belong to more than one group. Comparing with some existing work, our work reveals that peers can have common neighbors which have a similarity based on their interest. Our simulation results show that the model can deal with the malicious attacks efficiently by comparison with existing models.
  • No Thumbnail Available
    Item
    Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce
    (IEEE International Conference on Autonomic and Trusted Computing, 2012) Musau, Felix; Wang, Guojun; Guo, Song; Abdullahi, Muhammad Bashir
    Peer to peer (P2P) e-commerce applications exist at the edge of the Internet with vulnerabilities to passive and active attacks. These attacks have pushed away potential business firms and individuals whose aim is to get the best benefit in e-commerce with minimal losses. The attacks occur during interactions between the trading peers as a transaction takes place. In this paper, we propose how to address Sybil attack, which is a kind of active attack. The peers can have bogus and multiple identity to fake their own ones. Most existing work, which concentrates on social networks and trusted certification, has not been able to prevent Sybil attack peers from participating in transactions. Our work exploits the neighbor similarity trust relationship to address Sybil attack. In this approach, referred to as SybilTrust, duplicated Sybil attack peers can be recognized as the neighbor peers become acquainted and hence more trusted to each other. Security and performance analysis shows Sybil attack can be minimized by our proposed neighbor similarity trust.
  • No Thumbnail Available
    Item
    Neighbor Similarity Trust against Sybil Attack in P2P E-Commerce
    (IEEE Transactions on Parallel and Distributed Systems (TPDS), 2015-03) Musau, Felix; Wang, Guojun; Guo, Song; Abdullahi, Muhammad Bashir
    Peer to peer (P2P) e-commerce applications exist at the edge of the Internet with vulnerabilities to passive and active attacks. These attacks have pushed away potential business firms and individuals whose aim is to get the best benefit in e-commerce with minimal losses. The attacks occur during interactions between the trading peers as a transaction takes place. In this paper, we propose how to address Sybil attack, an active attack, in which peers can have bogus and multiple identities to fake their owns. Most existing work, which concentrates on social networks and trusted certification, has not been able to prevent Sybil attack peers from doing transactions. Our work exploits the neighbor similarity trust relationship to address Sybil attack. In our approach, duplicated Sybil attack peers can be identified as the neighbor peers become acquainted and hence more trusted to each other. Security and performance analysis shows that Sybil attack can be minimized by our proposed neighbor similarity trust.
  • No Thumbnail Available
    Item
    Securing Recommendations in Grouped P2P E-Commerce Trust Model
    (IEEE Transactions on Network and Service Management, 2012-12) Musau, Felix; Wang, Guojun; Yu, Shui; Abdullahi, Muhammad Bashir
    In dynamic peer to peer (P2P) e-commerce, it is an important and difficult problem to promote online businesses without sacrificing the desired trust to secure transactions. In this paper, we address malicious threats in order to guarantee secrecy and integrity of recommendations exchanged among peers in P2P e-commerce. In addition to trust, secret keys are required to be established between each peer and its neighbors. Further, we propose a key management approach gkeying to generate six types of keys. Our work mainly focuses on key generation for securing recommendations, and ensuring the integrity of recommendations. The proposed approach presented with a security and performance analysis, is more secure and more efficient in terms of communication cost, computation cost, storage cost, and feasibility.
  • No Thumbnail Available
    Item
    Similarity Formation of Groups and Key Management in Dynamic Peer to Peer E-commerce.
    (IEEE, 2011) Musau, Felix; Abdullahi, Muhammad Bashir
    The ease of shopping and comparing products and prices online has made it an attractive option for many shoppers. When it comes to time to enter personal information or complete a business transaction on the Internet, most people hesitate, and understandably so. They've read about credit card fraud, identity theft, spoofing, hacking, phishing and other abuses. These business transactions take place among peer to peer systems at the edge of the internet. In peer-to-peer environments, a peer needs to interact with unknown entities. In the method proposed, the peers form groups in order to ensure security. Each group is based on interest among the peers and has its own way of operation. The paper gives a clear outline of how peers form groups, select group leaders. Peers can belong to more than one group to a maximum of n groups hence exempt a similarity behavior. This paper also addresses the distribution and management of keys among the peers