• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.558-579
• /
• 2021

The cloud storage provides flexible data storage services for data owners to remotely outsource their data, and reduces data storage operations and management costs for data owners. These outsourced data bring data security concerns to the data owner due to malicious deletion or corruption by the cloud service provider. Data integrity verification is an important way to check outsourced data integrity. However, the existing data verification schemes only consider the case that a verifier launches multiple data verification challenges, and neglect the verification overhead of multiple data verification challenges launched by multiple verifiers at a similar time. In this case, the duplicate data in multiple challenges are verified repeatedly so that verification resources are consumed in vain. We propose a duplicate data verification algorithm based on multiple verifiers and multiple challenges to reduce the verification overhead. The algorithm dynamically schedules the multiple verifiers' challenges based on verification time and the frequent itemsets of duplicate verification data in challenge sets by applying FP-Growth algorithm, and computes the batch proofs of frequent itemsets. Then the challenges are split into two parts, i.e., duplicate data and unique data according to the results of data extraction. Finally, the proofs of duplicate data and unique data are computed and combined to generate a complete proof of every original challenge. Theoretical analysis and experiment evaluation show that the algorithm reduces the verification cost and ensures the correctness of the data integrity verification by flexible batch data verification.

• 인터넷정보학회논문지
• /
• 제4권4호
• /
• pp.53-64
• /
• 2003

사용자 어플리케이션에서 인증서의 검증 과정을 모두 수행하는 것은 복잡하고 시간 소비적인 작업으로서 사용자 측에 상당한 부담을 줄 수 있다. 특히, 인증서의 서명을 검증하는 작업은 인증 경로상의 모든 인증서들에 대한 암호화 계산을 필요로 하기 때문에 이로 인한 연산적인 부담은 전체 검증 작업 부담의 대부분을 차지하게 된다. 본 논문에서는 인증서 검증 작업 중 서명 검증 작업을 PKI 영역내의 CA들에게 위임함으로서 사용자측의 검증 작업에 대한 부담을 줄일 수 있는 DSVP(Delegated Signature Validation Protocol)를 이용한 새로운 인증서 검증 기법을 제안하였다. 제안한 DSVP는 사용자와 CA들 간의 수행되는 프로토콜로서, 계층적 PKI에서 효율적으로 적용되며 서명 검증 위임 작업이 안전하고 신뢰성 있게 수행되도록 한다. 제안한 기법은 사용자 측의 암호화 계산을 줄이고 상위 CA들을 검증 작업에 가담시킴으로서, 사용자 측의 검증 작업에 대한 부담을 줄임과 동시에 PKI 영역의 정적인 CA들의 활용도를 높이는 효과를 가져올 수 있다.

• Journal of Information Technology Applications and Management
• /
• 제18권3호
• /
• pp.61-72
• /
• 2011

Trust for the data created, processed and transferred on e-Science environments can be estimated with provenance. The information to form provenance, which says how the data was created and reached its current state, increases as data evolves. It is a heavy burden to trace and verify the massive provenance in order to trust data. On the other hand, it is another issue how to trust the verification of data with provenance. This paper proposes a fast and exact verification of inter-domain data transfer and data origin for e-Science environment based on PKI. The verification, which is called two-way verification, cuts down the tracking overhead of the data along the causality presented on Open Provenance Model with the domain specialty of e-Science environment supported by Grid Security Infrastructure (GSI). The proposed scheme is easy-applicable without an extra infrastructure, scalable irrespective of the number of provenance records, transparent and secure with cryptography as well as low-overhead.

• 정보보호학회논문지
• /
• 제13권6호
• /
• pp.55-65
• /
• 2003

사용자 어플리케이션에서 인증서 검증 과정을 모두 수행하는 것은 복잡하고 시간 소비적인 작업으로서 사용자 측에 상당한 부담을 줄 수 있다. 특히, 인증서의 서명을 검증하는 작업은 인증 경로 상의 모든 인증서들에 대한 암호화 계산이 수반되기 때문에 부담의 큰 원인이 된다. 본 논문에서는 사용자가 계층적 PKI 영역의 인증 기관 (Certificate Authority：CA)들에게 안전하고 신뢰성 있게 서명 검증 작업을 위임함으로서 인증서 검증 작업에 대한 사용자 측 부담을 줄이고 CA들의 활용도를 높일 수 있는 효율적인 인증서 검증 방식을 제안하였다. 제안한 방식은 기존 검증 방식의 암호화 계산으로 인한 부담을 감소시키고 CA들의 검증 작업의 참여로 인해 정적인 CA들을 동적으로 활용할 수 있다.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제2권5호
• /
• pp.217-222
• /
• 2013

