Earticle

Since 2004, several user authentication schemes purpose to provide user anonymity in wireless communication have been announced, however, many of them failed to provide user anonymity, actually. In 2011, Li and Lee proposed a secure user authentication scheme for wireless communications. Differently from the previous researches, Li and Lee claimed two more session keys to enhance entire security of the scheme. However, to fulfil their claim, Li and Lee adopted Diffie-Hellman key agreement method in their scheme, and it required plenty of resources. Thus, in this paper, we point out inefficiency of Li and Lee’s scheme and propose a more efficient user authentication scheme for wireless communications.

E-cash enables consumers to spend e-coin anonymously in information system, but unconditional anonymity of E-cash may be misused by malicious user, therefore fair E-cash was put forward. In fair E-cash system, the anonymity of customer can be revoked when e-coins are involved in crimes, and e-coin can be traced also. However, it is challenging work that providing a practical and complete tracing E-cash scheme. After pointing out some unpractical or incomplete designs in existing schemes, we present a practical scheme with complete tracing, including trusted authority’s unconditional tracing, bank’s repeat-spending tracing and loss-coin tracing which is neglected in prior schemes. Moreover, for resolving efficiency problem of complete fair tracing, we design a nested structure of signature of knowledge in payment protocol, which has an obvious efficiency advantage comparing with conventional signature of knowledge. Then we provide proofs of all security attributes of our E-cash system, and compare our scheme with some current schemes in efficiency. Our original design of nested structure of knowledge proof will also make other applications of knowledge-controllable-leak more efficient.

Radio Frequency Identification (RFID) tags, due to their ability to uniquely identify every individual item and low cost, are well suited for supply chain management and are expected to replace barcodes in the near future. However, unlike barcodes, these tags have a longer range in which they are allowed to be scanned, subjecting them to unauthorized scanning by malicious readers and to various other attacks, including cloning attacks. Privacy and security concerns inhibit the fast adaption of RFID technology for many applications. A number of authentication protocols that address these concerns have been proposed but real-world solutions that are secure and maintain low communication cost are still needed and being investigated. Recently, Cho et al. proposed a hash-based RFID mutual authentication protocol using a secret value. However, this paper shows that Cho et al.’s protocol is weak against desynchronization attack and proposes a remedy mutual authentication protocol, which offers a high level of security based on hash operation with synchronized secret. The protocol is applicable to resource, power and computationally constraint platforms such as RFID tags. Our investigation shows that it can provide mutual authentication and untraceability as well as resistance to replay, denial-of-service and man-in-the-middle attacks, while retaining a competitive computation cost.

PMIPv6 has received considerable attention between telecommunications and the Internet communities and does not require active participation of the Mobile Node (MN) by way of network-based mobility management. In this paper, we are proposing a novel 3S scheme for building Scalable, Secure, and Seamless PMIPv6 domains. In the proposed scheme, all of the Mobility Access Gateways (MAGs) are acting as the Local Mobility Anchor (LMA) combining a virtual ring with another MAG. General hashing is used in the efficient distribution-mapping between each MN and the MN’s LMA for all MAGs. Also, the MAG and the MN are authenticated using the symmetric key. Through mathematical analysis, we verify the safety, scalability, and seamless service for 3S. Furthermore, we propose a handover procedure of 3S, which demonstrates its superiority over the existing schemes in terms of handover latency.

Simplest-Lightweight Authentication Protocol (SLAP) is one of the recent mutual authentication protocols for lightweight RFID environment. However, server impersonation attack can be launched on the aforementioned protocol. The main goal of this paper is to comprehensively verify the security weakness of SLAP. This paper also propose an alternative mutual authentication protocol which proven to be secure and convenient for lightweight RFID environment. The proposed protocol is verified by a security protocol verier, AVISPA, and benchmarked against the original SLAP. The results show that the proposed protocol has the comparable capability with SLAP in preventing known attacks and simultaneously removes the known security weakness on SLAP.

