• 정보보호학회논문지
• /
• 제25권1호
• /
• pp.155-164
• /
• 2015

저장된 데이터에 대한 높은 가용성과 기밀성을 보장하는 정보분산 알고리즘은 클라우드 스토리지 등 장애 발생 비율이 높고 신뢰할 수 없는 분산 스토리지 시스템에서 유용한 방법이다. 스토리지에 저장되는 데이터의 양이 증가하면서 IT 자원을 효율적으로 활용하기 위한 데이터 중복제거기법이 많은 주목을 받고 있으며 이에 따라 데이터 중복제거가 가능한 정보분산기법에 대한 연구도 필요한 시점이다. 본 논문은 분산 스토리지 시스템에서 클라이언트 기반 중복 제거를 위한 정보분산 알고리즘과 소유권 증명 기법을 제안한다. 제안하는 방법은 저장공간 뿐만 아니라 네트워크 대역 절감이 가능하여 높은 효율성을 얻을 수 있으며 신뢰할 수 없는 스토리지 서버와 악의적인 클라이언트로부터 안전성을 보장할 수 있다.

• ETRI Journal
• /
• 제43권2호
• /
• pp.357-370
• /
• 2021

The evolution of blockchain-based systems has enabled researchers to develop nextgeneration e-voting systems. However, the classical consensus method of blockchain, that is, Proof-of-Work, as implemented in Bitcoin, has a significant impact on energy consumption and compromises the scalability, efficiency, and latency of the system. In this paper, we propose a hybrid consensus model (PSC-Bchain) composed of Proof of Credibility and Proof of Stake that work mutually to address the aforementioned problems to secure e-voting systems. Smart contracts are used to provide a trustworthy public bulletin board and a secure computing environment to ensure the accuracy of the ballot outcome. We combine a sharding mechanism with the PSC-Bchain hybrid approach to emphasize security, thus enhancing the scalability and performance of the blockchain-based e-voting system. Furthermore, we compare and discuss the execution of attacks on the classical blockchain and our proposed hybrid blockchain, and analyze the security. Our experiments yielded new observations on the overall security, performance, and scalability of blockchain-based e-voting systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권8호
• /
• pp.4093-4107
• /
• 2019

Proof of Work (PoW) based blockchains have limitations in throughput, time consumption, and energy efficiency. In these systems, a miner will consume significant time and resources to obtain a reward for contributing to the blockchain. To overcome these limitations, recent research on blockchains are focused on accelerating the speed, scalability, and enhancing the security level. By enhancing specific procedures of blockchain system, the level of data integrity supported by the blockchain can become more robust, and efficient. In this paper, a new blockchain consensus model based on the Bryllite Consensus Protocol (BCP) is proposed to support a hyper-connected massively multiplayer online game (MMOG) ecosystem. The BCP scheme enables users to participate directly in new consensus processes through a Proof of Participation (PoP) algorithm. In this model, the consensus algorithm has a simpler form while maintaining high security level. In addition, because the BCP scheme gives users an equal chance to make a contribution to the blockchain, rewards are distributed in an equal fashion, which motivates user participation. The analysis of the proposed scheme is applied to the Bryllite consortium blockchain system (homed in Hong Kong), which is a new blockchain network developed for international game industries, gamers, and game events.

• 한국정보시스템학회:학술대회논문집
• /
• 한국정보시스템학회 2002년도 추계학술대회
• /
• pp.24-46
• /
• 2002

Oracle은 단일의 완벽한 Internet Platform을 제공, Oracle9iAS는 Oracle9i와 함께 인터넷 애플리케이션 작성과 운영에 필요한 모든 것을 제공

• 한국철도학회논문집
• /
• 제19권6호
• /
• pp.777-784
• /
• 2016

본 연구에서는 도시철도에 사용되는 방진체결장치가 현장에서 부담하는 하중의 체계적 평가를 통하여 방진체결장치의 성능시험하중에 대한 기준이 정립되었다. 방진체결장치가 가질 수 있는 동적 강성 범위를 알아보기 위하여 국내에서 공급 가능한 3가지 유형의 방진체결장치들에 대하여 동적 시험을 수행하였다. 이들 방진체결장치에 작용하는 하중을 평가하기 위하여 동적 강성을 변화하면서 차량-궤도 상호작용해석을 수행하였다. 해석의 중요 입력요소인 궤도틀림은 측정자료를 토대로 도출된 궤도틀림 PSD(Power Spectral Density) 회귀 함수로 고려하였다. 도시철도의 다양한 운영환경을 고려하여 방진체결장치에 작용하는 하중을 평가한 후, 평가된 하중을 토대로 방진체결장치의 성능시험하중에 대한 기준을 제시하였다.

• 전기학회논문지
• /
• 제66권11호
• /
• pp.1612-1619
• /
• 2017

In this note, a complete proof of Utkin's theorem is presented for SI(single input) uncertain nonlinear systems. The invariance theorem with respect to the two nonlinear transformation methods so called the two diagonalization methods is proved clearly, comparatively, and completely for SI uncertain nonlinear systems. With respect to the sliding surface and control input transformations, the equation of the sliding mode i.e., the sliding surface is invariant, which is proved completely. Through an illustrative example and simulation study, the usefulness of the main results is verified. By means of the two nonlinear transformation methods, the same results can be obtained.

• 대한수학회보
• /
• 제41권1호
• /
• pp.19-25
• /
• 2004

In our previous paper (Bull. Korean Math. Soc. 37(2000), 493-505), we claimed a theorem on a certain subset of a projective space over a finite field (Theorem 3.1). Recently, however, Professor Kato pointed out that our proof does not work if the field consists of two elements. Here we give an alternative proof of the theorem for the exceptional case.

• 충청수학회지
• /
• 제13권1호
• /
• pp.119-130
• /
• 2000

We give alternative proof of the existence theorem for certain elliptic systems describing competing interactions with nonlinear di usion. The existence of positive solution depends on the sign of the principal eigenvalue of suitable operators of Schr$\ddot{o}$dinger type. If the sign of such operators are both positive, then system has a positive solution. The main tool employed is the fixed point index of compact operator on positive cones.

• 대한수학회논문집
• /
• 제11권2호
• /
• pp.495-501
• /
• 1996

There is currently a regain of interest in ADI (Alternating Direction Implicit) method as a preconditioner for iterative Method for solving large sparse linear systems, because of its suitability for parallel computation. However the classical ADI is not applicable to FE(Finite Element) matrices. In this paper wer propose a Block-ADI method, which is applicable to Finite Element metrices. The new approach is a combination of classical ADI method and domain decompositi on. Also, we provide a partial proof of the convergence based on the results from the regular splittings, in case the discretization metrix is symmetric positive definite.

• Journal of applied mathematics & informatics
• /
• 제23권1_2호
• /
• pp.547-552
• /
• 2007

In this note, we extends some of the results of Liu [Fuzzy Sets and systems 157 (2006) 869-878]. This extension consists of a simple proof involving weighted functions and their preference index. We also give an elementary simple proof of the maximum entropy weighting function problem with a given preference index value without using any advanced theory like variational principles or without using Lagrangian multiplier methods.