• 제목/요약/키워드: Combination Key Generation

검색결과 30건 처리시간 0.021초

결합키 생성항목의 갱신에 강건한 결합키 생성 기법 (Combination Key Generation Scheme Robust to Updates of Personal Information)

  • 장호빈;노건태;정익래;천지영
    • 정보보호학회논문지
    • /
    • 제32권5호
    • /
    • pp.915-932
    • /
    • 2022
  • 개인정보 보호법과 가명정보 처리 가이드라인에 따르면, 서로 다른 결합신청자들이 결합을 희망할 때 Salt값을 포함한 결합키 생성항목의 해시값으로 매핑을 진행한다. 결합키 생성항목의 예시로는 성명, 전화번호, 생년월일, 주소 등의 개인정보가 될 수 있으며, 해시 함수의 특성상 서로 다른 결합신청자들이 이들의 항목을 정확히 동일한 형태로 저장하고 있을 때 문제없이 결합을 진행할 수 있다. 하지만 이러한 기법은 서로 다른 결합신청자들의 데이터베이스 갱신 시점이 달라서 발생하는 주소 변경, 개명 등의 시나리오에서의 결합은 취약하다. 따라서 본 연구에서 우리는 주소 변경, 개명 등의 결합키 생성항목이 갱신된 시나리오에서도 개인정보보호를 만족하는 강건한 결합키 생성기법을 확률적 자료 연계를 통한 임계값을 바탕으로 제안하며, 본 연구 결과를 활용한 국내 빅데이터 및 인공지능 사업의 발전에 기여하고자 한다.

PRaCto: Pseudo Random bit generator for Cryptographic application

  • Raza, Saiyma Fatima;Satpute, Vishal R
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권12호
    • /
    • pp.6161-6176
    • /
    • 2018
  • Pseudorandom numbers are useful in cryptographic operations for using as nonce, initial vector, secret key, etc. Security of the cryptosystem relies on the secret key parameters, so a good pseudorandom number is needed. In this paper, we have proposed a new approach for generation of pseudorandom number. This method uses the three dimensional combinational puzzle Rubik Cube for generation of random numbers. The number of possible combinations of the cube approximates to 43 quintillion. The large possible combination of the cube increases the complexity of brute force attack on the generator. The generator uses cryptographic hash function. Chaotic map is being employed for increasing random behavior. The pseudorandom sequence generated can be used for cryptographic applications. The generated sequences are tested for randomness using NIST Statistical Test Suite and other testing methods. The result of the tests and analysis proves that the generated sequences are random.

Identification of Plasmid-Free Chlamydia muridarum Organisms Using a Pgp3 Detection-Based Immunofluorescence Assay

  • Chen, Chaoqun;Zhong, Guangming;Ren, Lin;Lu, Chunxue;Li, Zhongyu;Wu, Yimou
    • Journal of Microbiology and Biotechnology
    • /
    • 제25권10호
    • /
    • pp.1621-1628
    • /
    • 2015
  • Chlamydia possesses a conserved 7.5 kb plasmid that is known to play an important role in chlamydial pathogenesis, since some chlamydial organisms lacking the plasmid are attenuated. The chlamydial transformation system developed recently required the use of plasmid-free organisms. Thus, the generation and identification of plasmid-free organisms represent a key step in understanding chlamydial pathogenic mechanisms. A tricolor immunofluorescence assay for simultaneously detecting the plasmid-encoded Pgp3 and whole organisms plus DNA staining was used to screen C. muridarum organisms selected with novobiocin. PCR was used to detect the plasmid genes. Next-generation sequencing was then used to sequence the genomes of plasmid-free C. muridarum candidates and the parental C. muridarum Nigg strain. We generated five independent clones of plasmid-free C. muridarum organisms by using a combination of novobiocin treatment and screening plaque-purified clones with anti-Pgp3 antibody. The clones were confirmed to lack plasmid genes by PCR analysis. No GlgA protein or glycogen accumulation was detected in cells infected with the plasmid-free clones. More importantly, whole-genome sequencing characterization of the plasmid-free C. muridarum organism and the parental C. muridarum Nigg strain revealed no additional mutations other than loss of the plasmid in the plasmid-free C. muridarum organism. Thus, the Pgp3-based immunofluorescence assay has allowed us to identify authentic plasmid-free organisms that are useful for further investigating chlamydial pathogenic mechanisms.

