Earticle

In this paper we consider the case where artificial neural network processing is securely performed over the wireless sensor network. To do this, we point out major security threats and countermeasures against them. Then, we revised Holenderski et al.’s decomposition model to support secure computing. Moreover, we refine the original model to deal with some boundary cases. The revised model shows that like the original model the horizontal decomposition is better than the vertical decomposition and that the number of the allocated lower neurons in each layer to each sensor node should be large for optimization.

Conference keys are secret keys used by a group of users commonly and with which they can encipher (or decipher) messages such that communications are secure. Based on the Diffie and Hellman’s PKDS, a conference key distribution scheme is presented in this paper. A sealed lock is used to lock the conference key in such a way that only the private keys of the invited members are matched. Then the sealed lock is thus made public or distributed to all the users, only legitimate users can disclose it and obtain the conference key. In our scheme, the construction of a sealed lock is simple and the revelation of a conference key is efficient

In Wireless Sensor Network security has to be mainly provided to two types of communications: one-to-all and one-to-one. This paper proposes a complete set of low complexity protocols to initially generate and distribute two types of secret keys, periodically renew the keys and change the keys based on cluster dynamics. They are designed for a clustered hierarchical network suitable for data aggregation and all the communications in the protocols are properly authenticated using Elliptic Curve Digital Signature scheme. The security analysis shows that the protocols are strong against several possible attacks. The protocols are implemented for TinyOS using NesC, simulated under TOSSIM and are viable for implementation in resource-constrained platforms like MICA. A major outcome of our simulation is the observation that most of the time rekeying is done because of cluster dynamics. It is therefore suggested that implementing proper authentication protocols and batch rekeying protocols reduce the number of times rekeying is performed, resulting in longer life of the network.

In 2003, Yang, Chang, and Hwang proposed an enhanced scheme of Peyravivan-Zunic’s password authentication scheme by using the Diffie-Hellman scheme. Later, Yoon, Ryu, and Yoo demonstrated that Yang-Chang-Hwang’s scheme is vulnerable to a stolen-verifier attack and a denial-of-service attack, and then proposed an improved scheme. In this paper, we show that Yoon-Ryu-Yoo’s scheme is still vulnerable to a stolen-verifier attack and a server spoofing attack under some reasonable assumption. In addition, we propose an improved scheme to eliminate such security flaws.

Due to improvements in imaging technologies and the ease of digital contents creation and manipulation, today there is a pressing need for the copyright protection of digital contents. It is also essential to have techniques for authentication of the content as well as the owner. This paper examines the suitability of color channel to be used for hiding a monochromatic watermark in a 24 bit colored BMP image. This paper uses the scheme which is based on comparison of middle band DCT coefficients exchange scheme [13]-[14]. This paper also proposes a way to improve the robustness against JPEG attack. Experimental results show that proposed scheme is very robust against JPEG compression along various kinds of image

Public key infrastructure (PKI) is a powerful tool for protecting information. Currently a PKI system shows a trend toward an emerging global PKI which becomes more complicated. The global PKI has to handle an enormous number of queries for cryptographic certificates which attest the authenticity of public keys. So a decentralized organization of the PKI is advantageously. Therefore we developed a specialized Peer-to-Peer-PKI model realizing efficient search and transfer of certificates and trust-recommendations. Our model based on our own rigorous binary tree algorithm and has four advantages. First, there is no any bottleneck problem when establishing a certification path or authenticating. Second, the authentication path is short with two constant logic steps. Third, in our model the entities need to mutual authenticate don’t need to inquire or download the CRL. Fourth, it’s easy to extend and suitable for large-scale network.

The evolution of mobile technologies enables us to realize ubiquitous computing environments. In such environments, a user’s mobile terminal manages the sensitive information and assists in various activities based on the user’s information. At the same time, information leakage will become a serious social problem. In this paper, we propose a framework to protect the sensitive information of users in a manner they consider safe. In the framework, the user provides a trusted program that implements the manner he/she considers safe. The information recipient accesses user’s sensitive information through this trusted program. In this manner, the user can protect his/her sensitive information. However, there exist several challenges in the realization of this framework. In this paper, we propose a method for generating a trusted program and discuss the solutions to other challenges.

In [5], a protocol was described how to apply RFID to currency to provide integrity (e.g. reduce counterfeiting) while simultaneously supporting privacy. Here discuss how RFID can be applied to increase integrity and confidence in the pharmaceutical supply chain. A secured pharmaceutical supply chain will increase integrity, improve consumer confidence, and aid regulators in tracking pharmaceutical products, thus producing a “pharmaceutical drug pedigree”. At the same time privacy will need to be preserved. We provide an analysis of the pharmaceutical supply chain, and propose a security model for the system.

To realize the voice privacy between CDMA mobile phone and PSTN terminal, the voice frames shall be transmitted transparently between the heterogeneous networks. For satisfying this requirement, we propose the method which transmits voice frames by the CDMA circuit data channel in real time. In this paper we analyze the causes of voice delay which occurs during voice transmission by circuit data channel, propose methods which overcome the voice transmission delay and prove proposed methods by the experiment.

Security is concerned with the protection of assets from threats, where threats are categorised as the potential for abuse of protected assets. All categories of threats should be considered, but in the domain of security greater attention is given to those threats that are related to malicious or other human activities. ISO/IEC 15408 requires the TOE(Target of Evaluation) Security Environment section of a Protection Profile(PP) or Security Target(ST) to contain a list of threats about the TOE security environment or the intended usage of the TOE. This paper presents a specific physical threats should be considered in the smart card PP which developers of smart card PP must consider in Security Level 1st.