• Title/Summary/Keyword: secure

Search Result 9,416, Processing Time 0.037 seconds

SECURE DOMINATION PARAMETERS OF HALIN GRAPH WITH PERFECT K-ARY TREE

  • R. ARASU;N. PARVATHI
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.839-848
    • /
    • 2023
  • Let G be a simple undirected graph. A planar graph known as a Halin graph(HG) is characterised by having three connected and pendent vertices of a tree that are connected by an outer cycle. A subset S of V is said to be a dominating set of the graph G if each vertex u that is part of V is dominated by at least one element v that is a part of S. The domination number of a graph is denoted by the γ(G), and it corresponds to the minimum size of a dominating set. A dominating set S is called a secure dominating set if for each v ∈ V\S there exists u ∈ S such that v is adjacent to u and S1 = (S\{v}) ∪ {u} is a dominating set. The minimum cardinality of a secure dominating set of G is equal to the secure domination number γs(G). In this article we found the secure domination number of Halin graph(HG) with perfet k-ary tree and also we determined secure domination of rooted product of special trees.

A Study on secure authentication system using integrated authentication service

  • Lee, Hyung-Su
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.2
    • /
    • pp.59-63
    • /
    • 2017
  • Recently, Certificate has been loosed 100 times in a four years as Phising or hacking. The service that use certificate in financial services occurs practical and secure issues. Therefore, the Korea government abolished the mandatory system used in the certificate service. However, they did not provide a replacing method for a certificate. And is not to fill the gaps of the certificate with one time password or secure card. Therefore this paper is propose the alternative method with total authentication service, that is lead the more secure electronic commercial.

A Design and Implementation of Secure Messenger System for Secure message transmission (안전한 메시지 전송을 위한 Secure Messenger System 설계 및 구현)

  • 최상수;황성하;최용준;고정호;이강수;김소연
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.11a
    • /
    • pp.315-320
    • /
    • 2001
  • 최근 인터넷을 기반으로 하는 정보통신 인프라의 발달에 따라 다양한 서비스가 등장하였으며 이들 서비스들을 통합하여 제공하는 인스턴트 메시징 서비스가 등장하여 그 수요가 급증하고 있다. 그러나, 기존의 인스턴트 메시징 서비스들은 전송되는 메시지에 대하여 어떠한 보안장치도 제공되지 않아서 제 3자에 의한 개인정보 유출 및 차용이 문제점으로 부각되고 있다. 따라서 본 논문에서는 기존의 인스턴트 메시징 구조에 사용자 인증 기능 및 암호화 기능을 조합하여 안전한 메시지 전송을 위한 SMS(Secure Messenger System)를 설계하고 개발하였다.

  • PDF

Recent Trends in Research and Technology of Secure Execution Environment (SEE 분야의 연구 및 기술 동향)

  • Baek, K.H.;Kang, D.H.;Kim, K.Y.
    • Electronics and Telecommunications Trends
    • /
    • v.22 no.5
    • /
    • pp.152-158
    • /
    • 2007
  • Secure execution environment는 안전한 컴퓨팅 시스템의 실행환경을 의미한다. 컴퓨터 시스템을 포함해서 프로세서를 가지고 있는 모든 종류의 단말이 secure execution enviroment 관련 연구의 대상이 될 수 있다. 기본적인 컴퓨팅 환경의 보안 수준을 높여주는 secure execution enviroment는 이미 많은 연구가 진행된 분야로 본 문서에서는 이와 관련된 연구 및 기술개발 동향에 대해서 알아본다. 또한 대학교에서 진행된 대표적인 프로젝트와 프로세서 제조업체의 기술 동향 및 관련된 산업 표준화 동향을 살펴보고 비교 분석하는 것을 목표로 한다.

SecureJS: A Secure Javaspace based on Jini2.0 (SecureJS: Jini2.0 기반의 안전한 Javaspace의 구현)

  • 유양우;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10c
    • /
    • pp.529-531
    • /
    • 2004
  • Jini 서비스 중 하나인 Javaspace는 자바환경의 분산 컴퓨팅 모델로서 객체를 저장하고 저장된 객체에 접근할 수 있는 공간을 말한다. 이러한 Javaspace 서비스는 객체를 공유하는 방법으로 매우 유용하게 사용되고 있 만, 보안성이 취약하여 객체정보에 대한 접근 보안이 요구되는 분산시스템의 개발에는 적합하 않다. 본 논문에서는 Javaspace의 취약한 보안성을 강화시켜 안전한 Javaspace 서비스를 제공하는 SecureJS 시스템에 대하여 설명한다.

  • PDF