클라우드 컴퓨팅 환경에 적합한 그룹 키 관리 프로토콜 (Group key management protocol adopt to cloud computing environment)

  • 김용태;박길철
    • 디지털융복합연구
    • /
    • 제12권3호
    • /
    • pp.237-242
    • /
    • 2014
  • IT 서비스 및 컴퓨팅 자원을 기반으로 인터넷 서비스를 제공하는 클라우드 컴퓨팅이 최근 큰 관심을 받고 있다. 그러나 클라우드 컴퓨팅 시스템에 저장되는 데이터는 암호화한 후 저장되어도 기밀 정보가 유출되는 문제점이 있다. 본 논문에서는 사용자가 클라우드 컴퓨팅 시스템에서 제공되는 데이터를 제 3자가 임의로 악용하는 것을 예방하기 위한 그룹 키 관리 프로토콜을 제안한다. 제안된 프로토콜은 임의의 사용자가 원격에서 클라우드 컴퓨팅 서버에 접근할 경우 서버에 존재하는 사용자 인증 데이터베이스내 사용자 정보를 일방향 해쉬 함수와 XOR 연산을 사용하여 사용자 인증을 제공받는다. 도한 사용자의 신분확인 및 권한을 연동하여 클라우드 컴퓨팅 시스템에 불법적으로 접근하는 사용자를 탐색함으로써 클라우드 컴퓨팅의 사용자 보안 문제를 해결하고 있다.

A Comprehensive Study on Key Components of Grayscale-based Deepfake Detection

  • Seok Bin Son;Seong Hee Park;Youn Kyu Lee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제18권8호
    • /
    • pp.2230-2252
    • /
    • 2024
  • Advances in deep learning technology have enabled the generation of more realistic deepfakes, which not only endanger individuals' identities but also exploit vulnerabilities in face recognition systems. The majority of existing deepfake detection methods have primarily focused on RGB-based analysis, offering unreliable performance in terms of detection accuracy and time. To address the issue, a grayscale-based deepfake detection method has recently been proposed. This method significantly reduces detection time while providing comparable accuracy to RGB-based methods. However, despite its significant effectiveness, the "key components" that directly affect the performance of grayscale-based deepfake detection have not been systematically analyzed. In this paper, we target three key components: RGB-to-grayscale conversion method, brightness level in grayscale, and resolution level in grayscale. To analyze their impacts on the performance of grayscale-based deepfake detection, we conducted comprehensive evaluations, including component-wise analysis and comparative analysis using real-world datasets. For each key component, we quantitatively analyzed its characteristics' performance and identified differences between them. Moreover, we successfully verified the effectiveness of an optimal combination of the key components by comparing it with existing deepfake detection methods.

A novel framework for the construction of cryptographically secure S-boxes

  • Razi Arshad;Mudassir Jalil;Muzamal Hussain;Abdelouahed Tounsi
    • Computers and Concrete
    • /
    • 제34권1호
    • /
    • pp.79-91
    • /
    • 2024
  • In symmetric cryptography, a cryptographically secure Substitution-Box (S-Box) is a key component of a block cipher. S-Box adds a confusion layer in block ciphers that provide resistance against well-known attacks. The generation of a cryptographically secure S-Box depends upon its generation mechanism. In this paper, we propose a novel framework for the construction of cryptographically secure S-Boxes. This framework uses a combination of linear fractional transformation and permutation functions. S-Boxes security is analyzed against well-known security criteria that include nonlinearity, bijectiveness, strict avalanche and bits independence criteria, linear and differential approximation probability. The S-Boxes can be used in the encryption of any grayscale digital images. The encrypted images are analyzed against well-known image analysis criteria that include pixel changing rates, correlation, entropy, and average change of intensity. The analysis of the encrypted image shows that our image encryption scheme is secure.

Novel Trusted Hierarchy Construction for RFID Sensor-Based MANETs Using ECCs

  • Kumar, Adarsh;Gopal, Krishna;Aggarwal, Alok
    • ETRI Journal
    • /
    • 제37권1호
    • /
    • pp.186-196
    • /
    • 2015
  • In resource-constrained, low-cost, radio-frequency identification (RFID) sensor-based mobile ad hoc networks (MANETs), ensuring security without performance degradation is a major challenge. This paper introduces a novel combination of steps in lightweight protocol integration to provide a secure network for RFID sensor-based MANETs using error-correcting codes (ECCs). The proposed scheme chooses a quasi-cyclic ECC. Key pairs are generated using the ECC for establishing a secure message communication. Probability analysis shows that code-based identification; key generation; and authentication and trust management schemes protect the network from Sybil, eclipse, and de-synchronization attacks. A lightweight model for the proposed sequence of steps is designed and analyzed using an Alloy analyzer. Results show that selection processes with ten nodes and five subgroup controllers identify attacks in only a few milliseconds. Margrave policy analysis shows that there is no conflict among the roles of network members.

