• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.57-70
• /
• 2008

This paper introduces a new paradigm of physical layer security through channel coding for wireless networks. The well known spread spectrum based physical layer security in wireless network is applicable when code division multiple access (CDMA) is used as wireless air link interface. In our proposal, we incorporate the proposed security protocol within channel coding as channel coding is an essential part of all kind of wireless communications. Channel coding has a built-in security in the sense of encoding and decoding algorithm. Decoding of a particular codeword is possible only when the encoding procedure is exactly known. This point is the key of our proposed security protocol. The common parameter that required for both encoder and decoder is generally a generator matrix. We proposed a random selection of generators according to a security key to ensure the secrecy of the networks against unauthorized access. Therefore, the conventional channel coding technique is used as a security controller of the network along with its error correcting purpose.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.3
• /
• pp.125-136
• /
• 2009

The container packing problem Is one of the traditional optimization problems, which is very related to the knapsack problem and the bin packing problem. In this paper, we deal with the quadratic multiple container picking problem (QMCPP) and it Is known as a NP-hard problem. Thus, It seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the QMCPP. Until now, only a few researchers have studied on this problem and some evolutionary algorithms have been proposed. This paper introduces a new efficient evolutionary algorithm for the QMCPP. The proposed algorithm is devised by improving the original network random key method, which is employed as an encoding method in evolutionary algorithms. And we also propose local search algorithms and incorporate them with the proposed evolutionary algorithm. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds the new best results in most of the benchmark instances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1510-1532
• /
• 2017

In smart grid, privacy implications to individuals and their families are an important issue because of the fine-grained usage data collection. Wireless communications are utilized by many utility companies to obtain information. Network coding is exploited in smart grids, to enhance network performance in terms of throughput, delay, robustness, and energy consumption. However, random linear network coding introduces a new challenge for privacy preserving due to the encoding of data and updating of coefficients in forwarder nodes. We propose a distributed privacy preserving scheme for random linear network coding in smart grid that considers the converged flows character of the smart grid and exploits a homomorphic encryption function to decrease the complexities in the forwarder node. It offers a data confidentiality privacy preserving feature, which can efficiently thwart traffic analysis. The data of the packet is encrypted and the tag of the packet is encrypted by a homomorphic encryption function. The forwarder node random linearly codes the encrypted data and directly processes the cryptotext tags based on the homomorphism feature. Extensive security analysis and performance evaluations demonstrate the validity and efficiency of the proposed scheme.

• Convergence Security Journal
• /
• v.12 no.1
• /
• pp.43-48
• /
• 2012

In this paper, the requirements for information security are presented in the ubiquitous ecological(u-Eco) city. The various definition of ubiquitous city is analyzed first, the concept of the u-Eco City, services and major projects are then presented. The framework of the integrated operating center for u-Eco city is proposed, the privacy, data security and network facility protection in the center are analyzed. Unlike to previously proposed security algorithms, the light-weight encoding algorithms(such as block/stream encoding, pseudo-random generator, hash function, and public key encoding) in the u-Eco city center are required to communicate the information in the ubiquitous sensor network. Furthermore, the principal policies guaranteeing the secrecy and authentication for the private information are also presented.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2427-2445
• /
• 2016

In contrast to traditional "store-and-forward" routing mechanisms, network coding offers an elegant solution for achieving maximum network throughput. The core idea is that intermediate network nodes linearly combine received data packets so that the destination nodes can decode original files from some authenticated packets. Although network coding has many advantages, especially in wireless sensor network and peer-to-peer network, the encoding mechanism of intermediate nodes also results in some additional security issues. For a powerful adversary who can control arbitrary number of malicious network nodes and can eavesdrop on the entire network, cryptographic signature schemes provide undeniable authentication mechanisms for network nodes. However, with the development of quantum technologies, some existing network coding signature schemes based on some traditional number-theoretic primitives vulnerable to quantum cryptanalysis. In this paper we first present an efficient network coding signature scheme in the standard model using lattice theory, which can be viewed as the most promising tool for designing post-quantum cryptographic protocols. In the security proof, we propose a new method for generating a random lattice and the corresponding trapdoor, which may be used in other cryptographic protocols. Our scheme has many advantages, such as supporting multi-source networks, low computational complexity and low communication overhead.