• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.95-100
• /
• 2007

Virtual Reality(VR) data in VR environments like Manufacturing industries are often created jointly by many creators. It is then necessary to provide protection of the joint-creatorship and the creatorship of each participating creator. This paper proposes Multiple Digital Watermarking Framework(MDWF) to solve the problem of joint-creatorship. The proposed framework, MDWF, makes use of 3D private watermarking technology and a novel key sharing protocol for joint-creatorship verification. MDWF embeds 3D private multiple watermarks for the creatorship of each participating creators in a non-overlapping manner during the creation process. After key agreement of all private keys, MDWF embeds an additional 3D private watermark for the joint-creatorship. Therefore MDWF successfully handles the creatorship dispute among creators. That is, each participation creator can prove his/her partial creatorship as well as joint-creatorship by MDWF. In addition, MDWF can solve the collusion problems because shared secret key(SSK) can be made by every users.

• Language and Information
• /
• v.2 no.1
• /
• pp.116-156
• /
• 1998

This paper is an HPSG approach to agreement phenomena involving the Korean honorific expressions. it is shown that the theoretical devices developed by the constraint-based theory of HPSG can be fruitfully used to capture the interactions between syntactic constraints and semantic of pragmatic factors in Korean honorific agreement. The HPSG's semantic feature 'referential index' plays a key rele in discribing the multiple interaction. The constraint-based theory of agreement proves successful in accounting for the phenomenon that may be called 'inconsistent' honorific agreement as well as 'consistent' regular honorific usages. However, this paper acknowledges its limit. Recognizing an important distinction between basic and 'coercive' honorific expressions, it is argued that a systactic-semantic-pragmatic approach such as the present one can only be applied to basic honorific agreement. Being sociolinguistic in nature, coercive honorific agreement is perhaps not amenable to formal linguistic investigation.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.640-645
• /
• 2001

본 논문에서는 무선환경을 고려하여 타원곡선 암호시스템을 기반으로 하는 AKC 프로토콜(Authenticated Key Agreement with Key Confirmation Protocol)을 제안한다. 제안 프로토콜은 2명의 객체가 한번의 세션과정을 통해서 복수개의 공유키를 생성하며 주기적으로 키를 refresh함으로써, 현재 안전한 암호 알고리즘의 수출규제에 따른 대안으로 사용되어질 수 있다. 또한 이미 알려진 여러 공격에 대한 안전성을 상세히 고찰한다.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.57
• /
• pp.221-241
• /
• 2013

Country of origin is very important in terms of consumers right to know, protection of producer, national finance and tariff preference etc. The principal issues related to country of origin are breaches of origin mark, determination of origin of OEM products, domestic products using imported raw materials, exports products, and fairness of penalties. This study focus origin mark issues on key components and set products which have not been treated so far. First, Origin mark issues on key components need to introduce multiple countries of origin for the same products. Some specific products, which are considered important key components or materials, has to mark multiple country of origin in terms of portion and significance. Next, Origin mark issues on set products need to expand the objects from 15 listed items of Korea Foreign Trade Act to all items of HS tariff schedules of Korea Customs Act. A set products which below 15% of components can mark single country of origin like FTA agreement such as Korea-EU FTA, Korea-EFTA, Korea-US FTA and Korea-Peru FTA.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.5
• /
• pp.298-305
• /
• 2014

In this study, a novel Randomly Shifted Certification Authority Authentication protocol was used in ad hoc networks to provide authentication by considering the MAC layer characteristics. The nodes achieve authentication through the use of public key certificates issued by a CA, which assures the certificate's ownership. As a part of providing key management, the active CA node transfers the image of the stored public keys to other idle CA nodes. Finally the current active CA randomly selects the ID of the available idle CA and shifts the CA ownership by transferring it. Revoking is done if any counterfeit or duplicate non CA node ID is found. Authentication and integrity is provided by preventing MAC control packets, and Enhanced Hash Message Authentication Code (EHMAC) can be used. Here EHMAC with various outputs is introduced in all control packets. When a node transmits a packet to a node with EHMAC, verification is conducted and the node replies with the transmitter address and EHMAC in the acknowledgement.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.1
• /
• pp.51-61
• /
• 2010

