Search

As we are becoming a digital society, it is very important for us to protect the security of personal identity in any transactions. One of the efforts to maintain the security of personal identity is by unrevealed our data more than necessary. Anonymous credential allows an organization to give a credential to a user. This credential consists of user attribute such as address and date of birth. By using this credential, the user can prove the ownership to the third party without revealing the information that contained in credential information more than necessary. This paper proposes secure ehealth system that focuses on proving protocol to reveal and prove some of the patient attributes while others remain hidden, so the security of personal identity more awake. The experimental results showed that the computational time of each proving protocol less than 1 second.

Tracking a mobile node using wireless sensor network (WSN) under cooperative system among anchor node and mobile node, has been discussed in this work, interested to the indoor positioning applications. Developing an indoor location tracking system based on received signal strength indicator (RSSI) of WSN is considered cost effective and the simplest method. The suitable technique for estimating position out of RSSI measurements is the extended Kalman filter (EKF) which is especially used for non linear data as RSSI. In order to reduce the estimated errors from EKF algorithm, this work adopted forward data processing of the EKF algorithm to improve the accuracy of the filtering output, its called iterated extended Kalman filter (IEKF). However, using IEKF algorithm should know the stopping criterion value that is influenced to the maximum number iterations of this system. The number of iterations performed will be affected to the computation time although it can improve the estimation position. In this paper, we propose modified IEKF for mobile cooperative tracking system within only 4 iterations number. The ilustrated results using RSSI measurements and simulation in MATLAB show that our propose method have capability to reduce error estimation percentage up to 19.3% , with MSE (mean square error) 0.88 m compared with conventional IEKF algorithm with MSE 1.09 m. The time computation perfomance of our propose method achived in 3.55 seconds which is better than adding more iteration process.

Wireless sensor networks in internet of thing era have many applications, one of them for environment system, in environmental monitoring system everybody can access data anytime and anywhere. Information was collected using wireless sensor network, all of the data will be sent and stored in the data center. All of data in the data center can be accessed by users through HTTP protocol using a laptop, smartphone and Personal computer. The data in the data center must be secured and the data should be protected from the illegal access by the users from the environment monitoring. To secure the data from the illegal access by the user then the environment monitoring required a security with revocation aspect and encryption the data. CP-ABE (Ciphertext-Policy Attribute-Based Encryption) becomes a solution for this issue, to protect the sensor data and revoke the user. We propose a secure system using CP-ABE with user revocation for protecting the data in data center. Our system is not only encrypting the data sensor, but also revoke to the user. Our experiments system using CP-ABE showed the result for secure the sensor data and revoked the user who does not have the access rights. there are only 2 second processing time for revocation check users.

In wireless sensor networks (WSNs), information carried in data sensor is very important for everyone, especially for critical data such as disaster warning, location based in military, and other high-risk data. Wireless Body Area Network (WBAN) which informs data sensor of body status, such as blood pressure, electrocardiogram, air-flow of breathing, body temperature, patient position and falls, galvanic skin response, etc. as well as environment conditions such as humidity, gases, noise, etc. Such data sensor should be transferred through wireless to the data center server securely and can be easily accessed by everyone at anytime and anywhere. However, data exchange in WSNs has a big possibility to be illegally intercepted by many threats and attacks. Hence, security mechanism would be desirable to address the problem. In fact, sensor nodes usually have low power, low performance and limited resources. In this paper, we propose a security system in WSN for e-healthcare system that satisfies confidentiality, authenticity, and data integrity with consideration on low overhead of cryptographic computation. Our experimental results showed that total computation time for cryptographic is about 3.61 seconds on Waspmote ATmegal281 microcontroller 14MHz.

Wireless Sensor Network (WSN) have emerged as an important area for research and development because of their application such as in e-healthcare monitoring system. This paper presents and discusses the performance of slotted and unslotted Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol WSN for medical system, with a few additions to the protocol and adequate tuning parameters. Performance of slotted and unslotted protocol CSMA/CA were evaluated and analyzed for different network configurations to understand the impact of protocol parameters such as Superframe Order (SO), Beacon Order (BO), Backoff Exponent (BE), and Maximum Backoff Exponent (maxBE). Network performances Quality of Service (QoS) are analyzed, namely Throughput, Power Consumption, Average Delay, and Packet Success Probability. The proposed work is implemented in Network Simulator 2 (NS2). The performance of the protocol CSMA/CA was evaluated for WSN star topology. The simulation results show that of unslotted CSMA/CA is better than slotted CSMA/CA in terms of the packet success probability, energy consumption, and delay. While slotted CSMA/CA is better than unslotted CSMA/CA in term of throughput.

We present an implementation of Zero Forcing (ZF) equalizer in OFDM scheme using Software Defined Radio platform whereas NI USRP-2920 as the Radio Frequency (RF) front-end. ZF equalizer is employed to achieve reliable system at the receiver. Center frequency used for data transmission is 915 MHz. The reliability transmission and the performance of ZF equalizer are measured in term of different symbol mapping (i.e., M-PSK and M-QAM). The IQ rate determines the bandwidth available, whereas good performance is achieved with IQ rate less than 1 MHz.ZF equalizer achieves good performance when using BPSK, QPSK and 16-QAM modulation techniques. By applying ZF equalizer, bit error on BPSK and QPSK modulations can be reduced from 29,16% and 39,06% into 0%. This advantage of ZF equalizer also is able to press the bit error on 16- QAM and 64-QAM modulations into 3,125% and 8,85%, respectively.Keywords: OFDM,SDR, USRP,Zero Forcing Equalizer

Today, information technology is growing rapidly,all information can be obtainedmuch easier. It raises some new problems; one of them is unauthorized access to the system. We need a reliable network security system that is resistant to a variety of attacks against the system. Therefore, Intrusion Detection System (IDS) required to overcome the problems of intrusions. Many researches have been done on intrusion detection using classification methods. Classification methodshave high precision, but it takes efforts to determine an appropriate classification model to the classification problem. In this paper, we propose a new reinforced approach to detect intrusion with On-line Clustering using Reinforcement Learning. Reinforcement Learning is a new paradigm in machine learning which involves interaction with the environment.It works with reward and punishment mechanism to achieve solution. We apply the Reinforcement Learning to the intrusion detection problem with considering competitive learning using Pursuit Reinforcement Competitive Learning (PRCL). Based on the experimental result, PRCL can detect intrusions in real time with high accuracy (99.816% for DoS, 95.015% for Probe, 94.731% for R2L and 99.373% for U2R) and high speed (44 ms).The proposed approach can help network administrators to detect intrusion, so the computer network security systembecome reliable.Keywords: Intrusion Detection System, On-Line Clustering, Reinforcement Learning, Unsupervised Learning.

An anonymous credential system allows the user to convince a verifier of the possession of a certificate issued by the issuing authority anonymously. One of the applications is the privacy-enhancing electronic ID (eID). A previously proposed anonymous credential system achieves constant complexity in the number of finite-set attributes of the user. However, the system is based on the RSA. In this paper, we show how to achieve the constant complexity in a pairing-based anonymous credential system excluding the RSA. The key idea of the construction is the use of a pairing-based accumulator. The accumulator outputs a constant-size value from a large set of input values. Using zero-knowledge proofs of pairing-based certificates and accumulators, we can prove AND and OR relations with constant complexity in the number of finite-set attributes.