• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.8
• /
• pp.1472-1491
• /
• 2011

As used product transactions are currently on the rise, the demand for transactions of secondhand digital content will grow in the future; thus, learning to make secure transactions while avoiding cyber attacks becomes an important issue. In this paper, we combine the new buyer's secret key, the new buyer's watermark to embed in resold digital content, and the reseller's encrypted watermark, which can prove legal ownership of the reseller. Using the privacy homomorphism property of RSA and exponential calculus, the original seller of digital content can verify the legality of the reseller and the new buyer. We also reduced the load of encryption/decryption digital content using a partial encryption/decryption algorithm to make our protocol more efficient and practical. In the proposed protocol, the seller is not able to conduct piracy and easily frame any other innocent secondhand buyer when a case of piracy is found. In fact, piracy can be clearly traced using the privacy homomorphism property of RSA and the embedded watermark mechanism. Further, in the proposed protocol, the seller himself can trace the piracy using exponential calculus. Since it is unnecessary to trust third party participation, the conspiracy problem is resolved and the new buyer is not required to participate in the dispute. Moreover, the seller, reseller and new buyer can simultaneously benefit from the secondhand transaction.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.55-69
• /
• 2010

This article proposed the authentication protocol for peer-to-peer resource sharing community. The proposed protocol does not require a priori information for generating and exchanging authentication key. Also this protocol can provide the delicate access control by allowing the user(authenticator) to assign the trust level to the authentication supplicant, which can be used to decide if the resource providing node will accept the resource sharing request from a resource requesting node. Trust Relationship Chaining provides the environment where trust levels (included in the trust table) of nodes in the resource sharing community are propagated among nodes when trust tables are exchanged between two nodes engaged in mutual authentication process and authentication refresh so that any two nodes which are not directly mutual-authenticated can assign the trust level each other for the access control for resource sharing. In the proposed protocol a node can implements the authentication refresh continuously to verify the effectiveness of authentication after mutual authentication so that the authentication of new node or authentication revocation(effectiveness cancellation) of the departed node can be propagated to the all the nodes in RSC and eventually safe resource sharing community is configured.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.68-75
• /
• 2000

In this paper, a media access control protocol is proposed for voice/data integrated services in the packet CDMA network, and the performance of the proposed protocol is analyzed. The proposed protocol uses the spreading code sensing and the reservation schemes. This protocol gives higher priority to the delay-sensitive voice traffic than to the data traffic. A voice terminal can reserve an available spreading code during a talkspurt to transmit multiple voice packets. On the other hand, whenever a data packet is generated, the data terminal transmits the packet through one of the available spreading codes that are not used by the voice terminals. In this protocol, the voice packets do not come into collision with the data packets. The numerical results show that this protocol can increase the maximum number of voice terminals. The performance for the data traffic degrades by increasing the voice traffic load because of the low priority. But it shows that the data traffic performance can be increased in proportion to the number of spreading codes.

• Journal of Korea Multimedia Society
• /
• v.20 no.8
• /
• pp.1321-1329
• /
• 2017

A quantum computer, based on quantum mechanics, is a paradigm of information processing that can show remarkable possibilities of exponentially improved information processing. This paradigm can be solved in a short time by calculating factoring problem and discrete logarithm problem that are typically used in public key cryptosystems such as RSA(Rivest-Shamir-Adleman) and ECC(Elliptic Curve Cryptography). In 2013, Lei et al. proposed a secure NTRU-based key distribution protocol for quantum computing. However, Lei et al. protocol was vulnerable to man-in-the-middle attacks. In this paper, we propose a NTRU(N-the truncated polynomial ring) key distribution protocol with mutual authentication only using NTRU convolution multiplication operation in order to maintain the security for quantum computing. The proposed protocol is resistant to quantum computing attacks. It is also provided a secure key distribution from various attacks such as man-in-the middle attack and replay attack.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.807-812
• /
• 2015

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred as anti-collision algorithm. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. Through simulations, it is demonstrated that the collision rate for the proposed algorithm is about 50% lower than STAC protocol. Therefore, the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• The Journal of Society for e-Business Studies
• /
• v.12 no.4
• /
• pp.17-27
• /
• 2007

This paper proposes a key distribution and authentication protocol between user, service provider and key distribution center (KDC). This protocol is based on symmetric cryptosystem, challenge-response, Diffie-Hellman component and hash function. In the proposed protocol, user and server update the session key under token-update operation, and user can process repeated efficient authentications by using updated session keys. And another merit is that KDC needs not to totally control the session key between user and server in proposed protocol. Even an attacker steals the parameters from the KDC, the attacker still can not calculate session key. According to the comparison and analysis with other protocols, our proposed protocol provides good efficiency and forward secure session key.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.1
• /
• pp.24-29
• /
• 2011

Comparing conventional one-way relaying, two-way relaying scheme with network coding can achieve high throughput by reducing the transmission time. Coded cooperation protocol, which is a algorithm that uses coding on physical layer, can achieve high reliability. In this paper, we propose coded cooperation protocol over two-way relay network. Simulation results show proposed protocol has better performance in terms of reliability and throughput compare with conventional amplify and forward protocol. Also, with same throughput, proposed protocol has better performance in terms of reliability compare with the conventional hybrid decoded and forward protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.7B
• /
• pp.463-471
• /
• 2007

Because of MANET's dynamic characteristic, the hidden node problem can happen. Thus it must use with distributed channel access. In Ad hoc networks, carrier sense multiple access with collision avoidance(CSMA/CA) is one of the most widely used medium access control(MAC) schemes for asynchronous data traffics. However, CSMA/CA could not guarantee the quality of multimedia traffics. CSMA is a contention based protocol. Therefor once a node gets a channel, it can momopolze. Thus the fairness problem with channel starvation will happen. We will propose a new MAC protocol to guarantee QoS for multimedia data in ad hoc networks.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.75-83
• /
• 2016

In this paper, we propose a multi-channel medium access control (MAC) protocol, named underwater multi-channel MAC protocol (UMMAC), for underwater acoustic networks (UANs). UMMAC is a split phase and reservation based multi-channel MAC protocol which enables hosts to utilize multiple channels via a channel allocation and power control algorithm (CAPC). In UMMAC, channel information of neighboring nodes is gathered via exchange of control packets. With such information, UMMAC allows for as many parallel transmissions as possible while avoiding using extra time slot for channel negotiation. By running CAPC algorithm, which aims at maximizing the network's capacity, users can allocate their transmission power and channels in a distributed way. The advantages of the proposed protocol are threefold: 1) Only one transceiver is needed for each node; 2) based on CAPC, hosts are coordinated to negotiate the channels and control power in a distributed way; 3) comparing with existing RTS/CTS MAC protocols, UMMAC do not introduce new overhead for channel negotiation. Simulation results show that UMMAC outperforms Slotted floor acquisition multiple access (FAMA) and multi-channel MAC (MMAC) in terms of network goodput (50% and 17% respectively in a certain scenario). Furthermore, UMMAC can lower the end-to-end delay and achieves a lower energy consumption compared to Slotted FAMA and MMAC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8B
• /
• pp.1122-1128
• /
• 2010

In this paper, we proposed and designed a novel SNA protocol which operates in the way of a server and a client in the power control system. The proposed SNA protocol includes the information about the mode switching, the saving position of context information, the user trigger, and so forth, which are needed in the power management devices. We consider the application of the SNA protocol to the home network, where message flows between the SNA server and the SNA client. To verify the operation of the SNA protocol, the state transition diagrams of the server in the home gateway and the client in the network device are shown. Hence, we can conclude the SNA can operate without malfuction.