• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.3
• /
• pp.400-410
• /
• 2010

In an identity-based threshold broadcast encryption (IDTHBE) scheme, a broadcaster chooses a set of n recipients and a threshold value t, and the plaintext can be recovered only if at least t receivers cooperate. IDTHBE scheme is different from the standard threshold public key encryption schemes, where the set of receivers and the threshold value are decided from the beginning. This kind of scheme has wide applications in ad hoc networks. Previously proposed IDTHBE schemes have ciphertexts which contain at least n elements. In addition, the security of theses schemes relies on the random oracles. In this paper, we introduce two new constructions of IDTHBE for ad hoc networks. Our first scheme achieves S-size private keys while the modified scheme achieves constant size private keys. Both schemes achieve approximately (n-t)-size ciphertexts. Furthermore, we also show that they are provablesecurity under the decision bilinear Diffie-Hellman Exponent (BDHE) assumption in the standard model.

• ETRI Journal
• /
• v.31 no.4
• /
• pp.399-407
• /
• 2009

In this paper, we present a robust $H_{\infty}$ distributed power control scheme for wireless CDMA communication systems. The proposed scheme is obtained by optimizing an objective function consisting of the user's performance degradation and the network interference, and it enables a user to address various user-centric and network-centric objectives by updating power in either a greedy or energy efficient manner. The control law is fully distributed in the sense that only its own channel variation needs to be estimated for each user. The proposed scheme is robust to channel fading due to the immediate decision of the power allocation of the next time step based on the estimations from the $H_{\infty}$ filter. Simulation results demonstrate the robustness of the scheme to the uncertainties of the channel and the excellent performance and versatility of the scheme with users adapting transmit power either in a user-centric or a network-centric efficient manner.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.609-631
• /
• 2022

The main goal of VANETs is to improve the safety of all road users. Therefore, the accuracy and trustworthiness of messages transmitted in VANETs are essential, given that life may rely on them. VANETs are provided with basic security services through the use of public key infrastructure-based authentication. However, the trust of users is still an open issue in VANETs. It is important to prevent bogus message attacks from internal vehicles as well as protect vehicle privacy. In this paper, we propose a trust management scheme that ensures trust in VANETs while maintaining vehicle privacy. The trust scheme establishes trust between vehicles where a trust value is assigned to every vehicle based on its behavior and messages are accepted only from vehicles whose trust value is greater than a threshold, therefore, protecting VANETs from malicious vehicles and eliminating bogus messages. If a traffic event happens, vehicles upload event messages to the reachable roadside unit (RSU). Once the RSU has confirmed that the event happened, it announces the event to vehicles in its vicinity and records it into the blockchain. Using this mechanism, RSUs are prevented from sending fake or unverified event notifications. Simulations are carried out in the context of bogus message attacks to evaluate the trust scheme's reliability and efficiency. The results of the simulation indicate that the proposed scheme outperforms the compared schemes and is highly resistant to bogus message attacks.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2708-2721
• /
• 2014

Data outsourcing in the cloud (DOC) is a promising solution for data management at the present time, but it could result in the disclosure of outsourced data to unauthorized users. Therefore, protecting the confidentiality of such data has become a very challenging issue. The conventional way to achieve data confidentiality is to encrypt the data via asymmetric or symmetric encryptions before outsourcing. However, this is computationally inefficient because encryption/decryption operations are time-consuming. In recent years, a few DOC schemes based on secret sharing have emerged due to their low computational complexity. However, Dautrich and Ravishankar pointed out that most of them are insecure against certain kinds of collusion attacks. In this paper, we proposed a novel DOC scheme based on Shamir's secret sharing to overcome the security issues of these schemes. Our scheme can allow an authorized data user to recover all data files in a specified subset at once rather than one file at a time as required by other schemes that are based on secret sharing. Our thorough analyses showed that our proposed scheme is secure and that its performance is satisfactory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2793-2803
• /
• 2013

