• Title/Summary/Keyword: Information Recovery

Search Result 2,228, Processing Time 0.032 seconds

Effective Fragile Watermarking for Image Authentication with High-quality Recovery Capability

  • Qin, Chuan;Chang, Chin-Chen;Hsu, Tai-Jung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2941-2956
    • /
    • 2013
  • In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

GPU-Accelerated Password Cracking of PDF Files

  • Kim, Keon-Woo;Lee, Sang-Su;Hong, Do-Won;Ryou, Jae-Cheol
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.11
    • /
    • pp.2235-2253
    • /
    • 2011
  • Digital document file such as Adobe Acrobat or MS-Office is encrypted by its own ciphering algorithm with a user password. When this password is not known to a user or a forensic inspector, it is necessary to recover the password to open the encrypted file. Password cracking by brute-force search is a perfect approach to discover the password but a time consuming process. This paper presents a new method of speeding up password recovery on Graphic Processing Unit (GPU) using a Compute Unified Device Architecture (CUDA). PDF files are chosen as a password cracking target, and the Abode Acrobat password recovery algorithm is examined. Experimental results show that the proposed method gives high performance at low cost, with a cluster of GPU nodes significantly speeding up the password recovery by exploiting a number of computing nodes. Password cracking performance is increased linearly in proportion to the number of computing nodes and GPUs.

Disaster Recovery Priority Decision of Total Information System for Port Logistics : Fuzzy TOPSIS Approach (항만물류종합정보시스템의 재난복구 우선순위결정 : 퍼지 TOPSIS 접근방법)

  • Kim, Ki-Yoon;Kim, Do-Hyeong
    • Journal of Information Technology Services
    • /
    • v.11 no.3
    • /
    • pp.1-16
    • /
    • 2012
  • This paper is aimed to present a fuzzy decision-making approach to deal with disaster recovery priority decision problem in information system. We derive an evaluation approach based on TOPSIS(Technique for Order Performance by Similarity to Ideal Solution), to help disaster recovery priority decision of total information system for port logistics in a fuzzy environment where the vagueness and subjectivity are handled with linguistic terms parameterized by trapezoidal fuzzy numbers. This study applies the fuzzy multi-criteria decision-making method to determine the importance weight of evaluation criteria and to synthesize the ratings of candidate disaster recovery system. Aggregated the evaluators' attitude toward preference, then TOPSIS is employed to obtain a crisp overall performance value for each alternative to make a final decision. This approach is demonstrated with a real case study involving 4 evaluation criteria(system dependence, RTO, loss, alternative business support), 7 information systems for port logistics assessed by 5 evaluators from Maritime Affairs and Port Office.

Private Key Recovery on Bitcoin with Duplicated Signatures

  • Ko, Ju-Seong;Kwak, Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1280-1300
    • /
    • 2020
  • In the modern financial sector, interest in providing financial services that employ blockchain technology has increased. Blockchain technology is efficient and can operate without a trusted party to store all transaction information; additionally, it provides transparency and prevents the tampering of transaction information. However, new security threats can occur because blockchain technology shares all the transaction information. Furthermore, studies have reported that the private keys of users who use the same signature value two or more times can be recovered. Because private keys of blockchain identify users, private key leaks can result in attackers stealing the ownership rights to users' property. Therefore, as more financial services use blockchain technology, actions to counteract the threat of private key recovery must be continually investigated. Private key recovery studies are presented here. Based on these studies, duplicated signatures generated by blockchain users are defined. Additionally, scenarios that generate and use duplicated signatures are applied in an actual bitcoin environment to demonstrate that actual bitcoin users' private keys can be recovered.

Route Recovery in Content Centric Networks

  • Qamar, Arslan;Kim, Ki-Hyung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.11a
    • /
    • pp.400-401
    • /
    • 2013
  • Mobility in a network causes link disconnections and link recovery is vital for reliability of a network. A link failure affects all the preceding nodes on a damaged routing path; creates communication delay, throughput degradation, and congestion. This paper proposes link recovery mechanisms in CCN based networks. Packet overhearing is used to update neighboring nodes information. The recovery is done by forwarding node resulting in low control overhead, and better efficiency. The proposed mechanisms increase overall performance of a typical CCN and simulation results show that our proposed scheme works very well in densely populated networks with high mobility.

