• 제목/요약/키워드: secret communication

검색결과 272건 처리시간 0.031초

Secret Key Generation from Common Randomness over Ultra-wideband Wireless Channels

  • Huang, Jing Jing;Jiang, Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권10호
    • /
    • pp.3557-3571
    • /
    • 2014
  • We develop a secret key generation scheme using phase estimation in ultra-wideband (UWB) wireless fading channels. Based on the reciprocity theorem, two terminals extract the phase of the channel as a common random source to generate secret bits. Moreover, we study the secret key rate by a pair of nodes observing correlated sources and communicating to achieve secret key agreement over public communication channels. As our main results, we establish a more practical upper bound from Cramer-Rao bound (CRB) and compare it with a universally theoretical upper bound on the shared maximum key rate from mutual information of correlated random sources. Derivation and numerical examples are presented to demonstrate the bound. Simulation studies are also provided to validate feasibility and efficiency of the proposed scheme.

An Intelligent 2D Secret Share Construction using Visual Cryptography for Secure Transmission

  • Kumar, N. Rajesh;Krishnan, R. Bala;Manikandan, G.;Raajan, N.R.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권7호
    • /
    • pp.2862-2878
    • /
    • 2020
  • Data Security is the most challenging area in Internet communication, where most of the secret sharing schemes are proposed for binary images. But still it lacks in providing security for data communication, especially in image transmission. Traditional visual cryptography scheme generate meaningless diwies and the reconstruction phase leads to quality degradation over the secret image. In this work, an intelligent two dimensional secret share construction scheme is proposed. A secret image is expanded into n diwies with the choice of scheme selection. By Stacking all the qualified diwies to revert the secret image without content loss and less than s* - 1 shares could not reveal any information about the secret image. The experimental results emphasize that the proposed secret share scheme is highly secured for image transmission.

Constructive Steganography by Tangles

  • Qian, Zhenxing;Pan, Lin;Huang, Nannan;Zhang, Xinpeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권8호
    • /
    • pp.3911-3925
    • /
    • 2018
  • This paper proposes a novel steganography method to hide secret data during the generation of tangle patterns. Different from the traditional steganography based on modifying natural images, we propose to construct stego images according to the secret messages. We first create a model to group a selected image contour, and define some basic operations to generate various pattern cells. During data hiding, we create a cell library to establish the relationships between cells and secret data. By painting the cell inside the image contour, we create a dense tangle pattern to carry secret data. With the proposed method, a recipient can extract the secret data correctly. Experimental results show that the proposed method has a flexible embedding capacity. The constructed stego tangle image has good visual effects, and is secure against adversaries. Meanwhile, the stego tangle pattern is also robust to JPEG compression.

양자키 교환과 AES를 이용한 비밀통신 연구 (Research of Secret Communication Using Quantum key Distribution and AES)

  • 정영철;임광철
    • 한국정보통신학회논문지
    • /
    • 제18권1호
    • /
    • pp.84-90
    • /
    • 2014
  • 비밀통신의 발전은 아날로그 통신에서 디지털 통신으로 진보해 왔다. 디지털통신상의 비밀통신은 one-time pad의 안전성을 승계하여 주로 설계 되어 왔다. One-time pad의 안전성은 상호 보관하는 비밀키의 안전성에 기인하고 비밀키의 교환에 의한 상호 동기화가 가장 중요한 요소이다. 본 논문에서는 quantum cryptography system 중 BB84 알고리즘의 수학적 안전도를 살펴보고 이를 이용하여 양자 키 전송을 시행한다. 생성된 키는 개인의 각 단말에서 AES의 64번 라운드를 시행한 ciphertext을 상호 교환하는 One-time Pad 형 알고리즘을 제안한다.

음성통신 중 웨이브렛 계수 양자화를 이용한 비밀정보 통신 방법 (Secret Data Communication Method using Quantization of Wavelet Coefficients during Speech Communication)

  • 이종관
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2006년도 가을 학술발표논문집 Vol.33 No.2 (D)
    • /
    • pp.302-305
    • /
    • 2006
  • In this paper, we have proposed a novel method using quantization of wavelet coefficients for secret data communication. First, speech signal is partitioned into small time frames and the frames are transformed into frequency domain using a WT(Wavelet Transform). We quantize the wavelet coefficients and embedded secret data into the quantized wavelet coefficients. The destination regard quantization errors of received speech as seceret dat. As most speech watermark techniques have a trade off between noise robustness and speech quality, our method also have. However we solve the problem with a partial quantization and a noise level dependent threshold. In additional, we improve the speech quality with de-noising method using wavelet transform. Since the signal is processed in the wavelet domain, we can easily adapt the de-noising method based on wavelet transform. Simulation results in the various noisy environments show that the proposed method is reliable for secret communication.

  • PDF