The inflation often impacts the economy of a country such as China, and then the inflation can decrease the corporate investment. In this paper, the affecting relationship between the inflation and the corporate investments of the listed corporations in the Chinese stock market was modeled. After analyzing various factors of the investment decisions in this model, we tested the data of the companies, which traded in the Shanghai and Shenzhen stock exchange markets from January 1, 2004 to September 30, 2012. The calculation results show that the inflation and the corporate investments are significantly negatively correlated. When the inflation increased, the corporate investments decreased. However, the decline of income tax rates sometimes would stimulate the increase of the corporate investments in the inflation environment. So the secure corporate investment is to choose the most irrelative corporate investment with the inflation, using the declining income tax rates.

Personally Identifiable Information (PII) is any information that identifies or can be used to identify, contact, or locate that person to whom such information pertains or that is or might be linked to a natural person directly or indirectly [1]. In order to recognize data processed within information and communication technologies as PII, it should be determined at which stage the information identifies, or can be associated with, an individual. In the International Standard as privacy framework and privacy architecture framework, several PII was categorized such as biometric identifier, national identifiers, financial profile and customer number [7]. As the Protection of Personal Data Act is in force in Korea, the subject of protection responsibility is increased, and continuous efforts are made to protect privacy in overseas countries, as can be seen by standard drafts related to privacy protection. This paper is designed to show an effective web based PII Management System to ensure self-imposed control for domestic circumstances in Korea.

Remote user authentication scheme with key agreement is a very practical mechanism to verify a remote user and then provide secure communication. Furthermore, many network environments have been becoming multi-server based due to the rapid growth of computer networks. Therefore, more and more researches have been focused on proposing smart card based remote authentication scheme with session key agreement for multi-server environment. Recently, Tsaur, Li and Lee (2012) proposed such a novel scheme which adopts a self-verified timestamp technique to help the smart card based authentication scheme not only effectively achieve password-authenticated key agreement but also avoid the difficulty of implementing clock synchronization in multi-server environments. They claimed that their scheme is against various attacks and more efficient. However, we observe that Tsaur-Li-Lee's scheme is still vulnerable to off-line password guessing attack, insider attack and malicious user attack. Besides, Tsaur-Li-Lee's scheme has no password change phase and also suffers from weaknesses of static identity and inefficiency in wrong password detection. In this paper, we propose an improved dynamic identity based scheme to eliminate all the security and efficiency weaknesses without decreasing other security performances.

In 2009, Hsiang et al.’s proposed a secure, improved remote user authentication scheme using smart card against the parallel session attack, masquerading attack, and password guess attack. Hsiang et al.’s scheme, however, is still vulnerable to off-line password guess attack if the attacker steals or temporarily accesses the smart card to extract the information stored in it, and does not satisfy the security requirement against the adversary that have to be considered in remote user authentication scheme using password-based smart cards. In this paper, I proposed an efficient mutual authentication scheme that based on the hash function and random number. Accordingly, an improved remote user authentication scheme is proposed that is secure against password guess attack.

Many ways to encrypt data have been innovated as the time moving, starting with simple ideas like changing positions of letters throughout to very high and complicated mathematical calculations to provide the element of security to our important data. Advanced Encryption Standard (AES) is one of the famous algorithms – specially Rijndael Algorithm- although there are other algorithms have been preferred upon rijndael algorithm in the field of security, rijndael algorithm has been selected as a symmetric cipher standard algorithm because of its high performance. So In this thesis there is an attempt to Enhance the security of rijndael algorithm by adding another key in both encryption and decryption operations to increase the strength of security and keep the performance close to traditional algorithm as much as possible using java programming language to implement the algorithm and monitoring the performance by calculating the execution time of encryption, decryption and generating key(s) in different numbers of sessions which had been opened between sender and receiver.

Countless security and defense systems require an accurate Angle of Arrival (AOA) detection for incoming signals. Angle of Arrival (AOA) estimation is basic procedure required by several monitoring and tracking systems for security applications and other defense purposes. In this paper, a combined OFDM system and bandpass sampling method using Multiple Signal Classification (MUSIC) algorithm for automatic (angle of arrival) AOA tracking is discussed. And we propose a new method that adding (time division multiplexing) TDM with bandpass sampling in the same time to avoid interference due to RF filter characteristics. Also, we consider Doppler effect for the targets’ movement in mobile environment and after compensating the Doppler effect with a valid range, the system performances well. Simulation results show that the performances of MUSIC spectrum for AOA due to various conditions and demonstrates the accuracy of AOA estimations.

