• Convergence Security Journal
• /
• v.23 no.4
• /
• pp.93-100
• /
• 2023

This paper presents a novel approach for assigning group keys within a dynamic swarm unmanned system environment. In this environment, multiple groups of unmanned systems have the flexibility to merge into a single group or a single unmanned system group can be subdivided into multiple groups. The proposed protocol encompasses two key steps: group key generation and sharing. The responsibility of generating the group key rests solely with the leader node of the group. The group's leader node employs a secret sharing scheme to fragment the group key into multiple fragments, which are subsequently transmitted. Nodes that receive these fragments reconstruct a fresh group key by combining their self-generated secret fragment with the fragment obtained from the leader node. Subsequently, they validate the integrity of the derived group key by employing the hash function. The efficacy of the proposed technique is ascertained through an exhaustive assessment of its security and communication efficiency. This analysis affirms its potential for robust application in forthcoming swarm unmanned system operations scenarios characterized by frequent network group modifications.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.238-240
• /
• 2005

인터넷과 같은 개방된 공간에서 중요한 정보는 상당한 발전을 이룩한 암호화 기술에 의해 보호된다 그러나 컴퓨터의 급속한 발전은 암호화의 근간이 되는 키에 대하여 더욱 길고 안전한 키를 요구한다. 이는 기억해야할 또는 안전하게 소지해야할 정보가 더 많아짐을 의미한다. 이러한 상황에서 개인의 생체정보를 기반으로 하는 키의 이용은 일정 수준의 보안성을 만족하기위한 키의 길이가 증가됨을 억제하고, 외우거나 소지해야하는 불편함도 해소해준다. 그러나 기존의 생체인식 기반의 키 생성 기법 연구는 여러 종류의 생체인식을 동원한 특징점 및 매개변수 정보를 기반으로 하고 있어 실제 활용함에 제한이 있다. 따라서 본 논문에서는 적용할 단 하나의 생체인식으로 얼굴인식을 채택하였고, 이 얼굴인식의 다중 고유얼굴을 이용하여 특징점 및 매개변수 집합을 형성하고, 이 집합으로부터 더욱 안전하고 편리한 키를 생성하는 기법을 연구하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.701-702
• /
• 2009

무선 센서 네트워크가 배포된 지역에 대하여 주기적으로 감시 값을 수집해야 하는 경우 라우팅 방법으로 계층적인 형태의 라우팅 방법을 주로 사용한다. 계층적인 형태의 라우팅 방법에는 특히, 클러스터를 구성하여 클러스터 리더가 클러스터에 속한 다른 노드들로부터 값을 모아 베이스 스테이션으로 전송하는 클러스터 기반 라우팅 방법이 일반적이다. 클러스터 기반 라우팅 방법의 경우 센서 노드간의 보안 서비스를 위해 그룹 키를 사용하는 경우가 있는데, 이 경우 그룹 키를 알고 있는 노드가 복수개 존재하기 때문에 그룹 키의 오용 가능성이 존재한다. 본 논문에서는 오용된 그룹 키를 탐지하기 위해 지연 응답 방법을 이용한 오용된 그룹 키 탐지 방법을 제안한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• fall
• /
• pp.57-58
• /
• 2021

우리는 한정된 공간에 분산하여 위치한 다수 개의 카메라들을 이용하여 생성된 실사 그래픽스 체적 모델 시퀀스 기반 동적 복원 알고리즘을 제안한다. 각 프레임 단위로 생성된 정적 모델의 시퀀스로부터 일정 시간 단위로 키 프레임을 생성한다. 키 프레임과 키 프레임 사이의 모델에 대한 리메싱(Remeshing) 처리를 수행하고 이를 통해 생성된 3D 모델과 키 프레임 사이 특징 점을 획득한다. 획득된 특징 점의 3차원 좌표들 사이의 오차를 최소화 하는 최적화 알고리즘(Solver)을 이용하여 키 프레임 모델과 리 매싱된 모델의 비 강체 정합을 모든 키 프레임 단위로 반복적으로 수행한다. 제안한 정합 방법을 이용하여 생성된 모델과 키 프레임 모델 사이 에러를 비교함으로써 결과를 검증한다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.12
• /
• pp.307-314
• /
• 2020

The video surveillance service is being widely deployed around our lives and the service stores sensitive data such as video streams in the cloud over the Internet or the centralized data store in an on-premise environment. The main concerning of these services is that the user should trust the service provider how secure the video or data is stored and handled without any concrete evidence. In this paper, we proposed the approach to protecting video by PKI (public key infrastructure) with a blockchain network. The video is encrypted by a symmetric key, then the key is shared through a blockchain network with taking advantage of the PKI mechanism. Therefore, the user can ensure the sensitive data is always kept secure and traceable in its lifecycle.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.5
• /
• pp.43-52
• /
• 2001

