• 디지털콘텐츠학회 논문지
• /
• 제8권4호
• /
• pp.631-637
• /
• 2007

본 논문에서는 공평한 비밀정보교환을 위한 적응형 암호화 프로토콜을 제안한다. 이를 위해 Lein Harn등이 제안한 이산대수 문제에 기반한 검증가능 불확정전송 프로토콜을 분석하고 부가적인 기능을 가진 적응형 암호화 프로토콜을 제안한다. 기존의 방식에서 고려하지 않았던 송신자확인 및 송신사실 사후부인방지 등의 여러 기능이 부가되고 적응적 기능을 가지는 암호화 프로토콜을 제안한다. 이를 위해 의사난수생성기를 이용한 Bit Commitment 기법을 도입한 방법을 제안한다.

• 대한전기학회논문지
• /
• 제33권10호
• /
• pp.387-395
• /
• 1984

This paper proposes an improved unit commitment algorithm for the purpose of rational operation of electric power systems. Security function is introduced to consider generation system reliability as well as economical properties in the algotithm . As a stte model for assessment of state probabilities, the 3-state model in which the probability of the units for commitment can be considered is proposed and applied, so that the algorithm becomes more practical and reasonable one. A decision bounding scheme which can be applied to all kinds of system is described and the numerical results obtained for KEPCO and model systems are also presented to assure the availability of the proposed technique.

• East Asian Economic Review
• /
• 제16권2호
• /
• pp.155-204
• /
• 2012

This study maps out the degree of liberalization of trade in services under four ASEAN+n frameworks. After constructing a database showing the existence of limitations on market access and/or national treatment by each service sector, the study finds that the commitment level differs greatly between sensitive and less sensitive sectors, and that the commitment level under the ASEAN Framework Agreement (AFAS) is the highest among the four FTAs studied. It also finds that there are cross-country and sector-wide similarities in the pattern of service sector commitment under and across each of the FTAs; this implies that the shared domestic sensitivities can be overcome by a shared economic cooperation scheme for enhancing competitiveness in the ASEAN+n region.

• 한국정보보호학회:학술대회논문집
• /
• 한국정보보호학회 2006년도 하계학술대회
• /
• pp.595-598
• /
• 2006

무선 센서네트워크에서의 브로드캐스트 인증은 중요한 문제이다. 이를 위해 ${\mu}-TESLA$와 이를 개선한 멀티레벨 ${\mu}-TESLA$ 방법 등이 제안되었다. 이들 모두는 인증을 성공적으로 수행하기 위해 브로드캐스트 메시지를 보내고자 하는 당사자의 해시체인 commitment를 인증 받으려는 상대방에게 안전하게 전달해야만 했다. 하지만, 센서들이 랜덤하게 배치될 경우 각 노드는 인증을 위해 전체 노드 수만큼의 commitment를 저장해야만 하는 문제점을 지니고 있다. 이를 해결하기 위해 Chen 등은 브로드 캐스트 인증에 사용되는 해시 체인 commitment를 안전하고 효율적인 방법으로 전달하는 방안을 제안하였다. 그러나 불행이도 이들의 방법은 노드 추가가 원천적으로 불가능하고, 초기화 과정에서 부득이하게 참여하지 못한 노드를 구제할 방법이 전혀 없어 큰 비용 낭비를 초래한다. 뿐만 아니라 베이스 스테이션이 비밀 값을 재사용 할 경우 안전성에도 큰 문제가 발생한다. 제안하는 스킴은 멀티 세션을 적용하고 비밀 값에 대한 해시 체인을 구성하여 앞서 열거된 모든 문제점을 해결함으로써 안전하고 효율적인 commitment 전달 방법을 제시한다. 아울러 주고받는 메시지에 대한 무결성 검증을 제공한다.

• 산업공학
• /
• 제20권2호
• /
• pp.186-194
• /
• 2007