In H.264, three different data partition types are used, which have unequal importance to the reconstructed video quality. To improve the performance of H.264 video streaming transmission over IEEE 802.11e Wireless Local Area Networks, a prioritization mechanism that categorizes different partition types to different priority classes according to the calculated distortion within one Group of Pictures. In the proposed scheme, video streams have been encoded based on the H.264 codec with its data partition enabled. The dynamic scheduling scheme based on Enhanced Distributed Channel Access has been configured to differentiate the data partitions according to their distortion impact and the queue utilization ratio. Simulation results show that the proposed scheme improves the received video quality by 1dB in PSNR compared with the existing Enhanced Distributed Channel Access static mapping scheme.

• Structural Engineering and Mechanics
• /
• v.34 no.6
• /
• pp.739-753
• /
• 2010

Pointing to the design requirement of prestressed space grid structure being the target cable force, the pretension scheme decision analysis method is studied when there's great difference between structural actual state and the analytical model. Based on recursive formulation of cable forces, the simulative recursive system for pretension process is established from the systematic viewpoint, including four kinds of parameters, i.e., system initial value (structural initial state), system input value (tensioning control force scheme), system state parameters (influence matrix of cable forces), system output value (pretension accomplishment). The system controllability depends on the system state parameters. Based on cable force observation values, the influence matrix for system state parameters can be calculated, making the system controllable. Next, the pretension scheme decision method based on cable force observation values can be formed on the basis of iterative calculation for recursive system. In this way, the tensioning control force scheme that can meet the design requirement when next cyclic supplemental tension finished is obtained. Engineering example analysis results show that the proposed method in this paper can reduce a lot of cyclic tensioning work and meanwhile the design requirement can be met.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2926-2945
• /
• 2017

In geo-location database oriented spectrum sharing system, the entire geographic area is divided into meshes to classify, store and delivery the cognitive information. In this paper, we propose a flexible polygon mesh division scheme to reduce the number of meshes. Hence the cognitive information can be reduced correspondingly. Besides, polygon mesh can approximate the real environment and reduce the error of cognitive information because the edges of polygon are selected along the boundaries of the networks. We have designed the polygon approximation algorithm and have analyzed the relation between the error and the number of polygon's edges. Finally, the simulation results are provided to verify the algorithm and analysis. The polygon mesh division scheme in this paper provides an efficient approach for cognitive information organization in database oriented spectrum sharing system.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.32-38
• /
• 2012

Each sensor node can know its location in several ways, if the node process the information based on its geographical position in sensor networks. In the localization scheme using GPS, there could be nodes that don't know their locations because the scheme requires line of sight to radio wave. Moreover, this scheme is high costly and consumes a lot of power. The localization scheme without GPS uses a sophisticated mathematical algorithm estimating location of sensor nodes that may be inaccurate. AHLoS(Ad Hoc Localization System) is a hybrid scheme using both GPS and location estimation algorithm. In AHLoS, the GPS node, which can receive its location from GPS, broadcasts its location to adjacent normal nodes which are not GPS devices. Normal nodes can estimate their location by using iterative triangulation algorithms if they receive at least three beacons which contain the position informations of neighbor nodes. But, there are some cases that a normal node receives less than two beacons by geographical conditions, network density, movements of nodes in sensor networks. We propose an indirect localization scheme for low-density sensor nodes which are difficult to receive directly at least three beacons from GPS nodes in wireless network.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.348-358
• /
• 2015

Mobile devices have been widespread and become very popular with connectivity to the Internet, and a lot of desktop PC applications are now aggressively ported to them. Unfortunately, mobile devices are often vulnerable to malicious attacks due to their common usage and connectivity to the Internet. Therefore, the demands on the development of mobile security systems increase in accordance with advances in mobile computing. However, it is very hard to run a security program on a mobile device all of the time due the device's limited computational power and battery life. To overcome these problems, we propose a novel mobile security scheme that migrates heavy computations on mobile devices to cloud servers. An efficient data transmission scheme for reducing data traffic between devices and servers over networks is introduced. We have evaluated the proposed scheme with a mobile device in a cloud environment, whereby it achieved a maximum speedup of 13.4 compared to a traditional algorithm.

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

Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.