Y. Zheng introduced a new type of cryptograghic primitive as \"signcryption\", which combines a function of digital signature scheme with a symmetric key encryption algorithm. Signcryption doesn\`t only provide authenticity and confidentiality in a single step, but also give more efficient computation than the traditional \"signature-then-encryption\". And C. Gamage proposed a proxy-signcryption that efficiently combines a proxy signature with the signcryption. But, in the proposed signcryption schemes, one who obtains the sender\`s private key can recover the original message of a signcrypted text. That is, forward secrecy is not offered by the signcryption scheme with respect to the sender\`s private key. In this paper, we will propose a modified signcryption of Zheng\`s signcryption and a variant of proxy-signcryption with forward secrecy.ith forward secrecy.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.5
• /
• pp.915-932
• /
• 2022

According to the Personal Information Protection Act and Pseudonymization Guidelines, the mapping is processed to the hash value of the combination key generation items including Salt value when different combination applicants wish to combine. Example of combination key generation items may include personal information like name, phone number, date of birth, address, and so on. Also, due to the properties of the hash functions, when different applicants store their items in exactly the same form, the combination can proceed without any problems. However, this method is vulnerable to combination in scenarios such as address changing and renaming, which occur due to different database update times of combination applicants. Therefore, we propose a privacy preserving combination key generation scheme robust to updates of items used to generate combination key even in scenarios such as address changing and renaming, based on the thresholds through probabilistic record linkage, and it can contribute to the development of domestic Big Data and Artificial Intelligence business.

• Journal of Creative Information Culture
• /
• v.5 no.3
• /
• pp.345-353
• /
• 2019

Several studies have been proposed to improve storage space efficiency by expressing binary trie data structure as a linear binary bit string. Compact binary tree approach generated using one binary trie increases the key search time significantly as the binary bit string becomes very long as the size of the input key set increases. In order to reduce the key search range, a hierarchical compact binary tree technique that hierarchically expresses several small binary compact trees has been proposed. The search time increases proportionally with the number and length of binary bit streams. In this paper, we generate several binary compact trees represented by full binary tries hierarchically. The search performance is improved by allowing a path for the binary bit string corresponding to the search range to be determined through simple numeric conversion. Through the performance evaluation using the worst time and space complexity calculation, the proposed method showed the highest performance for retrieval and key insertion or deletion. In terms of space usage, the proposed method requires about 67% ~ 68% of space compared to the existing methods, showing the best space efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.6
• /
• pp.1231-1242
• /
• 2012

Traitor tracing schemes deter traitors from sharing their private keys by tracing at least one of the subscribers who were implicated in the construction of a pirate decoder. In general, it is assumed that the system manager in the scheme generates and distributes the subscribers' private key. But if the system manager knows the subscribers' private keys, he cannot convince a third party of a certain subscriber's piracy. To solve this problem, the system manager should not know the whole parts of subscribers' private keys and this leads to researches of asymmetric schemes. Moreover for the purpose of enhancing subscribers' privacy, there were two proposals of introducing anonymity onto asymmetric traitor tracing schemes, but one of them turned out to be a failure. In this paper, we point out that the other proposal also has flaws. We consider how to introduce anonymity to traitor tracing schemes, as a result, we suggest a new framework which is practical. We also construct a scheme by using an anonymous credential system and an asymmetric traitor tracing scheme. We prove the security of our scheme and consider the typical applications.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.8
• /
• pp.5294-5302
• /
• 2014

The development of public-key-based technique that enables a variety of services(E-government, e-banking, e-payment, etc.) evaluated as having complete safety. On the other hand, vulnerabilities(e.g, heartbleed bug, etc.) are constantly being discovered. In this paper, a public key infrastructure to verify the safety and reliability, the collision rate using OpenSSL key pair was analyzed. the experiment was performed using the following procedure. Openssl was used to create five private certification agencies, and each of the private certificate authority certificates to create 2 million, generating a total of 10 million by the certificate of the key pair conflicts analysis. The results revealed 35,000 in 1 million, 0.35% chance of a public key, a private key conflict occurred. This is sufficient in various fields(E-payment, Security Server, etc.). A future public-key-based technique to remove the threat of a random number generator, large minority issues, in-depth study of selection will be needed.