Recent deregulation of Korean electricity industry has made each power generation company pay more attention to maximizing its own profit instead of minimizing the overall system operation cost while guaranteeing system security. Electricity power generation problem is typically defined as the problem of determining both the on and off status and the power generation level of each generator under the given fuel constraints, which has been known as Profit-Based Unit Commitment (PBUC) problem. To solve the PBUC problem, the previous research mostly focused on devising Lagrangian Relaxation (LR) based heuristic algorithms due to the complexity of the problem and the nonlinearity of constraints and objectives. However, these heuristic approaches have been reported as less practical in real world applications since the computational run time is usually quite high and it may take a while to implement the devised heuristic algorithms as software applications. Especially when considering long-term planning problem which spans at least one year, the complexity becomes higher. Therefore, this paper proposes an explicit column generation algorithm using power generation patterns and the proposed algorithm is successfully applied to a Korean power generation company. The proposed scheme has a robust structure so that it is expected to extend general PBUC problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.910-922
• /
• 2013

In 2008, Chin et al. proposed an efficient and provable secure identity-based identification scheme in the standard model. However, we discovered a subtle flaw in the security proof which renders the proof of security useless. While no weakness has been found in the scheme itself, a scheme that is desired would be one with an accompanying proof of security. In this paper, we provide a fix to the scheme to overcome the problem without affecting the efficiency as well as a new proof of security. In particular, we show that only one extra pre-computable pairing operation should be added into the commitment phase of the identification protocol to fix the proof of security under the same hard problems.

• 전자공학회논문지A
• /
• 제30A권8호
• /
• pp.1-10
• /
• 1993

In this paper, we will propose 4-move ZKIP and its application. Using bit-commitment scheme that is necessary to organize the ZKIP related to NP-Complete problem and WH and WI preserving the property for security under parallel composition of protocols, we will show that the proposed ZKIP is 4-move ZKIP of SAT comparing to 6-move ZKIP of SAT proposed by Brassard. Chaum and Yung, and under claw-free pairs of function the proposed ZKIP is also 4-move ZKIP comparing to 5-move ZKIP proposed by Goldreich and Krawczyk under the same assumption. Moreover we will show the efficiency of the proposed scheme better than Fiat and Shamir's scheme at the points of computational complexity and communication complexity, and also propose the efficient and secure identification scheme against the chosen ciphertext attack, using the proposed scheme.

• 보건의료산업학회지
• /
• 제6권3호
• /
• pp.141-155
• /
• 2012

The purpose of this study is to analyze the effects of job stress on job attitude among nurse practitioners, determine moderating effects of perceived organizational support in this process, and provide preliminary data to devise a scheme for managing job attitude effectively in nursing manpower. The research model was composed of 7 sub-variables of job stress, which was a independent variable; job attitude, which was a dependent variable, was divided into job satisfaction and organizational commitment; and variables of moderating effects included perceived organizational support. The data for empirical analysis of the model were collected from 300 nurses working in one university hospital and two general hospitals in Busan by using structured self-administered questionnaires. The main results of empirical analysis were as follows: Perceived organizational support was effective in preventing job stress from worsening job attitude. Moderating effects of perceived organizational support were found to exist in relations between job stress and organizational commitment. These results imply that a sense of organizational support has both direct and moderating effects on job attitude and can be a good means of managing job attitude.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 추계학술대회 논문집 학회본부
• /
• pp.174-176
• /
• 1997

This paper proposes a unit commitment scheduling method based on hybrid genetic algorithm(GA). When the systems are scaled up, conventional genetic algorithms suffer from computational time limitations because of the growth of the search space. So greatly reduce the search space of the GA and to efficiently deal with the constraints of the problem, priority list unit ordering scheme are incorporated as the initial solution and the minimum up and down time constraints of the units are included. The violations of other constraints are handled by integrating penalty factors. To show the effectiveness of the proposed method. test results for system of 10 units is compared with results obtained using other methods.

• 대한전기학회논문지
• /
• 제34권6호
• /
• pp.220-229
• /
• 1985

This paper proposes a new optimal unit commitment algorithm for the rational operation of electric power systems. Especially, the algorithm is improved by considering transmission line capacity limits and load forecasting uncertainty with the consideration of the participation factors of each units, so that the method becomes more reliable and flexible one. The transmission losses are considered by using updated penalty factors obtained from the constant matrixes of the fast decoupled load flow method, the system loads are distributed at each buses, and the several necessary operational constraints are also considered for the purpose of presenting a more practicable scheme. Finally, the effectiveness of the proposed algorithm has been demonstrated by applying to the 23-bus model system.