In this paper we proposed a novel video watermarking technique using Discrete Wavelet Transform and Singular Value Decomposition based on subband selection procedure. To increase the level of authentication, the two watermarks are used: one is the original watermark and the other is the owners’ fingerprint. These two watermarks are embedded into the cover video based on the subband selection scores. From the experimental analysis, we found that the proposed watermarking technique is more robust to all possible attacks than existing video watermarking technique.

This paper presents the stochastic Petri net (SPN) model of the hybrid redundancy system. The capacity of fault detection is taken into account in the model. Besides, the method to perform reliability, availability, maintainability and safety (RAMS) analysis has been proposed based on the isomorphic Markov chain of the SPN model. The presented methodology is demonstrated by a case study of the output subsystem of the subsea blowout preventer. RAMS analysis of the presented case is conducted and the effects of the diagnostic rate and repair rate on the performance are studied. The results show that high diagnostic rate can improve the reliability, availability and safety of the system.

The Global IT revolution is growing rapidly. Government and business have to be ready to meet the increased demand for effective and secure online services. With the E-Government practicing, day-by-day the public demand is also increasing simultaneously. Now this present moment, one of important research part is secure E-Voting for E-Government service, but for this important factor or Government Issue, it needs information privacy for secure information transaction of citizen’s opinions and secure authentication. This paper has analyzed several approaches E-voting protocols, those are implemented with many digital signature mechanisms and maintained many types of cryptographic rules, which are main factor for information privacy. In this paper we discussed them with a view to voter anonymity and protection from manipulations. The paper then developed an algorithm designed to guarantee anonymity of the voter and to avoid the risk of manipulation of votes. In this paper the proposed algorithm is based upon the strict separation of voter’s registration and submission of votes, which means that certain information has to be stored on a secure storage media. This paper discusses the secure security criteria and possible implementation options for such secure storage.

Extensible Business Reporting Language (XBRL) is developed to provide an efficient and effective means of preparing and exchanging financial information over the Internet to employees, investors, and financial analysts. XBRL financial reporting services are vulnerable in security because there are no regulations of security in XBRL Standard Specification even though the Internet is unsecure in its nature. XBRL financial reporting services need end-to-end, message-level security because XBRL financial documents are transported to an ultimate receiver via multi intermediaries. However, the current security technologies which are transport-level security and point-to-point security such as SSL/TLS, S-HTTP, and VPN, are not sufficient for securing financial information or encrypting only selected portions of an information set. This paper proposes FRWS2 security model which uses WS-Security. XBRL instance documents are first encoded by SOAP and use UsernameToken, timestamp, and nonce to authenticate. FRWS2 is sufficient and effective for Authorization, Integrity, Confidentiality, and non-Repudiation of financial reporting services.

Wireless sensor networks (WSNs) consists of spatially distributed autonomous sensor nodes to monitor physical or environmental conditions because of that they have widespread applications in human communities and existence world. Like other computer and telecommunication networks, wireless sensor networks are susceptible to regarding destructive threats and attacks and simple hardware of these electronic devices prevents applying defensive mechanisms called networks. Positioning key is of main performances of coding in all kinds of applications in which security is considered as an anxiety. Despite the nature of limited resources on sensor nodes limits using current routing and security mechanisms in wireless sensor networks. Secure routing protocol design because of being under the influence of resource limitations and physical nodes of the sensor is essential for wireless sensor networks. In this paper, we study topology control and virtual backbone based on dominating sets for wireless sensor networks. We deal with the performance evaluation of connected dominating set construction algorithms.

Most of the previous works of social network analysis depend on node graph and adjacency matrix in connection with an aspect of social network topology. However, the representing node and matrix are difficult to understand a relationship between SNS users, because the user’s interaction is presented by a complicated node graph. In order to overcome this limitation, this paper proposes a new visualization method to represent hierarchy relationship of SNS users for analysis of social network with respect to NFC users. The proposed method uses fuzzy relational product to construct dynamic hierarchy relationship which can intuitively understand user’s interaction. Besides, it can focus on personal relation on SNS which is modeled using user activities of Twitter (i.e., microblogging) by visualizing relationship among users regarding NFC users. Also, we propose analyzing scenario regarding NFC access information using the proposed algorithm

