• Title/Summary/Keyword: 준동형 암호시스템

Search Result 9, Processing Time 0.024 seconds

Design of the homomorphic encryption system for secure data management in the future battlefield environment (미래 전장환경에서 안전한 데이터 관리를 위한 준동형 시스템 설계)

  • Cha, HyunJong;Kim, JinMook;Ryou, HwangBin
    • Convergence Security Journal
    • /
    • v.14 no.2
    • /
    • pp.51-56
    • /
    • 2014
  • Be expressed in network-centric warfare, mainly battlefield environment of the future. The purpose of the system for the war of the future, is to recognize the enemy before the enemy, and rapid decision-making, to hit accurately. For this reason, it is during the construction of the integrated system of C4ISR+PGM. In such an integrated system, it is necessary to further enhance the security aspects of the information. In particular, strengthening of security leads to a decrease of efficiency. Therefore, security and efficiency should be considered together. In this study, we provide a homomorphic encryption system that can be safely managed information environment on the battlefield of the future. The proposed method uses encryption technology of homomorphic that can be the arithmetic operations on encrypted state. It has changed from the state of the encryption. Therefore, the attacker can not know a decent information.

A New Universally Verifiable and Receipt-free Electronic Voting Scheme Through Public Channel by Using Smartcard (스마트카드를 이용하여 공개채널로 매표방지와 전체검증을 제공하는 전자선거기법)

  • 김형석;김상진;오희국
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2003.12a
    • /
    • pp.605-610
    • /
    • 2003
  • 선거를 전자적으로 구성하기 위해서는 비밀성(privacy), 선거권(eligibility) 등과 함께 전체검증(universal verifiability)과 매표방지(receipt-freeness) 속성을 반드시 제공해야 한다. 지금까지 제안된 전자선거 기법은 매표방지와 전체검증을 제공하기 위해 도청 불가능한 채널이라는 물리적인 가정 하에 이루어지거나 하드웨어 장치를 이용하더라도 장치에 대한 신뢰가 가정되었다. 본 논문에서는 믹스 서버나 랜덤마이저의 역할을 스마트카드와 같은 안전한 하드웨어 장치가 하므로 물리적 가정 없이 효율적으로 구현한다. 제안한 시스템은 표를 섞는 과정에서 permutation matrix를 사용하여 증명하므로 증명의 회수가 적고 간단하여 효율적이다. 또한, 지금까지 제안된 대부분의 선거 기법은 ElGamal 암호시스템의 준동형 특성을 이용하여 모든 표를 결합한 다음 해독하여 집계를 계산하는데 이는 이산대수 문제를 효율적으로 해결할 수 있어야 가능했다. 이 논문에서는 ElGamal 암호시스템과 다차잉여 기반 암호알고리즘인 Naccacne 암호알고리즘을 결합하여 표를 인코딩 함으로써 유권자의 수가 많은 선거에 대해서도 다항 시간 내에 집계가 가능하다.

  • PDF

Design of the secure data management system using homomorphic encryption (준동형 암호를 이용한 안전한 데이터 관리 시스템 설계)

  • Cha, Hyun-Jong;Yang, Ho-Kyung;Choi, Kang-Im;Ryou, Hwang-Bin;Shin, Hyo-Young
    • Convergence Security Journal
    • /
    • v.15 no.4
    • /
    • pp.91-97
    • /
    • 2015
  • General companies consider saving the information after enciphering as law. However, if the actual information is saved as enciphered, the decoding process must be conducted when the information is searched or edited in the ser ver. Therefore, process delay time occurs and is less efficient. This kind of work gives burden to the server, so the companies or managers handling the server do not save the information after enciphering. In this paper, the Networ k constructs and realizes an efficient security data management system that ensures safety and haste in operating u sing the homomorphic encryption technology, which collects information and decides quickly, and enables editing the encryption without a decoding process. To ensure the security of the embodied system, the existing encryption algo rithm can be used. Search method to use the keyword search. Additionally, by using a trapdoor, the keyword is not expose and it is changed whenever it is searched, and the formation of the keyword does not get exposed.

Deterministic Private Matching with Perfect Correctness (정확성을 보장하는 결정적 Private Matching)

  • Hong, Jeong-Dae;Kim, Jin-Il;Cheon, Jung-Hee;Park, Kun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.502-510
    • /
    • 2007
  • Private Matching is a problem of computing the intersection of private datasets of two parties. One could envision the usage of private matching for Insurance fraud detection system, Do-not-fly list, medical databases, and many other applications. In 2004, Freedman et at. [1] introduced a probabilistic solution for this problem, and they extended it to malicious adversary model and multi-party computation. In this paper, we propose a new deterministic protocol for private matching with perfect correctness. We apply this technique to adversary models, achieving more reliable and higher speed computation.