The Secure Communication Method for Build Small World (Small World 구축을 위한 비밀 통신 기법)

  • 배영철;구영덕
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2004.05b
    • /
    • pp.705-708
    • /
    • 2004
  • In this paper, we proposed that the secure communication method for build small world. In order to secure communication in the small world, we used Chua's oscillator which well represent the chaos dynamics and composed several stage with Chua's oscillator by using coupled synchronization method. This paper shows a secure communication result in the small world network using coupled synchronization method.

  • PDF

CIA-Level Driven Secure SDLC Framework for Integrating Security into SDLC Process (CIA-Level 기반 보안내재화 개발 프레임워크)

  • Kang, Sooyoung;Kim, Seungjoo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.30 no.5
    • /
    • pp.909-928
    • /
    • 2020
  • From the early 1970s, the US government began to recognize that penetration testing could not assure the security quality of products. Results of penetration testing such as identified vulnerabilities and faults can be varied depending on the capabilities of the team. In other words none of penetration team can assure that "vulnerabilities are not found" is not equal to "product does not have any vulnerabilities". So the U.S. government realized that in order to improve the security quality of products, the development process itself should be managed systematically and strictly. Therefore, the US government began to publish various standards related to the development methodology and evaluation procurement system embedding "security-by-design" concept from the 1980s. Security-by-design means reducing product's complexity by considering security from the initial phase of development lifecycle such as the product requirements analysis and design phase to achieve trustworthiness of product ultimately. Since then, the security-by-design concept has been spread to the private sector since 2002 in the name of Secure SDLC by Microsoft and IBM, and is currently being used in various fields such as automotive and advanced weapon systems. However, the problem is that it is not easy to implement in the actual field because the standard or guidelines related to Secure SDLC contain only abstract and declarative contents. Therefore, in this paper, we present the new framework in order to specify the level of Secure SDLC desired by enterprises. Our proposed CIA (functional Correctness, safety Integrity, security Assurance)-level-based security-by-design framework combines the evidence-based security approach with the existing Secure SDLC. Using our methodology, first we can quantitatively show gap of Secure SDLC process level between competitor and the company. Second, it is very useful when you want to build Secure SDLC in the actual field because you can easily derive detailed activities and documents to build the desired level of Secure SDLC.

Synchronization and Secure Communication Application of Chaos Based Malasoma System (카오스 기반 Malasoma 시스템의 동기화 및 보안 통신 응용)

  • Jang, Eun-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.5
    • /
    • pp.747-754
    • /
    • 2017
  • Chaos-based secure communication systems are alternative of standard spread-spectrum systems that enable spreading the spectrum of the information signals and encrypting information signals with simple and inexpensive chaotic circuitry. In secure communication area, like Lorenz, Chua, Rossler, Duffing etc, classical systems are widely used. Malasoma chaotic system is topologically simple but their dynamical behaviors are non-linear synchronization and secure communication applications has not seen in paper. This paper aims for introducing a new chaotic system which is able to use as alternative to classical chaotic systems into secure communication fields. In addition, this new model simulates a synchronous communication system using P-C (Pecora-Carroll) method by verifying security with chaos signal through simulation. Modelling, synchronization and secure communication applications of Malasoma are realized respectively in MATLAB-Simulink environment. Retrieved results show that this novel chaotic system is able to use in secure communication fields.

Secure Multi-Party Computation of Correlation Coefficients (상관계수의 안전한 다자간 계산)

  • Hong, Sun-Kyong;Kim, Sang-Pil;Lim, Hyo-Sang;Moon, Yang-Sae
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.799-809
    • /
    • 2014
  • In this paper, we address the problem of computing Pearson correlation coefficients and Spearman's rank correlation coefficients in a secure manner while data providers preserve privacy of their own data in distributed environment. For a data mining or data analysis in the distributed environment, data providers(data owners) need to share their original data with each other. However, the original data may often contain very sensitive information, and thus, data providers do not prefer to disclose their original data for preserving privacy. In this paper, we formally define the secure correlation computation, SCC in short, as the problem of computing correlation coefficients in the distributed computing environment while preserving the data privacy (i.e., not disclosing the sensitive data) of multiple data providers. We then present SCC solutions for Pearson and Spearman's correlation coefficients using secure scalar product. We show the correctness and secure property of the proposed solutions by presenting theorems and proving them formally. We also empirically show that the proposed solutions can be used for practical applications in the performance aspect.