In this paper, we propose a new efficient hierarchical identity based signature (HIBS) scheme. Our scheme can be proven probably secure based on a natural hardness assumption (i.e. h-exponent computational diffie-hellman problem (h-CDH)) in the standard model. Our scheme only requires three pairing computations in verification, which has no relations with the hierarchy. Our scheme has constant signature size, and the length of a user's private key is shrinking as the depth increases. Most importantly, our scheme is non-public-verifiable. Only the specified recipient can verify the signature, which is very important for some private communications.

We propose architecture for multi-agent systems to retrieve and classify features extracted from images and videos of smart cameras. To enable cooperative inference between agents on cameras, structured representation of agents’ knowledge and abilities is required in the form of ontologies. Recognized features if properly structured and annotated, can be a useful source of information for context aware surveillance. This work builds a hierarchical inference data deployment structure and import related and required data to annotate rich data arriving from multiple sensor streams, in this case smart cameras. The annotation provides an impetus to the improvement of knowledge over time. Proactive deployment provides the main concepts and properties to model a hierarchical area ontology structure which can span a university campus or a city. We also define management policies to compare their performance for the wide area surveillance specifically.

Physical unclonable functions (PUFs) have outstanding unique and non-reproducible properties owing to inter-chip variations. However, the amount of randomness in a PUF output could be a significant limitation. In this study, by passing the PUF response to a shift register, the randomness of the PUF output can be greatly increased while maintaining reliability. We discuss the performance of an arbiter-type PUF and a ring-oscillator-type PUF with a simple shift register from the viewpoint of biometrics. Moreover, PUFs, particularly linear delay-based PUFs, are not designed for machine learning or linear programming, which makes innovation difficult. We further focus on an efficient PUF evaluation method by using linear programming and logistic regression in the case of the challenge response pairs (CRPs) with low entropy.

Cloud computing become more and more eye-catching these days. Each big company in IT areas hurries to win a chunk of meat which promises to be a whopping market in future. What make sense is advantages are inevitably accompanied by disadvantages. Subsequently, risks in cloud are also more and more compelling to people. This paper studies and researches on an array of experienced literature, presents an integrated risks table based on the risk key factors of cloud computing, and gives a comprehensive description for every risk. In the meanwhile, it gives a verification and validation for these risks under the comparison with SLA requirements.

A wearable computing has been proposed as an alternative of the best mobile computing interfaces and devices. A digital garment acts as a key element of wearable computing. We will apply digital yarn link as material of data communications on purpose to take advantage of a digital garment. This paper proposes the link buffering architecture and the transmission processes for peer-to-peer (P2P) communications using a digital yarn. Then it proposes the link buffering control and data frame transmission methods for efficient link buffering as well as frame buffering process for fault-recovery.

The influence of the changes about the number of the nodes with different states by the external factors is not considered in the traditional model. So, traditional models are not suitable for the cloud network which is dynamic. A virus propagation model of computer, HSIR propagation model, whish is suitable for the cloud environment is proposed in this paper. The model considers the dynamic changes of the cloud environment, the implementation of the immunization strategy and the time difference between the virus spread and the implementation of the immunization strategy. Additionally, the balance point of the HSIR model is found and the stability of the balance point is proved by the mathematical theory. The HSIR virus propagation model can describe the process of the virus propagation in the cloud environment more realistic.

This paper proposes a method to analyze human actions and provide alarm service through a smart-phone. The proposed method extracts objects using camera input images and modeling background. This paper defines a action recognition parameter as an extracted object’ histogram and its joints’ information about human action recognition and analyzes changes in defined parameter to determine conditions for recognizing human actions. Furthermore, in order to systemically classify actions, the proposed method designs a decision tree and combines the defined conditions with a conditional expression of tree node, which enables effective action recognition and classification. Recognized actions are transferred to a smart phone as a simple value and the transferred result is displayed on the phone. The proposed method is tested from a video of a webcam about nine actions of four persons. As for action recognition and alarm service of a smart phone, the proposed method works well and effectively.

Recently, with the rapid development and implementation of wireless medical sensors, electronic healthcare (e-healthcare) has gained increasing popularity. Monitor and record some vital parameters of patients are of importance to know the patient’s health condition. But malicious attacks happen occasionally, which may cause the patient-related data being leaked or modified. In this paper, we made a survey about some researches in the domain of e-healthcare for its data security and privacy issues, such as the security issues of the distributed data storage in wireless body area networks (WBANs) and the privacy of the patient-related information stored in the database of the medical organization systems. We also proposed a general three-tier medical architecture and discussed its security issues in detail. Finally, we concluded some of the achievements from our references.

