• ETRI Journal
• /
• v.37 no.3
• /
• pp.573-583
• /
• 2015

We introduce the idea of a forward-secure undetachable digital signature (FS-UDS) in this paper, which enables mobile agents to generate undetachable digital signatures with forward security of the original signer's signing key. The definition and security notion of an FS-UDS scheme are given. Then, the construction of a concrete FS-UDS scheme is proposed; and the proof of security for the proposed scheme is also provided. In the proposed scheme, mobile agents need not carry the signing key when they generate digital signatures on behalf of the original signer, so the signing key will not be compromised. At the same time, the encrypted function is combined with the original signer's requirement; therefore, misuse of the signing algorithm can be prevented. Furthermore, in the case where a hacker has accessed the signing key of the original signer, he/she is not able to forge a signature for any time period prior to when the key was obtained.

• ETRI Journal
• /
• v.38 no.5
• /
• pp.934-940
• /
• 2016

In this paper, secure multicasting with the help of cooperative decode-and-forward relays is considered for the case in which a source securely sends a common message to multiple destinations in the presence of a single eavesdropper. We show that the secrecy rate maximization problem in the secure multicasting scenario under an overall power constraint can be solved using semidefinite programing with semidefinite relaxation and a bisection technique. Further, a suboptimal approach using zero-forcing beamforming and linear programming based power allocation is also proposed. Numerical results illustrate the secrecy rates achieved by the proposed schemes under secure multicasting scenarios.

• ETRI Journal
• /
• v.39 no.5
• /
• pp.729-736
• /
• 2017

This work investigates secure cluster-aided multi-hop randomize-and-forward networks. We present a hop-by-hop multi-hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability (SCP) of the hop-by-hop transmission scheme. For comparison, we also analyze SCPs of traditional end-to-end transmission schemes with two relay-selection policies. We perform simulations, and our analytical results verify that the proposed hop-by-hop scheme is superior to end-to-end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop-by-hop scheme achieves near-optimal performance in terms of the SCP.

• Journal of Families and Better Life
• /
• v.17 no.2
• /
• pp.43-54
• /
• 1999

This study examined the impact of attachment styles on the size and the level of functions of social networks. 270 mothers of school children responded to the questionnaire and were classified into secure avoidant and anxious attachment groups. Findings indicated that three continuous attachment indexes security avoidance anxiousness and the size and the level of functions of social networks were not affected by mother's age educational level and employment status. However singnificant attachment style effects were obtained for the size and the level of functions of social networks. Secure subjects perceived their husbands closer and more important and listed more nonkin members in their netoworks than anxious subjects. important and listed more nonkin members in their networks than anxious subjects Also secure people perceived receiving more assistance from network members including household tasks money information and advice Secure and anxious subjects reported more emotio al support from networks than avoidant people.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.667-676
• /
• 2004

This paper uses the standard technique of data flow analysis to solve the problem of secure information-flow in core imperative programs. The existing methods tend to be overly conservative, giving “insecure” answers to many “secure” programs. The method described in this paper is designed to be more precise than previous syntactic approaches. The soundness of the analysis is proved.

• The KIPS Transactions:PartC
• /
• v.14C no.5
• /
• pp.403-410
• /
• 2007

For reliable sensor network communication, secure data transmission mechanisms are necessary. In our work, for secure communication, we cluster the network field in hexagonal shape and deploy nodes according to Gaussian distribution. After node deployment, clusterheads and gateway nodes in each cluster play the role of aggregating and delivering the sensed data with suity information all the way to the base station. Our mechanism decreases the overhead and provides food performance. It also has resilience against various routing attacks.

• Journal of Information Processing Systems
• /
• v.16 no.1
• /
• pp.42-48
• /
• 2020

This paper proposes an operating system architecture for unmanned aerial vehicle (UAV), which is secure against root exploit, resilient to connection loss resulting in the control loss, and able to utilize common applications used in Linux. The Linux-based UAVs are exposed to root exploit. On the other hand, the microkernel-based UAVs are not able to use the common applications utilized in Linux, even though which is secure against root exploit. For this reason, the proposed architecture uses a virtualized microkernel on the Linux operating system to isolate communication roles and prevent root exploit. As a result, the suggested Operating system is secure against root exploit and is able to utilize the common applications at the same time.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2003.12a
• /
• pp.573-577
• /
• 2003

본 논문에서는 하나의 네트워크로 연결되어진 가정내의 모든 가전 기기 및 PC 관련 제품들을 인터넷 접속을 통해 제어 및 데이터 전송을 가능하게 하는 흠 네트워크에서 DDoS Attack을 방지하고 보안 통신을 가능하게 하는 Secure Coordinator를 구현하였다 여러 가전기기들은 진화를 거듭하여 데이터 통신 및 원격 제어가 가능하게 되었고 대부분의 전자 장비들과 연결되어 하나의 Network를 구성하고 있다. 이러한 데이터 통신은 아직 암호화 통신이 이루어지지 않아 쉽게 외부로 유출 될 수 있을 뿐만 아니라 악의적인 사용자의 DDoS Attack 에 의해서 내부 Network는 쉽게 무력화 될 수 있다. 본 논문에서는 Secure Coordinator를 통한 DDoS Attack 방지 및 암호화 통신을 구현하였으며, 본 시스템을 통해 기존 시스템의 수정 없이 서버 및 클라이언트 앞단에 모듈처럼 삽입하는 방식으로 선계가 되어 있어 Home Networking 뿐만 아니라 서버/클라이언트어플리케이션에 많은 활용이 기대되어 진다.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.556-558
• /
• 2008

Secure broadcasting is requirement for payment of TV systems, government or company. Hierarchical key management for access control provides efficient key management in those environment. Also, time-bound hierarchical key management technique generates different keys in each time period. In 2004, Tzeng proposed a time-bound cryptgraphic key assignment scheme for access control in a hierarchy and in 2008, Bertino et al proposed an efficient time-bound hierarchical key management scheme for secure broadcasting. Tzeng's scheme and Bertino et al's scheme are organized in different environment and primitive. In this paper, we analysis above two time-bound hierarchical key management scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.365-370
• /
• 2004

In this paper, complexity secure communication was presented. The complexity circuit is used to State-Controlled Cellular Neural Network(SC-CNN). We make a complexity circuit using SC-CNN with the N-double scroll. A complexity circuit is created by applying identical n-double scrolls with coupled method, to each cell. complexity synchronization was achieved using drive response synchronization between the transmitter and receiver about each state in the SC-CNN. From the result of the recovery signal through the demodulation method in the receiver. We shown that recovery quality in the receiver is the similar to other secure communication methods.