• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.47-70
• /
• 2008

File sharing technology is the most popular methodology through which consumers gain music from online. However, music file sharing and free downloads of music have caused terrible recession of traditional music industry. The purpose of this paper is to develop the underlying theory for understanding the acceptance of music file sharing technology and empirically test our theoretical model. We develop extended TAM model and explore the influencing factors on the user acceptance of music file sharing technology. Our study delivers a better understanding on consumers’ attitudes towards music downloads. By understanding the fundamental characteristics of technology that makes consumers enthusiastic, traditional music industry will gain managerial implications.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.228-239
• /
• 2013

Peer-to-peer (P2P) systems have proved the most effective and popular file sharing applications in recent years. Previous studies mainly focused on equal service and differentiated service strategies when peers have no initial data before their downloads. For an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when the initial data distribution of peers satisfies some special conditions. Moreover, we show how to minimize the time required to distribute the file to any number of peers. The proposed fluid-based models can reveal the intrinsic relations among the initial data amount, the peer set size, and the minimum last finish time. The closed-form expressions derived from the extended models can closely approximate chunk-based models and systems, especially for relatively large files. As an application of the extended models, we show how to provide differentiated service efficiently to multiple peer sets. Since no limits are imposed on the upload bandwidth of peers or the size of each peer set, we believe that our analytic process and the results achieved can provide not only fundamental insights into bandwidth allocation and data scheduling but also a helpful reference for both improving system performance and building an effective incentive mechanism for P2P file sharing systems.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.2
• /
• pp.135-140
• /
• 2011

Currently, studies have show that the network related energy consumption are increasing. and part of overall energy consumption of our society are too. So, that is important to look for energy-efficient network applications and protocols. A most of network energy consumption are due to network edge devices. in this paper, in order to cut down the emissions of carbon dioxide from ICT business, which contributes 2% of the global energy consumption, it is necessary to understand energy consumption in peer-to-peer system. In this paper, in this paper we propose a architecture based on the introduction of a p2p proxy. The model is analyzed analytically and numerically to reveal how these factors influence the overall power consumption in both steady state and flash crowd information exchange scenarios. Specifically, our results show that the proxy-based solution can provide up to 50% reduction in the energy consumption and, at the same time, a significant reduction in the average file download time.

• Journal of Industrial Technology
• /
• v.24 no.B
• /
• pp.193-198
• /
• 2004

We propose and analyse a flexible secure file sharing scheme which can be used for data sharing among members in P2P environment. When a member wants to share data, notification messages are sent to the members with whom the member wants to share data. Each notification message includes one-time password encrypted with the receiver's public key. A member who received the notification message can download the data by using the one-time password. The proposed scheme provides selective sharing, download confirmation and efficient memory management. In terms of security, the proposed scheme supports authentication, entity privacy, replay attack protection and disguise prevention.

• Journal of the Korea Convergence Society
• /
• v.9 no.12
• /
• pp.53-60
• /
• 2018

With the development of information and communication technology, we have been able to access and manage documents containing corporate information anytime and anywhere using smart devices. As the work environment changes to smart work, the scope of information distribution is expanded, and more efforts are needed to manage security. This paper proposes a file sharing system that enables users who have smart devices to manage and share files through mutual cooperation. Proposed file sharing system, the user can add a partner to share files with each other when uploading files kept by spliting the part of the file and the other uses an algorithm to store on the server. After converting the file to be uploaded to base64, it splits it into encrypted files among users, and then transmits it to the server when it wants to share. It is easy to manage and control files using dedicated application to view files and has high security. Using the system developed with proposed algorithm, it is possible to build a system with high efficiency even for SMEs(small and medium-sized enterprises) that can not pay much money for security.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.706-709
• /
• 2008

With the increasing popularity of P2P file sharing and advancement of mobile technologies, mobile P2P has revealed its attraction. Anonymity has become an increasing requirement in mobile networks. To reduce receiving garbage files, file validation and filtering are other requirements in the mobile P2P environment. If there are effective file filtering and validation mechanism, nodes' battery duration will be saved. In this paper, we do an analysis of security and anonymity in P2P file sharing and exchange system in mobile ad hoc environment, and propose a new efficient anonymous protocol, which can provide anonymity by broadcasting with a probabilistic algorithm and hiding real hop count information, the file validation by the file's special hash value and file filtering mechanism through the collaboration of middle nodes.

• Journal of Advanced Navigation Technology
• /
• v.16 no.6
• /
• pp.968-974
• /
• 2012

After launched various smart devices such as smart phone and tablet PC, people who using smart devices are provided various services. Especially, contents sharing technology is utilized in any devices. But current contents sharing systems are made on various versions for various smart devices. These methods will be raising cost for development of application. Therefore it must using web technology for reducing cost. In this paper, we had analyzed performance of file transmission using web technology and compared with application based system.

• Journal of the Korea Convergence Society
• /
• v.10 no.3
• /
• pp.7-14
• /
• 2019

With the development of information and communication technology, we have been able to access and manage documents containing corporate information anytime and anywhere using smart devices. As the work environment changes to smart work, the scope of information distribution is expanded, and more efforts are needed to manage security. This paper proposes a file sharing system that enables users who have smart devices to manage and share files through mutual cooperation. Proposed file sharing system, the user can add a partner to share files with each other when uploading files kept by spliting the part of the file and the other uses an algorithm to store on the server. After converting the file to be uploaded to base64, it splits it into encrypted files among users, and then transmits it to the server when it wants to share. It is easy to manage and control files using dedicated application to view files and has high security. Using the system developed with proposed algorithm, it is possible to build a system with high efficiency even for SMEs(small and medium-sized enterprises) that can not pay much money for security.

• Journal of Information Technology Applications and Management
• /
• v.16 no.3
• /
• pp.1-15
• /
• 2009

The paper analyzes a copyright owning firm's incentive to enforce its copyright in the presence of file-sharing networks. I devise a two-period model where a copyright owner sells two different versions of a creator's information good, and show that the firm's overall profits are enhanced by a strategy of differential inter-temporal enforcement of the copyright protection, compared to strategies of no enforcement or full enforcement in both periods. If the firm enforces no copyright protection in the first period, the low-valuation consumers may make and consume copies that are imperfect substitutes for the original information good. If there is a significant increase in the willingness-to-pay of some low-valuation consumers after they experience the information good, the firm can extract the increased consumer surplus by enforcing a positive level of copyright protection in the second period. Social welfare, however, is maximized in the case of no enforcement.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.89-95
• /
• 2023

Cloud computing today provides huge computational resources, storage capacity, and many kinds of data services. Data sharing in the cloud is the practice of exchanging files between various users via cloud technology. The main difficulty with file sharing in the public cloud is maintaining privacy and integrity through data encryption. To address this issue, this paper proposes an Enhanced RSA encryption schema (ERSA) for data sharing in the public cloud that protects privacy and strengthens data integrity. The data owners store their files in the cloud after encrypting the data using the ERSA which combines the RSA algorithm, XOR operation, and SHA-512. This approach can preserve the confidentiality and integrity of a file in any cloud system while data owners are authorized with their unique identities for data access. Furthermore, analysis and experimental results are presented to verify the efficiency and security of the proposed schema.