This paper investigates the problem of sharing the secret document containing a secret data betwe... more This paper investigates the problem of sharing the secret document containing a secret data between leader and participant(s) depending on specific conditions and rules. The participant(s) can retrieve part of the secret document but will not be able to retrieve any secret data without the leader. At the same time, the leader may have a little information about the secret document but cannot retrieve the secret data and the secret document without cooperating with participant(s). To evaluate the proposed model and the system efficiency, four tests are suggested, which are concatenation and sharing data test, leader visual test, information entropy analysis, and correlation analysis. Results show that the proposed model is efficient in sharing the data between the leader and participant(s) and the model can achieve our concept of the data sharing between leader and participant(s). However, by analyzing the proposed model using numerical tests and visual tests, the results show that t...
2012 18th Ieee International Conference on Networks, 2012
Previous works on the network coding focused on applying cryptographic theorems on wireless and w... more Previous works on the network coding focused on applying cryptographic theorems on wireless and wired network to protect the network from the malicious packets. In this paper a new framework to create a trust model between the sink node and the source node is proposed, in which the new framework used a logistic map chaotic model within the trust approach to increase the uncertainty in the generated values. The main idea of this model is to send the chaotic code within each packet, so the sink can validate if the packet is accepted or not depending on the received code. The proposed model is divided into two phases: startup phase to initial the connection between two ends and running phase to start trust sending and trust routing to the packets. For the trust routing, new model is suggested to route the packet to the sink node and to change the status of the coding nodes. Two theoretical models are suggested to describe the behaviour of the proposed framework as follow: the knowledge packets model and the energy consumption model. After evaluating and analyzing the proposed framework using different scenarios and cases, the proposed system shows that it can achieve low overhead, low traffic, and will maximize the lifetime of the system.
2011 7th International Wireless Communications and Mobile Computing Conference, Jul 4, 2011
We consider the problem of intelligent mobile target detection in a mobile sensor network, where ... more We consider the problem of intelligent mobile target detection in a mobile sensor network, where targets have higher sensing ranges and speeds than the sensors. (i) We propose novel algorithms for the sensors to detect targets with larger sensing ranges and speeds than the sensors. Also, our algorithms can achieve much faster detection for the targets than the most recent
Image sharing has become a prominent field in large and small networks. However, in order to deli... more Image sharing has become a prominent field in large and small networks. However, in order to deliver the shares to their respective shareholders, we need a secure channel to protect the shares from potential attacks by other users on the network. These users can locate the shares and retrieve the image using the Lagrange interpolation method if they are able to locate the minimum required number of shares. This paper proposes a method to protect the privacy and security of the shares when sending them through unsecured channels. The proposed method is divided into three phases. In the first phase, image pixels are changed using the column and row indices, then the shares are created using Shamir’s secret sharing (SSS) method. Then a relationship is created between the shares using a linear independence function. In the second phase, the first part of the image is encrypted to hide the solver data. Finally, in the third phase, the data is shared using the SSS method. Participants can retrieve the whole image by applying the reverse order of the proposed method using only the information from the sender through the same channel. The simulation results show that the proposed method is efficient and robust against different types of attacks and can be used to send the shares over unsecured channels.
International Journal of Advanced Research in Computer Science and Electronics Engineering, Nov 28, 2013
In this paper, a new approach to protect the mobile phones from the proximity attacks in the smal... more In this paper, a new approach to protect the mobile phones from the proximity attacks in the small environment (university campus) is proposed, where the environment is divided into clusters, in each cluster there is one access point; to collect the information from the phones. Moreover, to apply the proposed system each phone in the environment should contain two tables, which are: signature table and blacklist table. The signature table is used to store the signature of the malware, where the blacklist table is used to store the attacker phones ID in the environment. These tables will be updated from the access point after creating a trust between two sides in the same cluster. However, to evaluate and to validate the proposed approach, an evaluation program written in the Microsoft C#.net is used. The evaluation tests show that the proposed approach can stop the attacker from propagating the malware in the mobile phone network and can stop the signature pool problem.
This paper investigates the problem of sharing the secret document containing a secret data betwe... more This paper investigates the problem of sharing the secret document containing a secret data between leader and participant(s) depending on specific conditions and rules. The participant(s) can retrieve part of the secret document but will not be able to retrieve any secret data without the leader. At the same time, the leader may have a little information about the secret document but cannot retrieve the secret data and the secret document without cooperating with participant(s). To evaluate the proposed model and the system efficiency, four tests are suggested, which are concatenation and sharing data test, leader visual test, information entropy analysis, and correlation analysis. Results show that the proposed model is efficient in sharing the data between the leader and participant(s) and the model can achieve our concept of the data sharing between leader and participant(s). However, by analyzing the proposed model using numerical tests and visual tests, the results show that t...
2012 18th Ieee International Conference on Networks, 2012
Previous works on the network coding focused on applying cryptographic theorems on wireless and w... more Previous works on the network coding focused on applying cryptographic theorems on wireless and wired network to protect the network from the malicious packets. In this paper a new framework to create a trust model between the sink node and the source node is proposed, in which the new framework used a logistic map chaotic model within the trust approach to increase the uncertainty in the generated values. The main idea of this model is to send the chaotic code within each packet, so the sink can validate if the packet is accepted or not depending on the received code. The proposed model is divided into two phases: startup phase to initial the connection between two ends and running phase to start trust sending and trust routing to the packets. For the trust routing, new model is suggested to route the packet to the sink node and to change the status of the coding nodes. Two theoretical models are suggested to describe the behaviour of the proposed framework as follow: the knowledge packets model and the energy consumption model. After evaluating and analyzing the proposed framework using different scenarios and cases, the proposed system shows that it can achieve low overhead, low traffic, and will maximize the lifetime of the system.
2011 7th International Wireless Communications and Mobile Computing Conference, Jul 4, 2011
We consider the problem of intelligent mobile target detection in a mobile sensor network, where ... more We consider the problem of intelligent mobile target detection in a mobile sensor network, where targets have higher sensing ranges and speeds than the sensors. (i) We propose novel algorithms for the sensors to detect targets with larger sensing ranges and speeds than the sensors. Also, our algorithms can achieve much faster detection for the targets than the most recent
Image sharing has become a prominent field in large and small networks. However, in order to deli... more Image sharing has become a prominent field in large and small networks. However, in order to deliver the shares to their respective shareholders, we need a secure channel to protect the shares from potential attacks by other users on the network. These users can locate the shares and retrieve the image using the Lagrange interpolation method if they are able to locate the minimum required number of shares. This paper proposes a method to protect the privacy and security of the shares when sending them through unsecured channels. The proposed method is divided into three phases. In the first phase, image pixels are changed using the column and row indices, then the shares are created using Shamir’s secret sharing (SSS) method. Then a relationship is created between the shares using a linear independence function. In the second phase, the first part of the image is encrypted to hide the solver data. Finally, in the third phase, the data is shared using the SSS method. Participants can retrieve the whole image by applying the reverse order of the proposed method using only the information from the sender through the same channel. The simulation results show that the proposed method is efficient and robust against different types of attacks and can be used to send the shares over unsecured channels.
International Journal of Advanced Research in Computer Science and Electronics Engineering, Nov 28, 2013
In this paper, a new approach to protect the mobile phones from the proximity attacks in the smal... more In this paper, a new approach to protect the mobile phones from the proximity attacks in the small environment (university campus) is proposed, where the environment is divided into clusters, in each cluster there is one access point; to collect the information from the phones. Moreover, to apply the proposed system each phone in the environment should contain two tables, which are: signature table and blacklist table. The signature table is used to store the signature of the malware, where the blacklist table is used to store the attacker phones ID in the environment. These tables will be updated from the access point after creating a trust between two sides in the same cluster. However, to evaluate and to validate the proposed approach, an evaluation program written in the Microsoft C#.net is used. The evaluation tests show that the proposed approach can stop the attacker from propagating the malware in the mobile phone network and can stop the signature pool problem.
Uploads
Papers by hazem alnajjar