• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.81-89
• /
• 2002

In this paper, we design and implement an efficient fair off-line electronic cash system based on Elliptic Curve Discrete Logarithm Problem (ECDLP), in which the anonymity of coins is revocable by a trustee in case of dispute. To achieve this, we employ the Petersen and Poupard s electronic cash system [1] and extend it by using an elliptic curve over the finite field GF($2^n$). This naturally reduces message size by 85% compared with the original scheme and makes a smart card to store coins easily. Furthermore, we use the Baek et al. s provably secure public key encryption scheme [2] to improve the security of electronic cash system. As an extension, we propose a method to add atomicity into new electronic cash system. To the best of our knowledge, this is the first result to implement a fair off-line electronic cash system based on ECDLP with provable security.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.9-11
• /
• 2022

Community detection is a hot topic in social network analysis, and many existing studies use graph theory analysis methods to detect communities. This paper focuses on detecting absolute fair maximal balanced cliques in signed attributed social networks, which can satisfy ensuring the fairness of complex networks and break the bottleneck of the "information cocoon".

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.215-217
• /
• 2004

In wireless sensor networks, fair allocation of bandwidth among different nodes is one of the critical problems that effects the serviceability of the entire system. Fair bandwidth allocation mechanisms, like fair queuing, usually need to maintain state, manage buffers, and perform packet scheduling on a per flow basis, and this complexity may prevent them from being cost-effectively implemented and widely deployed. It is a very important and difficult technical issue to provide packet scheduling architecture for fairness in wireless sensor networks. In this paper, we propose an packet scheduling architecture for sensor node, called FISN (Fairness Improvement Sensor Network), that significantly reduces this implementation complexity yet still achieves approximately fair bandwidth allocations. Sensor node for sensing estimate the incoming rate of each sensor device and insert a label into each transmission packet header based on this estimate. Sensor node for forwarding maintain no per flow state; they use FIFO packet scheduling augmented by a probabilistic dropping algorithm that uses the packet labels and an estimate of the aggregate traffic at the gathering node. We present the detailed design, implementation, and evaluation of FISN using simulation. We discuss the fairness improvement and practical engineering challenges of implementing FISN in an experimental sensor network test bed based on ns-2.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.375-383
• /
• 2009

The WiMedia alliance has specified a distributed medium access control (WiMedia MAC) protocol based on ultra wideband (UWB) for high data rate WPANs (HR-WPANs). The merits of WiMedia MAC such as distributed nature and high data rate make it a favorite candidate in HR-WPAN. Although QoS parameters such as the range of service rates are provided to a traffic stream, the WiMedia MAC is not able to use the QoS parameters and to determine or adjust a service rate using the QoS parameters for the traffic stream. In this paper, we propose a fair and adaptive resource allocation method that allocates time slots to isochronous streams according to QoS parameters and the current traffic load condition in a fully distributed manner. Although the traffic load condition changes, each device independently recognizes the changes and calculates fair and maximum allowable service rates for traffic streams. From the numerical and simulation results, it is proved that the proposed method achieves high capacity of traffic streams and fair QoS provisioning under various traffic load condition.

• Journal of Korean Library and Information Science Society
• /
• v.33 no.4
• /
• pp.19-35
• /
• 2002

European Union has recently encouraged its member states to enforce the Public Lending right that is a remuneration system for free lending service in public libraries. This study reviews the problem and the actual conditions of Public Lending Right System which is systematized in European Union and a few advanced countries. By analyzing the present state of many states which is running the public lending right system, this study also explores a reasonable compensation system which remunerate a copyrighter for his rending right md ensure the fair use tradition in libraries.

• Journal of Digital Convergence
• /
• v.10 no.1
• /
• pp.357-364
• /
• 2012

For the resistance of the closed intellectual property license from the Free Software Movement. It's free and also can adapt have been widely used. Software for the resistance of the closed intellectual property rights have been promoted by the free software movement. Implementation of the proposed changes in the license that anyone can freely use the software and adapt open source software is widely used. The product of open source software can reduce development time and cost. Many people who use it will improve, verification and developed. However, indiscriminate use of these advantages, as well as the risk of dispute is high. This study is analyzed open source software dispute cases for piracy protection and will show duly open source software available to users by user environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.2A
• /
• pp.98-106
• /
• 2005

We propose a new wireless fair queueing algorithm, WFQ-R (Wireless Fair Queueing with Retransmission), which is well matched with the LLR (Link Level Retransmission) algorithm and does not require channel prediction. In the WFQ-R algorithm, the share consumed by retransmission is regarded as a debt of the retransmitted flow to the other flows. Thus, the WFQ-R algorithm achieves wireless fairness with the LLR algorithm by penalizing flows that use wireless resources without permission under the MAC layer. Through simulations, we showed that our WFQ-R algorithm maintains fairness adaptively and maximizes system throughput. Furthermore, our WFQ-R algorithm is able to achieve flow separation and compensation.

• Journal of Korean Society of Archives and Records Management
• /
• v.9 no.2
• /
• pp.159-188
• /
• 2009

In the midst of computerization and digitization of the archives, the way of use and the need of users to use the public archives has been changed and expanded. It draws concerned party's attention to the copyrights in the public archives and the protection of the copyrights of the public archives. This study examines the exiting copyright laws in Korea and some foreign countries, interprets the laws, and presents legal implications when the laws are applied to the public archives held in the National Archives of Korea(NAK). The public records are "literary works" and their copyrights are to be protected. Most of the public archives held in the NAK are also "creative works" which are the presentations of thoughts and feelings of the individuals, the records creators in the public agencies. The holder of the copyrights of the archives is not the NAK, but the agency which created the archives, such as the central government and local governments. To promote the use of public archives, we need to expand the public domain in the public records and archives and the fair use of the archives. To do this, I suggest to amend and complement the Copyrights Act, the Pubic Records/Archives Management Act, and the Opening Records in the Public Agencies Act(FOIA in Korea). The establishment of a coordinating body dealing the copyrights in pubic record and archives is strongly recommended. The coordinating body will provide guidelines on protecting copyrights and expand the fair use and the public domain of the public archives.

• Journal of Information Management
• /
• v.30 no.4
• /
• pp.27-38
• /
• 1999

Information storage and it's usual patterns are digitised within the changes of the social environment to the information center from the library. In this aspect, it examines to use for digital information and a concept of copyright. And it reviews a role as information specialist in the digital era.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.