배타적 논리합을 사용한 DCT 기반의 비밀공유 (Secret Sharing based on DCT using XOR)

  • 김천식
    • 한국인터넷방송통신학회논문지
    • /
    • 제14권4호
    • /
    • pp.13-19
    • /
    • 2014
  • 일반적으로 회사의 중요한 비밀을 한명이 소유하고 있다면 해킹과 같은 방법에 매우 취약할 수밖에 없다. 이와같은 문제를 해결할 수 있는 방안으로 탄생한 것이 비밀공유이다. 비밀을 중요한 한사람이 아닌 여러 명이 나누어 보관함으로써 한명이 누군가에 의해서 비밀을 도난당하더라도 복구할 수 있다는 개념에서 출발하였다. 즉, 비밀 정보를 도난으로부터 지킬 수 있는 강한 방법으로 비밀공유 방법이 제안되었다. 지금까지의 대부분의 방법은 공간영역에 기반을 둔 방법이었다. 이 방법은 간단한 포맷 변환만으로 쉽게 영상의 변형이 일어나므로 원래 은닉된 데이터가 제거된다. 본 논문에서는 JPG의 DCT 기반에 의해서 비밀을 배타적 논리합에 의해서 분배함으로써 이미지에 대한 공격에 보다 강한 면을 보완하고자 제안 하였다. 실험결과 원본 비밀을 정확해 복구할 수 있음을 실험을 통해서 입증하였다.

High capacity multi-bit data hiding based on modified histogram shifting technique

  • Sivasubramanian, Nandhini;Konganathan, Gunaseelan;Rao, Yeragudipati Venkata Ramana
    • ETRI Journal
    • /
    • 제40권5호
    • /
    • pp.677-686
    • /
    • 2018
  • A novel data hiding technique based on modified histogram shifting that incorporates multi-bit secret data hiding is proposed. The proposed technique divides the image pixel values into embeddable and nonembeddable pixel values. Embeddable pixel values are those that are within a specified limit interval surrounding the peak value of an image. The limit interval is calculated from the number of secret bits to be embedded into each embeddable pixel value. The embedded secret bits can be perfectly extracted from the stego image at the receiver side without any overhead bits. From the simulation, it is found that the proposed technique produces a better quality stego image compared to other data hiding techniques, for the same embedding rate. Since the proposed technique only embeds the secret bits in a limited number of pixel values, the change in the visual quality of the stego image is negligible when compared to other data hiding techniques.

Secret Key Generation Using Reciprocity in Ultra-wideband Outdoor Wireless Channels

  • Huang, Jing Jing;Jiang, Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.524-539
    • /
    • 2014
  • To investigate schemes of secret key generation from Ultra-wideband (UWB) channel, we study a statistical characterization of UWB outdoor channel for a campus playground scenario based on extensive measurements. Moreover, an efficient secret key generation mechanism exploiting multipath relative delay is developed, and verification of this algorithm is conducted in UWB Line-of-sight (LOS) outdoor channels. For the first time, we compare key-mismatch probability of UWB indoor and outdoor environments. Simulation results demonstrate that the number of multipath proportionally affects key generation rate and key-mismatch probability. In comparison to the conventional method using received signal strength (RSS) as a common random source, our mechanism achieves better performance in terms of common secret bit generation. Simultaneously, security analysis indicates that the proposed scheme can still guarantee security even in the sparse outdoor physical environment free of many reflectors.

Web Server Cluster's Load Balancing for Security Session

  • Kim Seok-Soo
    • Journal of information and communication convergence engineering
    • /
    • 제3권2호
    • /
    • pp.93-95
    • /
    • 2005
  • In order to create security session, security keys are preconfigured between communication objects. For this purpose, Handshake Protocol exists. The pre-master secret key that is used in this process needs to interpreted by a server to create master secret key, whose process requires a big calculation, resulting in deteriorating system's transmission performance. Therefore, it is helpful in increasing transmission speed to reuse secret keys rather than to create them at every connection.

데이터 은닉과 멀티플렉서 기법을 이용한 (2, 2) 비밀 공유방법 ((2, 2) Secret Sharing Using Data Hiding and Multiplexer Technique)

  • 김천식
    • 한국인터넷방송통신학회논문지
    • /
    • 제13권4호
    • /
    • pp.75-81
    • /
    • 2013
  • 본 논문은 회색(Gray-scale) 이미지를 기반으로 (2, 2) 비밀 공유(Secret Sharing) 계획을 제안한다. 일반적으로 비밀 공유 방법은 비밀 이미지를 두개이상의 이미지 (그림자 이미지: Shadow Image)로 분배한 후, 그림자 이미지를 참가자(비밀 공유하는 사람)에게 나누어준다. 이 후 참가자들이 비밀을 보기위해 k(k