An Mobile-OTP(One Time Password) Key and Simulation using Fingerprint Features (지문 특징을 이용한 모바일 일회용 암호키 및 시뮬레이션)

  • Cha, Byung-Rae;Kim, Yong-Il
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.4
    • /
    • pp.532-543
    • /
    • 2009
  • As the applications within Internet and Ubiquitous becoming more extensive, the security issues of those applications are appearing to be the most important concern. Therefore, every part of the system should be thoroughly designed and mutually coordinated in order to support overall security of the system. In this paper, we propose new technique which uses the fingerprint features in order to generate Mobile One Time Passwords(OTPs). Fingerprint is considered to be one of the powerful personal authentication factors and it can be used for generating variable passwords for one time use. Also we performed a simulation of homomorphic graph variable of fingerprint feature point using dendrogram and distribution of fingerprint feature points for proposed password generation method.

  • PDF

Design of OTP based on Mobile Device using Voice Characteristic Parameter (음성 특징 파라메터를 이용한 모바일 기반의 OTP 설계)

  • Cha, Byung-Rae;Kim, Nam-Ho;Kim, Jong-Won
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.4
    • /
    • pp.512-520
    • /
    • 2010
  • As the applications based on Mobile and Ubiquitous becoming more extensive, the communication security issues of those applications are appearing to be the most important concern. Therefore, every part of the system should be thoroughly designed and mutually coordinated in order to support overall security of the system. In this paper. we propose new technique which uses the voice features in order to generate Mobile One Time Passwords(OTPs). Voice is considered to be one of the powerful personal authentication factors of biometrics and it can be used for generating variable passwords for one time use. Also we performed a simulation of homomorphic variability of voice feature points using dendrogram and distribution of voice feature points for proposed password generation method.

A System of Authentication and Security threat solution for N-screen services (N-스크린을 위한 인증 및 보안 위협 해결 시스템)

  • Hwang, Deuk-Young;Moon, Jeong-Kyung;Kim, Jin-Mook
    • Journal of Digital Convergence
    • /
    • v.11 no.11
    • /
    • pp.775-781
    • /
    • 2013
  • N-screen is a Service that can be provide for One Service Multi Device. If the network is changed or if the device is changed after authentication the device fits seamlessly send footage. Security threats that occur here have a problem with user authentication. In this paper proposes available in a multi-device the authentication system. Homomorphic Encryption Algorithm of authentication scheme used. Among the authentication mechanism that already exists is a simple and lightweight authentication mechanism. In addition, N-screen service that uses multiple devices is simple authentication process of the device. Review the results of proposed authentication protocol, encryption algorithm to process a small storage capacity and is easy to work in low processor. And was suitable for use with multiple devices.

An Anonymous Asymmetric Fingerprinting Scheme with Trusted Third Party (신뢰기관을 이용한 익명적 비대칭 핑거프린팅 기법)

  • Yong, Seung-Lim;Lee, Sang-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.7
    • /
    • pp.288-295
    • /
    • 2007
  • The illegal copying and redistribution of digitally-stored information is a crucial problem to distributors who electronically sell digital data. fingerprinting scheme is a technique which supports copyright protection to track redistributors of electronic information using cryptographic techniques. Anonymous asymmetric fingerprinting scheme prevents the merchant from framing a buyer by making the fingerprinted version known to the buyer only. And this scheme allows the buyer to purchase goods without revealing her identity to the seller. In this paper, a new anonymous asymmetric fingerprinting scheme with TTP is introduced. The buyer's fingerprint is generated by the Fingerprint Certificate Authority which is a TTP. When the seller embeds the fingerprint in the digital data, the protocol uses the homomorphic encryption scheme. Thus the seller cannot know the buyer's fingerprint and the buyer's anonymity is guaranteed by using anonymous key pair.

Fair Private Matching with Semi-Trusted Third Party (STTP를 활용한 공평한 비밀 매칭)

  • Kim, E-Yong;Hong, Jeong-Dae;Cheon, Jung-Hee;Park, Kun-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.4
    • /
    • pp.446-450
    • /
    • 2008
  • Private Matching is the problem of computing the intersection of private datasets of two parties without revealing their own datasets. Freedman et al.[1] introduced a solution for the problem, where only one party gets private matching. When both parties want to get private matching simultaneously, we can consider the use of Kissner and Song[2]'s method which is a privacy-preserving set intersection with group decryption in multi-party case. In this paper we propose new protocols for fair private matching. Instead of group decryption we introduce a Semi-Trusted Third Party for fairness. We also propose an update procedure without restarting the PM protocol.