Numerical Study of Entropy Generation with Nonlinear Thermal Radiation on Magnetohydrodynamics non-Newtonian Nanofluid Through a Porous Shrinking Sheet

  • Bhatti, M.M.;Abbas, T.;Rashidi, M.M.
    • Journal of Magnetics
    • /
    • 제21권3호
    • /
    • pp.468-475
    • /
    • 2016
  • In this article, entropy generation on MHD Williamson nanofluid over a porous shrinking sheet has been analyzed. Nonlinear thermal radiation and chemical reaction effects are also taken into account with the help of energy and concentration equation. The fluid is electrically conducting by an external applied magnetic field while the induced magnetic field is assumed to be negligible due to small magnetic Reynolds number. The governing equations are first converted into the dimensionless expression with the help of similarity transformation variables. The solution of the highly nonlinear coupled ordinary differential equation has been obtained with the combination of Successive linearization method (SLM) and Chebyshev spectral collocation method. Influence of all the emerging parameters on entropy profile, temperature profile and concentration profile are plotted and discussed. Nusselt number and Sherwood number are also computed and analyzed. It is observed that entropy profile increases for all the physical parameters. Moreover, it is found that when the fluid depicts non-Newtonian (Williamson fluid) behavior then it causes reduction in the velocity of fluid, however, non-Newtonian behavior enhances the temperature and nanoparticle concentration profile.

풍력 발전을 위한 분산형 전원전력의 단기예측 모델 설계 (Design of short-term forecasting model of distributed generation power for wind power)

  • 송재주;정윤수;이상호
    • 디지털융복합연구
    • /
    • 제12권3호
    • /
    • pp.211-218
    • /
    • 2014
  • 최근 풍력에너지는 풍력터빈의 지능화뿐만 아니라 풍력 발전량 예측 부분에서 컴퓨팅과의 결합이 확대되고 있다. 풍력 발전은 기상상태에 따라 출력변동이 심하고 출력 예측이 어려워 효율적인 전력 생산을 위해서 신재생에너지를 전력계통에 안정적으로 연계할 수 있는 기술이 필요하다. 본 논문에서는 분산형 전원의 예측정보를 향상시켜 예측한 발전량과 실제 발전량의 차이를 최소화하기 위한 분산형 전원전력의 단기예측 모델을 설계한다. 제안된 모델은 단기 예측을 위해서 물리모델과 통계모델을 결합하였으며, 물리모델에서 생산된 격자별 예측값 중 예측 지점내 예측지점의 값을 추출하고, 물리 모델 예측값에 통계모델을 적용하여 발전량 산정을 위한 최종 기상 예측값을 생성한다. 또한, 제안 모델에서는 실시간 기상청 관측자료와 실시간 중기 예측 자료를 입력 자료로 사용하여 단기 예측모델을 수행한다.

Reduction of the Retransmission Delay for Heterogeneous Devices in Dynamic Opportunistic Device-to-device Network

  • Chen, Sixuan;Zou, Weixia;Liu, Xuefeng;Zhao, Yang;Zhou, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권10호
    • /
    • pp.4662-4677
    • /
    • 2018
  • The dynamic opportunistic device-to-device (DO-D2D) network will frequently emerge in the fifth generation (5G) wireless communication due to high-density and fast-moving mobile devices. In order to improve the Quality of Experience (QoE) of users with different computing capacity devices in the DO-D2D network, in this paper, we focus on the study of how to reduce the packets retransmission delay and satisfy heterogeneous devices. To select as many devices as possible to transmit simultaneously without interference, the concurrent transmitters-selecting algorithm is firstly put forward. It jointly considers the number of packets successfully received by each device and the device's connectivity. Then, to satisfy different devices' demands while primarily ensuring the base-layer packets successfully received by all the devices, the layer-cooperation instantly decodable network coding is presented, which is used to select transmission packets combination for each transmitter. Simulation results illustrate that there is an appreciable retransmission delay gain especially in the poor channel quality network compared to the traditional base-station (BS) retransmission algorithm. In addition, our proposed algorithms perform well to satisfy the different demands of users with heterogeneous devices.