Koinonia system is designed to fully utilize the advantage of Binary CDMA so as to guarantee QoS in wireless networks. In this paper, we propose the new network structure based on this system and refer to it as BLAN(Binary CDMA LAN). Although BLAN is similar structure to IEEE 802.11 WLAN, it will ensure the fast handover and QoS. We also propose the AKA(Authentication and Key Agreement) protocol and Reauthentication protocol to be used for communication in BLAN. These protocols are securely and efficiently designed using the user identity module to support the more powerful authentication. Hence, BLAN, including the proposed protocols, will support the high mobility and security. In conclusion, we expect that BLAN can be applied to future infrastructure on special environment, and it can be helpful showing the new network model which alternate WLAN.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.157-168
• /
• 2005

Group key agreement protocols are designed to provide a group of parties securely communicating over a public network with a session key. The mobile computing architecture is asymmetric in the sense of computational capabilities of participants. That is, the protocol participants consist of the stationary server(application servers) with sufficient computational Power and a cluster of mobile devices(clients) with limited computational resources. It is desirable to minimize the amount of computation performed by each group member in a group involving low-power mobile devices such as smart cards or personal digital assistants(PDAs). Furthermore we are required to update the group key with low computational costs when the members need to be excluded from the group or multiple new members need to be brought into an existing group. In this paper, we propose a dynamic group key protocol which offers computational efficiency to the clients with low-power mobile devices. We compare the total communicative and computational costs of our protocol with others and prove its suity against a passive adversary in the random oracle model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.498-514
• /
• 2012

Machine to machine (M2M) communications is the hottest issue in the standardization and industry area, it is also defined as machine-type communication (MTC) in release 10 of the 3rd Generation Partnership Project (3GPP). Recently, most research have focused on congestion control, sensing, computing, and controlling technologies and resource management etc., but there are few studies on security aspects. In this paper, we first introduce the threats that exist in M2M system and corresponding solutions according to 3GPP. In addition, we present several new security issues including group access authentication, multiparty authentication and data authentication, and propose corresponding solutions through modifying existing authentication protocols and cryptographic algorithms, such as group authentication and key agreement protocol used to solve group access authentication of M2M, proxy signature for M2M system to tackle authentication issue among multiple entities and aggregate signature used to resolve security of small data transmission in M2M communications.

• The Journal of Society for e-Business Studies
• /
• v.15 no.1
• /
• pp.157-171
• /
• 2010

To effectively maintain manufacturing collaboration, the development of effective performance measurements for the collaboration is required. Most existing key performance indicators however were developed to measure the performances of internal activities or outsourcing of a company. For that reason, it is necessary to devise new key performance indicators that the partners participating in the collaboration can arrange and compromise with each other to reflect their common goals. In this paper, we propose collaborative Key Performance Indicators(cKPIs), which is used to measure the collaboration work of multiple manufacturing partners on the basis of the Supply Chain Operations Reference(SCOR) model. Also, a modified Sigmoid function is devised as a desirability function to reflect the characteristics of Service Level Agreement(SLA) between two partners. The proposed indicators and the desirability functions can be utilized to perform and maintain the successful collaboration by providing a way to the quantitative measurement.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.601-608
• /
• 2001

The automated assignment of multiple tasks to executing agents is a key problem in the area of multi-agent systems. In many domains, significant savings can be achieved by reallocating tasks among agents with different costs for handling tasks. The automation of task reallocation among self-interested agents requires that the individual agents use a common negotiation protocol that prescribes how they have to interact in order to come to an agreement on "who does what". In this paper, we introduce the multi-agent Traveling Salesman Problem(TSP) as an example of task reallocation problem, and suggest the Vickery auction as an interagent negotiation protocol for solving this problem. In general, auction-based protocols show several advantageous features: they are easily implementable, they enforce an efficient assignment process, and they guarantce an agreement even in scenarios in which the agents possess only very little domain-specific Knowledge. Furthermore Vickrey auctions have the additional advantage that each interested agent bids only once and that the dominant strategy is to bid one′s true valuation. In order to apply this market-based protocol into task reallocation among self-interested agents, we define the profit of each agent, the goal of negotiation, tasks to be traded out through auctions, the bidding strategy, and the sequence of auctions. Through several experiments with sample multi-agent TSPs, we show that the task allocation can improve monotonically at each step and then finally an optimal task allocation can be found with this protocol.