• The Journal of Information Systems
• /
• v.15 no.1
• /
• pp.1-20
• /
• 2006

Peer-to-peer systems (P2P) are rapidly growing in importance on the Internet environment, quickly extending the range of their usage. However, peer-to-peer systems have not been widely applied in electronic commerce because they have not been established as an appropriate business model. Therefore, we firstly review the previous research relevant to peer-to-peer systems, and then analyze the business models for P2P systems presented by previous researchers. Furthermore, this study categorizes major issues in terms of the technical and business model aspects. On the basis of these reviews, we develop P2P electronic commerce systems based on the file sharing method between users, focusing on user interface friendliness. A developed P2P electronic commerce systems are programmed by using the C# based on the Microsoft.net solution. A database is implemented using the MSSQL2000. A main application technology is designed that P2P electronic commerce systems make it possible. for user to extend into BtoB Solution by using WSDL (Web Services Description Language), UDDI (Universal Description, Discovery, and Integration) and the XML that is a document for users. User interface is made as form of Internet messenger for a user's convenience and is possible to develop into a commodity transaction system based on XML. In this study, it is possible for the P2P electronic commerce system to have extended application to fields such as Internet shopping mall and property transaction in a nonprofit organization, a public institution and a large scale nonprofit institution that have a similar structure as compared with a structure of a nonprofit educational institution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.333-343
• /
• 2006

MANET and P2P applications have a common nature that they don't have any fixed infrastructures that might maintain network topologies. With such common characteristics, a P2P application can be a killer application over MANET. Due to absence of reliable node which serves indexing services in MANET, fully distributed P2P applications are more suitable for MANET. By using DHT like Chord, we can save network bandwidth and avoid a point of failure of a directory server. However, since MANET allows nodes to depart from network freely, P2P file sharing applications using Chord lookup protocol should address how to recover the keys stored at the departed node. In this paper, we propose BU-Chord in order to detect and recover the departure of nodes by creating and storing backup file information in distributed manner. Our BU-Chord shows off better performance than existing Chord especially in case of high departure rate of nodes.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.873-886
• /
• 2003

Lookup Is one of important factors for network traffic on peer-to-peer network. Especially, large amount of network resources are required for lookup process in p2p file sharing system that clients use the dynamic If and they import to p2p network in random. In this paper, we employ efficient lookup mechanism which searches lookup with the combined information of ISP key values and the extracted key values from SHA-1 hashing function for shared contents id. The proposed mechanism efficiently searches files on the network because the mechanism processes P2P lookup with consideration the routing information of ISP. We suggest the adapted simulation environment based upon the famous file sharing system of emule P2P and experiment the proposed system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.4
• /
• pp.103-109
• /
• 2008

Many Internet application provide the PKI(public key infrastructure)-based service to provide authentication and message integrity. Several researchers proposed PKI-based p2p network framework. However, in the real world, the use of PKI is not suitable for peer to peer network, because the peer-to-peer network is an open and dynamic network. Moreover, currently there is no nation-to-nation interoperable certificate. In this paper, we designed reliable p2p file sharing application without public key infrastructure. To do this we propose reliable public key distribution mechanism to distribute public key safely without PKI infrastructure for two-tier super-peer architecture. In our system, each peer generates and distributes its public/private key pairs, and the public key is securely distributed without PKI. The proposed mechanism is safe against MITM attack. This mechanism can be applied various P2P applications such as file sharing, IPTV, distributed resource sharing and so on

• Journal of Internet Computing and Services
• /
• v.23 no.3
• /
• pp.21-33
• /
• 2022