A System Recovery using Hyper-Ledger Fabric BlockChain (하이퍼레저 패브릭 블록체인을 활용한 시스템 복구 기법)

  • Bae, Su-Hwan;Cho, Sun-Ok;Shin, Yong-Tae
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.2
    • /
    • pp.155-161
    • /
    • 2019
  • Currently, numerous companies and institutes provide services using the Internet, and establish and operate Information Systems to manage them efficiently and reliably. The Information System implies the possibility of losing the ability to provide normal services due to a disaster or disability. It is preparing for this by utilizing a disaster recovery system. However, existing disaster recovery systems cannot perform normal recovery if files for system recovery are corrupted. In this paper, we proposed a system that can verify the integrity of the system recovery file and proceed with recovery by utilizing hyper-ledger fabric blockchain. The PBFT consensus algorithm is used to generate the blocks and is performed by the leader node of the blockchain network. In the event of failure, verify the integrity of the recovery file by comparing the hash value of the recovery file with the hash value in the blockchain and proceed with recovery. For the evaluation of proposed techniques, a comparative analysis was conducted based on four items: existing system recovery techniques and data consistency, able to data retention, recovery file integrity, and using the proposed technique, the amount of traffic generated was analyzed to determine whether it was actually applicable.

Development and Application of Risk Recovery Index using Machine Learning Algorithms (기계학습알고리즘을 이용한 위험회복지수의 개발과 활용)

  • Kim, Sun Woong
    • Journal of Information Technology Applications and Management
    • /
    • v.23 no.4
    • /
    • pp.25-39
    • /
    • 2016
  • Asset prices decline sharply and stock markets collapse when financial crisis happens. Recently we have encountered more frequent financial crises than ever. 1998 currency crisis and 2008 global financial crisis triggered academic researches on early warning systems that aim to detect the symptom of financial crisis in advance. This study proposes a risk recovery index for detection of good opportunities from financial market instability. We use SVM classifier algorithms to separate recovery period from unstable financial market data. Input variables are KOSPI index and V-KOSPI200 index. Our SVM algorithms show highly accurate forecasting results on testing data as well as training data. Risk recovery index is derived from our SVM-trained outputs. We develop a trading system that utilizes the suggested risk recovery index. The trading result records very high profit, that is, its annual return runs to 121%.

Recovery Methods in Main Memory DBMS

  • Kim, Jeong-Joon;Kang, Jeong-Jin;Lee, Ki-Young
    • International journal of advanced smart convergence
    • /
    • v.1 no.2
    • /
    • pp.26-29
    • /
    • 2012
  • Recently, to efficiently support the real-time requirements of RTLS( Real Time Location System) services, interest in the main memory DBMS is rising. In the main memory DBMS, because all data can be lost when the system failure happens, the recovery method is very important for the stability of the database. Especially, disk I/O in executing the log and the checkpoint becomes the bottleneck of letting down the total system performance. Therefore, it is urgently necessary to research about the recovery method to reduce disk I/O in the main memory DBMS. Therefore, In this paper, we analyzed existing log techniques and check point techniques and existing main memory DBMSs' recovery techniques for recovery techniques research for main memory DBMS.

A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss

  • Baek, Jin-Suk;Paris, Jehan-Francois
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.2 no.2
    • /
    • pp.82-102
    • /
    • 2008
  • Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

A Study on the Difference in Expectation-Performance of Service Recovery Measurement Scale's 4 Dimensions both Korean Native Cattle Beef and Imported Beef Restaurant

  • Cho, Yoon-Shik;Lee, Mi-Ock
    • Journal of the Korean Data and Information Science Society
    • /
    • v.19 no.4
    • /
    • pp.1123-1131
    • /
    • 2008
  • A considerable amount of research has focused on the dimensionality of service failure and recovery construct. This paper is focused on service failure and recovery in the Korean native cattle and imported beef restaurant industry in the Korea. So, this paper has adapted Kau and Loh's Service recovery measurement scale so that restaurant managers can use it to determine how customers perceive the service quality in Korean native cattle beef restaurant and imported beef restaurant. The purpose of this research is to test the difference in pre-purchase expectation and post-purchase actual performance of 4 dimensions between the restaurants that sell the beef of Korean native cattle and imported cattle. The paired t -test is used to test difference of pre-purchase expectation and post-purchase actual performance for service recovery measurement scale's 4 dimensions of the 2 restaurant types. But, there is significant difference between pre-purchase expectation and post-purchase actual performance in the 2 restaurant types.

  • PDF