• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.39-46
• /
• 2003

We propose a quantum signature scheme with message recovery implemented by a symmetrical quantum key cryptosystem and Creenberger-Horne-Zeilinger(CHZ) triplet states. The suggested scheme relies on the availability of an arbitrator and can be divided into two schemes . one is using a public board and the other is not. The two schemes give us the confidentiality of a message and the higher efficiency in transmission. We propose a quantum signature scheme with message recovery using Greenberger-Home-Zeilinger(GHZ) triplet states.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.605-609
• /
• 2002

Reliable multicast data transmission in a 1:N environment needs more sophisticated error control mechanism than that of in 1:1 environment due to ACK implosion and duplicated retransmission. Although there have been many related research on error control in reliable multicast, real implemented protocols are rare. As one of the reliable multicast transport protocols, ECTP is selected as an international standard reliable multicast protocol by ITU-T and ISO and implemented on RedHat 7.2 machine by us. In this paper, we evaluate the performance of the error control mechanism in the respect of throughput and generated control packet numbers with a real implementation code. From the results, it is concluded that the suitable values of error control parameters can be obtained from the local group size and network environments.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.137-145
• /
• 2014

In this paper, we focus on end-to-end transfer delay improvement by using erasure coding when delivering expediting message consisting of M packets in networks with high coefficient of variation of transfer time. In the scheme, M packets are divided into b groups with each having g packets. Each group is erasure coded with additional r packets and transmitted. Since the first arrived g packets among g+r packets completes the delivery of the group, the delivery time of the expediting message is reduced. For the scheme, we investigate the optimum group size and number of redundancy packets considering delivery delay reduction and additional transmission cost caused by using erasure coding. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.9-16
• /
• 2012

In this paper, we focus on end-to-end transfer delay improvement by using network coding and propose a scheme where a message is divided into several packets which are network coded generating additional redundancy with the results that the number of transmitted packets increases. In networks with high coefficient of variation of transfer time, increased number of packets could reduce the transfer time of the message to a destination. For the proposed scheme, we investigate the optimum number of divided packets and redundancy considering transfer delay reduction and additional transmission cost caused by using network coding under the restriction of maximum transmission packet size. From the results of the investigation, we see that the proposed scheme is effective in networks having high variability of transfer time and would be very useful and practical especially for the case that expedited deliveries of messages are needed.

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.803-814
• /
• 2010

In this paper, we propose a frame structure for modified ATSC transmission systems which is used for a terrestrial 3D HDTV broadcasting. The modified ATSC transmission systems [2] see the potential of increasing a transmission capacity at reasonable TOV (Threshold of Visibility) by modifying channel codes of conventional ATSC systems and varying modulations. We use PN symbols (Pseudorandom Noise) in a guard interval which is used for avoiding the ISI (Inter Symbol Interference) to estimate and compensate the time-varying multi path channel effectively with a maximum transmission payload. With PN symbols in the guard interval, a CIR (Channel Impulse Response) in a time domain can be estimated and a compensation in a frequency domain can be achieved for the accurate channel estimation and compensation. The prosed frame structure is applied to the modified ATSC systems and computer simulations are performed for SER (Symbol Error Rate) performances in TU (Typical Urban)-6 Channel.

• The KIPS Transactions:PartB
• /
• v.13B no.4 s.107
• /
• pp.369-376
• /
• 2006

The degradation and its inverse modeling can achieve restoration of corrupted image, caused by scaled digitization and electronic transmission. De-speckle process on the noisy document(or SAR) images is one of the basic examples. Non-linearity of the speckle noise model may hinder the inverse process. In this paper, our study is focused on investigation of the restoration methods for bi-level document image degraded by the impulse noise model. Our study shows that, on bi-level document images, the weighted-median filter and the Lee filter methods are very effective among other spatial filtering methods, but wavelet filter method is ineffective in aspect of processing speed: approximately 100 times slower. Optimal values of the weight to be used in the weighted median filter are investigated and presented in this paper.

• Journal of KIISE:Information Networking
• /
• v.36 no.6
• /
• pp.471-480
• /
• 2009

One of the principal impediments to the achievement of a scalable access control for a large number of subscribers in a public broadcast is to distribute key update messages reliably to all stateless receivers. However, in a public broadcast, the rekeying messages can be dropped or compromised during the transmission over an insecure broadcast channel, or transmitted to the receivers while it was off-line. In this study, we propose a novel group key management scheme that features a mechanism that allows the legitimate receivers to recover the current group key even if they lose key update messages for long-term sessions using short hint messages and member computation. The performance analysis result shows that the proposed scheme has advantages of the scalable and efficient rekeying compared with the previous reliable group key distribution schemes. The proposed key management scheme targets a conditional access system in a media broadcast where there is no feedback channel from receivers to the broadcasting station.

• Journal of Broadcast Engineering
• /
• v.4 no.1
• /
• pp.76-85
• /
• 1999

The degradation of image quality by block loss is more serious in fractal coded images with the error propagation due to mapping from the lost blocks than in DCT coded images. Therefore. a new algorithm is presented for recovering the blocks lost in the transmission through the lossy network as A TM network of the images coded by Jacquins fractal coding. Jacquins fractal code is divided into two layers of header code and main code according to its importance. The key technique of the proposed BLRA (block loss recovery algorithm) is a fractal extrapolation that estimates the lost pixels by using the contractive mapping parameters of the neighboring range blocks whose characteristics are similar to a lost block. The proposed BLRA is applied to the lost blocks in the iteration of decoding. Some experimental results show the proposed BLRA yields excellent performance in PSNR as well as subjective quality.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.280-289
• /
• 2003

Deadlock recovery-based routing algorithms in wormhole networks have gained attraction due to low hardware complexity and high routing adaptability Progressive deadlock recovery techniques require a few dedicated resources to transmit deadlocked packets rather than killing them. Selection of deadlocked packets is primarily based on time-out value which should be carefully determined considering various traffic patterns or packet length. By its nature, current techniques using time-out accompany unignorable number of false deadlock detections especially in a heavy-loaded network or with long packet size. Moreover, when a deadlock occurs, more than one packet may be marked as deadlocked, which saturate the resources allocated for recovery. This paper proposes more accurate deadlock detection scheme which does not make use of time-out to declare deadlock. The proposed scheme reduces the probability to detect false deadlocks considerably. Furthermore, a single message is selected as deadlocked for each cycle of blocked messages, thereby eliminating recovery overheads.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.407-415
• /
• 2003

As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.