The privacy preserving data aggregation protocols in wireless sensor networks have many applications in security critical areas, since it hides individual nodes’ data from adversaries. The existing hop by hop and shuffling based privacy preserving protocols does not provide an energy efficient, accurate and secure data aggregation result in base station, due to the energy consuming decryption at the aggregator node, reveals large amount of privacy protected information to adversaries, thereby it looses end to end confidentiality of data and allows the adversary to generate inaccurate results. The proposed privacy preserving protocol named EPSDA overcomes the problems in the existing scheme by performing aggregation on encrypted data, based on privacy homomorphic property of the encryption algorithm however there is a chance of replying the old information to the network. The EPSDA protocol prevents the replay attack by achieving data freshness during aggregation, this increases the accuracy of the aggregated result by performing the aggregation on encrypted data and reduced number of transmissions. It also guarantees the integrity of the aggregated result at base station and the authentication of the data during non delayed aggregation. Our main aim is to provide an energy efficient and secure data aggregation scheme, which guarantees the privacy, authenticity and freshness of individual sensed data as well as the confidentiality, accuracy and integrity of aggregated data.

Since the Internet is a widely used tool in many business areas these days, a large amount of contents are offered through the Web. Almost all of them, however, are being provided to users without any protection. Anyone can copy and reuse the contents without permission by using features of the Web browser and even use them for commercial purposes. It is time to consider having countermeasures to protect the Web contents from illegal use and leakage. Therefore, this paper proposes security requirement of Web contents protection system by modeling a threat and applying a security requirements engineering methodology base on Common Criteria V3.1. It can be used as reference in the case of introduction or evaluation of the system.

To aim at 3-vote-2 voting system which had already been widely applied in modern railway signal system, based on Markov model the paper analyzed its security and reliability indexes respectively under the three operating modes. During modeling some significant factors, such as common-cause failure, coverage rate of diagnostic systems, online maintainability, periodic inspection, and diverse failure modes, not only were considered, but also according to practical applications, the three types of Markov models were established for 3-vote-2 voting system with diversity version software on condition that secondary degradation was allowed, and secondary degradation was not allowed, and as well as not only secondary degradation was not allowed but also primary degradation was not be allowed too, that is 2oo2 model operating. They were respectively defined as Mode I, and Mode II, and Mode III. Based on the Markov models, the reliability and security indexes of the three modes were worked out. Compared with 3-vote-2 voting system with single version software, the results showed that the influence of diversity software versions on 3-vote-2 voting system security was unapparent, but quite dramatic for its reliability. In addition, the impacts on system reliability and security were unapparent whether considering secondary degradation or not, and the results tended to be conservative and the system was easy to realize while not considering secondary degradation. In the end, the investigations still showed that the impacts on system security performance were not very large, but relatively larger on system reliability under the Mode III, and the results tended more conservative and the system was easier to realize. Hence, after comprehensive consideration on reliability, and security, and as well as easy realization factor, we consider that the Mode III possesses better performance presentation, and is an ideal realization scheme for 3-vote-2 voting system.

Among the verification systems using biometric information, the fingerprint-based system is well-known technique as uniqueness and immutability. However, there are some problems in the process of minutiae detection from fingerprint image. In this paper, new minutiae detection algorithm is proposed to solve those problems. New technique called tip tracing is added to trace the exact minutiae point position in the proposed algorithm. From the experiment results, we confirm that the proposed algorithm improves the minutiae extraction accuracy and performance of fingerprint verification.

Hagerty and Draper [3] presented a theoretical result that explains the probabilistic back- ground of the NIST's entropy test at the random bit generation workshop in 2012. They introduced the notion of an entropic statistic and desired to bound the entropy rate of an unknown output distribution of a given entropy source. However there has been no detailed derivation process about the upper bound, while the theoretical steps of obtaining the lower bound are well described. In this paper we give an elaborate mathematical analysis to obtain the upper bound for the collision statistic. We also present an extended simulation results to investigate practical usefulness of the entropy bounds.