• Title/Summary/Keyword: Secret Data

Search Result 370, Processing Time 0.027 seconds

Blockchain applied Military Electronic Secret Document Management Scheme (focused on C4i) (블록체인을 적용한 군(軍) 전자적 비밀관리 개선방안 (전장관리정보체계 중심으로))

  • Hong Yoon;Yeong Gyun Cha;Jong Beom Park
    • Convergence Security Journal
    • /
    • v.23 no.5
    • /
    • pp.181-187
    • /
    • 2023
  • Recently, military operations have been aimed at winning using various information, analysis, weapons, and operation systems. These systems should consist of integrated composition and the function of analyzing and sharing data. Accordingly, military C4I collects and analyzes a lot of data and produces and shares secrets to perform effective operations. However, C4I cannot operate in electronic form from secret production to disposal. And as it is managed based on the output, problems such as difficulty in management and loss/leakage arise. Therefore, in this paper, we propose an ESDMB(Electronic Secret Document Management whit Bloockchain) plan based on blockchain technology to manage all secrets in electronic document format and provide integrity and denial prevention. In particular, the blockchain-based proposal method will be suitable as a protection measure against manipulation and leakage, from secret production to destruction.

Adaptive data hiding scheme based on magic matrix of flexible dimension

  • Wu, Hua;Horng, Ji-Hwei;Chang, Chin-Chen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3348-3364
    • /
    • 2021
  • Magic matrix-based data hiding schemes are applied to transmit secret information through open communication channels safely. With the development of various magic matrices, some higher dimensional magic matrices are proposed for improving the security level. However, with the limitation of computing resource and the requirement of real time processing, these higher dimensional magic matrix-based methods are not advantageous. Hence, a kind of data hiding scheme based on a single or a group of multi-dimensional flexible magic matrices is proposed in this paper, whose magic matrix can be expanded to higher dimensional ones with less computing resource. Furthermore, an adaptive mechanism is proposed to reduce the embedding distortion. Adapting to the secret data, the magic matrix with least distortion is chosen to embed the data and a marker bit is exploited to record the choice. Experimental results confirm that the proposed scheme hides data with high security and a better visual quality.

Reversible Data Hiding Algorithm Based on Pixel Value Ordering and Edge Detection Mechanism

  • Nguyen, Thai-Son;Tram, Hoang-Nam;Vo, Phuoc-Hung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.10
    • /
    • pp.3406-3418
    • /
    • 2022
  • Reversible data hiding is an algorithm that has ability to extract the secret data and to restore the marked image to its original version after data extracting. However, some previous schemes offered the low image quality of marked images. To solve this shortcoming, a new reversible data hiding scheme based on pixel value ordering and edge detection mechanism is proposed. In our proposed scheme, the edge image is constructed to divide all pixels into the smooth regions and rough regions. Then, the pixels in the smooth regions are separated into non overlapping blocks. Then, by taking advantages of the high correlation of current pixels and their adjacent pixels in the smooth regions, PVO algorithm is applied for embedding secret data to maintain the minimum distortion. The experimental results showed that our proposed scheme obtained the larger embedding capacity. Moreover, the greater image quality of marked images are achieved by the proposed scheme than that other previous schemes while the high EC is embedded.

High-Secure Multivariable Knapsack Cryptosystem (안전성이 높은 다변수 Knapsack 암호시스템)

  • Lee, Byeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.4
    • /
    • pp.611-618
    • /
    • 1995
  • In the high information societies, the requirement of encryption security is increasing so as to protect information from the threat of attacks by illegal changes of data, illegal leakage of data, disorder of data sequences and the unauthorized sender and an unauthorized receiver etc. In this paper, multivariable knapsack crytosystem is proposed for security of computer communication. This system is securer and simpler than the conventional knapsack cryptosystems. And, proposed cryptosystem composed what represented each element of superincreasing vector with multivar able polynomial after transforming it of ciphervector. For the deciphering of ciphertext, the plaintext is determined by using the integers of secret and the superincreasing vector of secret key. Thus, the stability of this cryptosystem is based on the difficulty of obtaining the root that ciphervector becomes the superincreasing vector, in substituting the integers of secret for ciphervector to represent with the miltivariable polynomial. The propriety of proposed multivariable knapsack cryptosystem was proved through computer simulation.

  • PDF

