• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.8
• /
• pp.7-14
• /
• 2011

In this paper we studied a conventional system and propose a new decoding scheme for Space-time Frequency Code with Interleaved System. We also addressed the quasi orthogonal function with Jacket matrices in modern 3GPP LTE uplinked advance system. We also introduce the Partial Interference Cancellation (PIC) group decoding which provides a framework to adjust the complexity-performance tradeoff by choosing the sizes of the information symbols groups.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.6
• /
• pp.348-353
• /
• 2010

A threshold decryption scheme is a multi-party public key cryptosystem that allows any sufficiently large subset of participants to decrypt a ciphertext, but disallows the decryption otherwise. When performing a threshold decryption, a third party is often involved to guarantee fairness among the participants. To maintain the security of the protocol as high as possible, it is desirable to lower the level of trust and the amount of information given to the third party. In this paper, we present a threshold decryption scheme which allows the anonymity of the participants as well as the fairness by employing a semi-trusted third party (STTP) which follows the protocol properly with the exception that it keeps a record of all its intermediate computations. Our solution preserves the security and fairness of the previous scheme and reveals no information about the identities of the participants and the plaintext even though an attacker is allowed to access the storage of the STTP.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.705-713
• /
• 2003

For group security to protect group data or to charge, group keys should be updated via key update messages when the membership of group changes. If we lose these messages, it is not possible to decrypt the group data and so this is why the recovery of lost keys is very significant. Any message lost during a certain member is logged off can not be recovered in real-time. Saving all messages and resending them by KDC (Key Distribution Center) not only requests large saving spaces, but also causes to transmit and decrypt unnecessary keys. This paper analyzes the problem of the loss of key update messages along with other problems that may arise during member login procedure, and also gives an efficient method for recovering group keys and auxiliary keys. This method provides that group keys and auxiliary keys can be recovered and sent effectively using information stored in key-tree. The group key generation method presented in this paper is simple and enable us to recover any group key without storing. It also eliminates the transmissions and decryptions of useless auxiliary keys.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8C
• /
• pp.771-776
• /
• 2006

We present a suboptimum decoding method for space-time trellis codes, which include maximum $likelihood(ML)^{[1]}$ and principal ratio $combining(PRC)^{[2]}$, over quasi-static flat fading channels. In the proposed scheme, the receive antennas are divided into K groups and the PRC is applied to each group, showing a flexible performances between ML and PRC. When K is determined, we also propose the optimum grouping rules and performance index(PI), which simply anticipate the relative performances. Moreover the performances are also evaluated when receive antennas are correlated. Finally, Computer simulations corroborate those theoretical results.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.9
• /
• pp.1235-1244
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multicast user in PIM-SM multicast group communication. With prosed architect, subgroups for multicast secure group management will be divided by RP (Rendezvous-Point) unit and each RP has a subgroup manager. Each subgroup manager gives a secure key to it's own transmitter md the transmitter compress the data with it's own secure key from the subgroup manager. Before the transmitter send the data to receiver, the transmitter prepare to encrypt a user's service by sending a encryption key to the receiver though the secure channel, after choking the user's validity through the secure channel. As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key. As a result, the transmitting time is shortened because there is no need to data translation by group key on data sending and the data transmition is possible without new key distribution at path change to SPT (Shortest Path Tree) of the router characteristic. Additionally, the whole architecture size is samller than the other multicast secure architecture by using the conventional PIM-SIM routing structure without any additional equipment.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.263-265
• /
• 2003

그룹 통신 보안에 사용되는 그룹키의 갱신 메시지가 전송상에서 분실될 경우, 멤버들은 그룹 데이터의 복호화가 불가능해진다. 그러므로 신뢰성 있는 그룹키 갱신 메시지의 전달 뿐 아니라, 분실된 키의 복구는 매우 중요한 문제이다. 본 논문에서는 키 갱신 메시지의 분실이나 멤버의 로그인시에 발생할 수 있는 문제점을 분석하고 효율적으로 그룹키 및 보조키들을 복구하는 방법들을 제시한다. 또한 그룹 관리자가 메시지를 저장하지 않고 임의의 그룹키를 복구할 수 있도록 하였으며, 멤버의 중복된 키 복구 요청과 불필요한 보조키들의 전송을 줄였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.254-256
• /
• 2012

본 논문에서는 MPEG-D 오디오 서브그룹에서 진행 중인 Unified Speech and Audio Coding (USAC) 표준의 Linear Prediction Domain (LPD) 복호화기 모듈을 고정소수점 알고리즘으로 제안한다. USAC 부호화기는 두 개의 최신 음성-오디오 부호화기가 융합된 형태로, 음성 및 오디오 신호에 대하여 우수한 성능을 갖는 부호화기이다. USAC의 표준 완료와 본격적인 서비스화에 앞서서 USAC LPD 복호화기의 구조적인 특성을 분석하고, Digital Signal Processor (DSP)구현을 위한 LPD 복호화기의 고정소수점 알고리즘을 구축하는 동시에 모듈의 복잡도를 측정하고자 한다. 또한 고정소수점 알고리즘으로 구현된 LPD 복호화기와 기존의 부동소수점 복호화기의 성능을 비교하고, LPD 복호화기의 두 가지 부호화 모드에 따른 복잡도 이슈를 다루도록 한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.21-26
• /
• 2013

In this paper we propose a system where we divide the group with 2 symbols. The two added symbols are separated by multiplexing and later added using the DE-multiplexing technique. In our proposed system a simple Partial Interference Cancelation (PIC) group decoding scheme is used for Double-ABBA(D-ABBA) Quasi-Orthogonal Space Time Code, which reduces the decoding complexity for the higher order Multiple Input Multiple Output (MIMO) space time block coding. Finally we compare the proposed scheme performance using the different modulation schemes.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.160-172
• /
• 2014

Although Wyner-Ziv (WZ) video coding proves useful for applications employing encoders having restricted computing resources, the WZ decoder has a problem of excessive decoding complexity. It is mainly due to its iterative LDPC channel decoding process which repeatedly requests incremental parity data after iterative channel decoding of parity data received at each request. In order to solve the complexity problem, we divide bit planes into two groups and estimate the minimum required number of parity requests separately for the two groups of bit planes using bit plane correlation. The WZ decoder executes the iterative decoding process only after receiving parity data corresponding to the estimated minimum number of parity requests. The proposed method saves about 71% of the computing time in the LDPC decoding process.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.763-764
• /
• 2002

원격화상회의나 소프트웨어 배포 등 멀티캐스팅의 보안을 위해서 사용하는 그룹키는 그룹의 규모가 클 경우에도 멤버쉽 변화에 대하여 효율적으로 갱신이 이루어져야 한다. 본 논문에서는 DEP 구조를 멀티캐스트 프로토콜인 CBT에 적용한 2계층 관리 구조를 제안함으로써 키갱신 메시지 전송의 암.복호화 횟수를 제한아였으며, 서브 그룹 관리자를 그룹 통신으로부터 배제할 수 있는 효율적인 키관리 프로토콜을 제시하였다.