Return-Oriented Programming(ROP)는 기존 return-to-libc의 발전된 형태로 프로그램의 코드 영역에 있는 가젯을 조합하여 공격자가 원하는 모든 기능을 수행할 수 있는 코드 재사용 공격 기법이다. ROP 공격을 방어하는 기존 방어 기법들은 동적 실행 흐름 분석으로 인한 높은 성능 부하를 보이거나 ROP 공격에 대한 부분적인 방어만 가능하였다. 본 논문에서 제시하는 간접 분기 목적 주소 검증 기법(Indirect Branch Target Address Verification)은 간접 분기문의 목적 주소가 유효한지 검사해서 ROP 공격을 탐지하며, ROP 공격의 대부분을 방어할 수 있다. 또한 동적 실행 흐름 분석이 필요 없기 때문에 낮은 성능 부담을 보인다. SPEC CPU 2006 벤치마크를 대상으로 한 성능평가에서 15%보다 적은 성능 부하를 보였다.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2010년도 하계학술대회 논문집
• /
• pp.115-115
• /
• 2010

This paper introduces a measurement system that measures behavior and electrical characteristics of overhead contact line irregular sections in real-time. For verification, we developed a prototype of the real-time overhead contact line irregular section behavior measurement system and a monitoring system for field tests. The current and temperature of contact wires and messenger wires were measured real-time by applying the system at KTX a commercial line. Therefore, acquiring data is possible with the developed system and this system that measures one of the fundamental and key factors, the catenary current, should be applicable to various areas such as detecting characteristics for designing overhead contact lines, enhancing speed, and enhancing energy.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.857-860
• /
• 1999

It is made possible a removal of the preamble for carrier recovery and symbol-timing recovery by storing a burst in memory with low overhead QPSK demodulation and this demodulation method also effects frame efficiency improved by processed synchronization performance. In this paper, we have proposed that new algorithm for arc-tangent look-up table which transform the input I, Q data by phase. This I, Q data plays an important role in demodulation and makes demodulator with low-overhead by storing a burst in memory. To evaluate proposed new algorithm and symbol-timing recovery method, function simulation and timing verification have been done by using synopsys VHDL tool.

• 한국전기전자재료학회논문지
• /
• 제22권10호
• /
• pp.864-869
• /
• 2009

The measurement of contact wire uplift in electric railways is one of the most important test parameters to accepting the maximum permitted speed of new electric vehicles and pantographs. The contact wire uplift can be measured over short periods when the pantograph passes monitoring stations. In this paper, a high-speed image measurement system and its image processing method are being developed to evaluate dynamic uplift of overhead contact wires caused by pantograph contact forces of Korea Tilting Train eXpress (TTX) and Korea Train eXpress (KTX). The image measurement system was implemented utilizing a high-speed CMOS (Complementary Metal Oxide Semiconductor) camera and gigabit ethernet LAN. Unlike previous systems, the uplift measurement system using high speed camera is installed on the side of the rail, making maintenance convenient. On-field verification of the uplift measurement system for overhead contact wire using high speed camera was conducted by measuring uplift of the TTX followed by operation speeds at the Honam conventional line and high-speed railway line. The proposed high-speed image measurement system to evaluate dynamic uplift of overhead contact wires shows promising on-field applications for high speed trains such as KTX and TTX.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.592-599
• /
• 2014

Cloud computing enables users to easily store their data and simply share data with others. Due to the security threats in an untrusted cloud, users are recommended to compute verification metadata, such as signatures, on their data to protect the integrity. Many mechanisms have been proposed to allow a public verifier to efficiently audit cloud data integrity without receiving the entire data from the cloud. However, to the best of our knowledge, none of them has considered about the efficiency of public verification on multi-owner data, where each block in data is signed by multiple owners. In this paper, we propose a novel public verification mechanism to audit the integrity of multi-owner data in an untrusted cloud by taking the advantage of multisignatures. With our mechanism, the verification time and storage overhead of signatures on multi-owner data in the cloud are independent with the number of owners. In addition, we demonstrate the security of our scheme with rigorous proofs. Compared to the straightforward extension of previous mechanisms, our mechanism shows a better performance in experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권2호
• /
• pp.617-636
• /
• 2021

This paper presents a privacy-preserving data aggregation scheme deals with the multidimensional data. It is essential that the multidimensional data is rarely mentioned in all researches on smart grid. We use the Paillier Cryptosystem and blinding factor technique to encrypt the multidimensional data as a whole and take advantage of the homomorphic property of the Paillier Cryptosystem to achieve data aggregation. Signature and efficient batch verification have also been applied into our scheme for data integrity and quick verification. And the efficient batch verification only requires 2 pairing operations. Our scheme also supports fault tolerance which means that even some smart meters don't work, our scheme can still work well. In addition, we give two extensions of our scheme. One is that our scheme can be used to compute a fixed user's time-of-use electricity bill. The other is that our scheme is able to effectively and quickly deal with the dynamic user situation. In security analysis, we prove the detailed unforgeability and security of batch verification, and briefly introduce other security features. Performance analysis shows that our scheme has lower computational complexity and communication overhead than existing schemes.