Efficient Secret Sharing Data Management Scheme for Privacy Protection in Smart Grid Environment (스마트 그리드 환경에서 개인정보 보호를 위한 효율적인 비밀분산 데이터 관리 방안)

  • Lee, Sung-Yong;Yeo, Sang-Soo
    • Journal of Digital Convergence
    • /
    • v.11 no.12
    • /
    • pp.311-318
    • /
    • 2013
  • It is very important to design security policy and technical framework on sensitive private data in order to protect user privacy in smart grid environment. This paper introduces secret data sharing schemes proposed for privacy protection in smart grid, and presents technical problems of them. The proposed scheme in this paper, reduces the number of rounds in sharing process and also in restoration process, and can select how many databases would be used, so eventually it shows enhancements in terms of efficiency and security.

Security Analysis on GFN with Secret S-box (비밀 S-box를 사용한 GFN에 대한 안전성 분석)

  • Lee, Yongseong;Kang, HyungChul;Hong, Deukjo;Sung, Jaechul;Hong, Seokhie
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.3
    • /
    • pp.467-476
    • /
    • 2017
  • In this paper, we analyze Generalized Feistel Network(GFN) Type I, Type II, Type III that round function use SP update function, secret S-box and $k{\times}k$ MDS matirx. In this case an attacker has no advantage about S-box. For each type of GFN, we analyze and restore secret S-box in 9, 6, 6 round using the basis of integral cryptanalysis with chosen plaintext attack. Also we restore secret S-box in 16 round of GFN Type I with chosen ciphertext attack. In conclusion, we need $2^{2m}$ data complexity and ${\frac{2^{3m}}{32k}},{\frac{2^{3m}}{24k}},{\frac{2^{3m}}{36k}}$ time complexity to restore m bit secret S-box in GFN Type I, Type II, Type III.

Reversible Data Hiding in JPEG Images Using Ordered Embedding

  • Qian, Zhenxing;Dai, Shu;Chen, Boyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.945-958
    • /
    • 2017
  • This paper proposes a novel method of reversible data hiding in JPEG images. After analyzing the JPEG features, we provide a new algorithm of selecting appropriate blocks and coefficients to carry secret messages. Instead of embedding data into the histogram of all coefficients, we propose a strategy of ordered embedding to hide data by histogram shifts in several rounds. On the recipient end, secret messages can be exactly extracted, and the original JPEG image can be losslessly recovered. Experimental results show that high embedding rate can be achieved with limited distortions. Most importantly, the marked JPEG file generated by the proposed method requires less storage size than state-of-the-art works.

An effective detection method for hiding data in compound-document files (복합문서 파일에 은닉된 데이터 탐지 기법에 대한 연구)

  • Kim, EunKwang;Jeon, SangJun;Han, JaeHyeok;Lee, MinWook;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.6
    • /
    • pp.1485-1494
    • /
    • 2015
  • Traditionally, data hiding has been done mainly in such a way that insert the data into the large-capacity multimedia files. However, the document files of the previous versions of Microsoft Office 2003 have been used as cover files as their structure are so similar to a File System that it is easy to hide data in them. If you open a compound-document file which has a secret message hidden in it with MS Office application, it is hard for users who don't know whether a secret message is hidden in the compound-document file to detect the secret message. This paper presents an analysis of Compound-File Binary Format features exploited in order to hide data and algorithms to detect the data hidden with these exploits. Studying methods used to hide data in unused area, unallocated area, reserved area and inserted streams led us to develop an algorithm to aid in the detection and examination of hidden data.

Medical Image Authentication over Public Communication Networks using Secret Watermark

  • Oh Keun-Tak;Kim Young-Ho;Lee Yun-Bae
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.3
    • /
    • pp.167-171
    • /
    • 2004
  • The evolution of modern imaging modalities, followed by the rapid development of computer technology has introduced many new features in the communication networks used in medical facilities. Since it is very important to keep patient's record accurately, the ability to exchange medical data securely over the communication network is essential for any medical information. In this paper, therefore, we introduce some problems which occur from digitizing medical images such as MRI (Magnetic Resonance Imaging), CT (Computed Tomography), CR(Computed Radiography), etc., and then we propose a authentication mechanism for medical image verification using secret watermark images.

Keyed learning: An adversarial learning framework-formalization, challenges, and anomaly detection applications

  • Bergadano, Francesco
    • ETRI Journal
    • /
    • v.41 no.5
    • /
    • pp.608-618
    • /
    • 2019
  • We propose a general framework for keyed learning, where a secret key is used as an additional input of an adversarial learning system. We also define models and formal challenges for an adversary who knows the learning algorithm and its input data but has no access to the key value. This adversarial learning framework is subsequently applied to a more specific context of anomaly detection, where the secret key finds additional practical uses and guides the entire learning and alarm-generating procedure.