• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.7
• /
• pp.1458-1464
• /
• 2005

A P2P is a method that can share and exchange on digital resources through a direct connection on personnel without a central server. In this paper, Although the P2P application that uses our proposed framework should obtain one or more IP addresses of the neighbor peers manually, after instantiate, the application can do its job while maintaining connection to the network continuously and automatically. To evaluate our proposed scheme, we measured and analyzed the time for a peer to reconnect to the network when the mediating peer fails and the network isolation occurs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4C
• /
• pp.451-457
• /
• 2006

A peer-to-peer(P2P) network is inherently vulnerable to malicious attacks from participating peers because of its open, flat, and autonomous nature. This paper addresses the problem of effectively defending from active attacks of malicious peers at bootstrapping phase and at online phase, respectively. We propose a secure membership handling protocol to protect the assignment of ID related things to a newly joining peer with the aid of a trusted entity in the network. The trusted entities are only consulted when new peers are joining and are otherwise uninvolved in the actions of the P2P networks. For the attacks in online phase, we present a novel message structure applied to each message transmitted on the P2P overlay. It facilitates the detection of message alteration, replay attack and a message with wrong information. Taken together, the proposed techniques deter malicious peers from cheating and encourage good peers to obey the protocol of the network. The techniques assume a basic P2P overlay network model, which is generic enough to encompass a large class of well-known P2P networks, either unstructured or not.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.7B
• /
• pp.728-733
• /
• 2009

An ubiquitous environment has features like peer-to-peer and nomadic environments. Such features can be represented by peer-to-peer systems and mobile ad-hoc networks. P2P systems and MANETs share similar features, appealing for implementing P2P systems in MANET environment. However, if a P2P system designed for wired networks was applied to mobile ad-hoc environment, its performance was not good enough. Subsequently, this paper proposes a P2P system to improve performance using cross-layer design and the goodness of a node as a peer by using routing metric and P2P metric to choose favorable peers to connect. It also utilizes proactive approach for distributing peer information. The simulation results showed that the proposed system produced better performance in query success rate, query response time and energy consumption by reducing the routing path length.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.1033-1042
• /
• 2004

According to the arbitration mechanism among the peers in the network, the P2P networking environments can be classified into hybrid P2P networking environments and pure P2P networking environments. In hybrid P2P networking environments, each peer gets continual services from the servers that arc operational most of the time, and so, network isolation does not occur because every peer can always keep connection to the server. In pure P2P networking environments, however, every peer directly connects to another peer without server intervention, and so, network isolation can occur when the per mediating the connection is terminated. In this paper, we propose a scheme for each peer to keep connection information of other peers by maintaining IDs of its neighbor peers, to reconnect to another peers when the mediating peer fails to work. and, for efficiency. to balance the number of connections that should be maintained by each peer. With our mechanism, each pier in the network can continuously maintain connection to the network and get seamless services from other peers. Through the simulation, we ascer-tained that network isolation does not occur in the pure P2P network adopting our mechanism and that our mechanism distributes and balances the connections that are maintained by each peer. We also analyzed the total network traffic and the mean number of hops for the connections made by each peer according to the recommended number of connections that is established at system setup time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1851-1859
• /
• 1998

We summarize the password-based authetication protocol K1P which was introduced in our easlier papers [1,2] and then propose three more extended protocols. These protocols preserve a design concept of K1P, i.e., security and efficiency, and canbe used for various purposes. They are a One-time key K1P, a Client public key K1P, and an Exponential key exchange K1P.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.538-541
• /
• 2006

Recently researches of P2P media streaming have been actively published, but the research what kind of P2P overlay networks are better to delivering media data has not been attended. This paper designs a P2P streaming media system model. In this system, we constructs a Half-Structure P2P overlay protocol based on node's capability as the infrastructure of streaming application, which utilizes the heterogeneity of the nodes to maintain topology, presents a active contents diffusing algorithm and Two-stage search algorithm, make it possible for nodes in P2P system to collect information according their capacity and reduces the number of forwarding packet compared with flooding. Also, we give an optimal scheme to scheduling media data.

• Journal of Digital Convergence
• /
• v.13 no.5
• /
• pp.245-250
• /
• 2015

The P2P technology is becoming a technology for receiving a service, such as the latest YouTube and Facebook. P2P technology can be easily downloaded to a large amount of multimedia content over a distributed environment. However, pictures, music, a large amount of multimedia content such as videos each user is unable to manage the content management operating smoothly because, Song communication processing overhead caused when the reception is likely to remain the problem. In this paper, we propose a convergence content management technique that provides a low communication overhead of the frequency of use of the convergence content when trying to provide a large amount of convergence content to users in a distributed environment. Our method can be used to select the appropriate frequency is high among the shared content on the P2P multimedia environments that are distributed across a frequency of use of the convergence content and provides the service. Experimental evaluation proposed method, the convergence content browsing speed than conventional techniques improved communication about 13.3% and reduced overhead to about 9.5%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.421-429
• /
• 2006

Recently, DHT-based Structured P2P System have a attention to scalability and providing efficient lookup by routing. Retrieving content of DHT-based P2P require knowledge of the exact identifier of sharing file. But user may wish to search for sharing file using descriptive keyword or content. To resolve the problem, this paper propose Extended-CAN mechanism to support keyword search. We defined content-based keyword and identifier of sharing file, and PLS extended to KID and CKD for keyword, common keyword processing. As a result, Extended-CAN mechanism provide efficient keyword search for DHT-based Structured P2P System.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.846-852
• /
• 2006

The ${\kappa}$-error linear complexity is a ky measure of the stability of the sequences used in the areas of communication systems, stream ciphers in cryptology and so on. This paper introduces an efficient algorithm to determine the ${\kappa}$-error linear complexity and the corresponding error vectors of $p^m$-periodic binary sequences, where : is a prime and 2 is a primitive root modulo $p^2$. We also give a new sense about the ${\kappa}$-error linear complexity in viewpoint of coding theory instead of cryptographic results. We present an efficient algorithm for decoding binary cyclic codes of length $p^m$ and derive key properties of the minimum distance of these codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.8
• /
• pp.1783-1789
• /
• 2004

It is evaluated that there is infinit capability of creating new e business using P2P program. but the research for the method to protect the copyright of digital contents is urgent even for development of the p2p service because the problem of copyright protection for digital contents is not solved. Though this article, it can be induced that reliable contents sharing use to a flow fund by secure settlement architecture, user authentication and contents encryption and then it as the problem of copyright fee is solved, it is able to discontinue which trouble with a creation work for copyright fee and protection it's once again as growth of p2p market, p2p protocal is will be grow into a important protocal of advanced network. In this article, When users send digital contants to each other in internet, we proposed the P2P DRM algorism to offer a security function which using the technology of copyright management to use a AES Algorithm based on PKI.