This paper is to suggest the secure secret sharing system in order to outstandingly reduce the damage caused by the leakage of the corporate secret. This research system is suggested as efficient P2P distributed system kept from the centrally controlled server scheme. Even the bitcoin circulation system is also based on P2P distribution scheme recenly. This research has designed the secure circulation of the secret shares produced by Threshold Shamir Secret Sharing scheme instead of the shares specified in the torrent file using the simple, highly scalable and fast transferring torrent P2P distribution structure and its protocol. In addition, this research has studied to apply both Shamir Threshold Secret Sharing scheme and the securely strong multiple user authentication based on Collaborative Threshold Autentication scheme. The secure transmission of secret data is protected as using the efficient symmetric encryption with the session secret key which is safely exchanged by the public key encryption. Also it is safer against the leakage because the secret key is effectively alive only for short lifetime like a session. Especially the characteristics of this proposed system is effectively to apply the threshold secret sharing scheme into efficient torrent P2P distributed system without modifying its architecture of the torrent system. In addition, this system guaranttes the confidentiality in distributing the secret file using the efficient symmetric encryption scheme, which the session key is securely exchanged using the public key encryption scheme. In this system, the devices to be taken out can be dynamically registered as an user. This scalability allows to apply the confidentiality and the authentication even to dynamically registerred users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.709-735
• /
• 2010

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.448-450
• /
• 2003

P2P 환경의 파일 공유 서비스는 많은 사용자들에 의해 널리 이용됨으로써 거대한 분산 컴퓨팅 환경으로 이끌어 낸다. 이것은 기존의 파일 공유 서비스 이외에 프로세스 공유 측면에서도 좋은 환경을 제공할 수 있다. 이에 본 논문에서는 P2P의 파일 공유 서비스 사용 형태를 기반으로 프로세스 공유를 위한 협업시스템을 설계한다. 제시된 시스템은 P2P에서 발생가능한 Peer들간의 집중현상을 간접적으로 줄이고 다수의 Peef들 간의 분산된 컴퓨팅 능력을 제공함으로써 기존 파일 공유 환경에 효율적인 분산환경을 제공할 수 있다.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.717-727
• /
• 2009

P2P (Peer-to-Peer) network depends on cooperation of peers considerably. However, some peers do not share files at all and only download files. Peers also share low quality files or unpopular files. These selfish behavior of peers is referred to 'free riding'. The free riding of peer may decrease participation of other peers or the system performance. In this paper, we propose an incentive mechanism, called IcMFS (Incentive Mechanism for File Sharing System), which provides the correct use of incentive mechanism using trust peer, computes contribution values referring behavior of peers and rewards peers. The proposed mechanism assigns bandwidth and TTL(Time-To-Live) to a peer and differentiates the use of service. A case study on simulations shows the service differentiation according to the contribution value of peer, the correct use of incentive mechanism using trust peer and the advantage by use of trust peer. To prove the stability of proposed mechanism, we also show the disadvantage that a peer receives from the incorrect use of incentive mechanism.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.1
• /
• pp.89-96
• /
• 2015

The various services applied internet have been provided by the rapid development of wireless networks and providing multimedia contents are also increasing. It is caused a number of problems such as increasing of network traffic rapidly. P2P technique is gaining popularity for solving these problems. In particular, P2P technique in a wireless network environment has gained much popularity. Among them, MANET-based P2P techniques has been studied actively. It is not easy to be applied the existing technique as it is due to the dynamic topology and low bandwidth by moving nodes in MANET that is consisted of only mobile nodes. In this paper, we proposed sharing group construction technique for providing a stable connection between mobile nodes and reducing the load of network traffic and overhead of sharing group reconfiguration in order to improve data transmission performance between mobile nodes. The sharing group member nodes applied virtual sharing group generation technique with neighboring nodes of 1-hop distance in order to reduce traffic for file sharing. We performed comparative experiments with DHT technique to evaluate the performance of the proposed technique in this paper and the excellent performance is confirmed through experiments.

• 한국IT서비스학회:학술대회논문집
• /
• 2007.05a
• /
• pp.467-473
• /
• 2007

사용자의 가상커뮤니티 활동성이 기술 수용에 미치는 영향을 P2P시스템의 파일공유서비스를 중심으로 알아보려고 한다. P2P시스템 재사용의도가 커뮤니티 활동성과 몰입에 의해 영향을 받을 것이라는 강한 추측에도 불구하고 이를 반영한 연구는 아직 없었다. 따라서 본 연구는 사용자의 가상커뮤니티 활동성이라는 개념을 새롭게 도출하고, 사용자의 가상커뮤니티 활동성이 어떠한 경로로 P2P시스템 재사용에 영향을 주고 있는가를 실증적으로 검증하는 것을 목적으로 한다.