• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.24 no.5
• /
• pp.781-793
• /
• 2014

A Public Key Infrastructure (PKI) is security standards to manage and use public key cryptosystem. A PKI is used to provide digital signature, authentication, public key encryption functionality on insecure channel, such as E-banking and E-commerce on Internet. A soft-token private key in PKI is leaked easily because it is stored in a file at standardized location. Also it is vulnerable to a brute-force password attack as is protected by password-based encryption. In this paper, we proposed a new method that detects private key compromise and is probabilistically secure against a brute-force password attack though soft-token private key is leaked. The main idea of the proposed method is to use a genuine signature key pair and (n-1) fake signature key pairs to make an attacker difficult to generate a valid signature with probability 1/n even if the attacker found the correct password. The proposed method provides detection and notification functionality when an attacker make an attempt at authentication, and enhances the security of soft-token private key without the additional cost of construction of infrastructure thereby extending the function of the existing PKI and SSL/TLS.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.6
• /
• pp.365-370
• /
• 2023

Royalty contributed to the development of the non-fungible token (NFT) ecosystem as a reward system that pays a portion of the sales to the creator whenever transactions occur. This study quantitatively analyzes the impact of the abolition of royalties, which is being expanded by some NFT marketplaces, on the NFT market, and qualitatively analyzes the results of the impact. The analysis results are as follows. First, the number of NFT mints is decreasing by causing creators to leave the NFT market and reducing new entry. Second, major NFT projects have refused to trade with marketplaces that have abolished royalties, leading to a decrease in the number of transactions. Third, the abolition of royalties has undermined the motivation of NFT creators to continue to develop their projects, leading to a drop in NFT floor prices. This study is expected to contribute to reducing the current negative impact in the short term by suggesting how the NFT community provides incentives to owners who voluntarily pay royalties independently of the policy of the NFT marketplace. In addition, it suggests that in the long run, fundamental solutions to the problem of abolishing royalties require improvements in technology related to royalty payments, cooperation between NFT marketplaces and NFT creators, and institutional support related to royalties.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.258-260
• /
• 1998

CPN(Colored Petri Net)은 시스템을 분석하고 설계하는 모델링 기법인 페트리넷의확장형으로서, 토큰에 color을 부여하여 자료흐름까지 고려할 수 있다. 이 연구에서 Estelle 로 기술된 프로토콜 명세를 Design /CPN에 적용가능한 CPN으로의 변환 방법을 제안하였다. 그리고 변환된 CPN을 Design /CPN에 입력하여 얻은 OG(Occurrence Graph)와 각 노드에 대한 내부 정보인 descriptor를 이용하여, 자료흐름이 고려된 보다 간편하고 효율적인 테스트 케이스를 생성하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.407-410
• /
• 1997

This paper analytically derives the variance of service time of a station in the symmetric IEEE 802.4 token bus network with single access class and finite buffer capacity. This performance measure is represented in terms of the total number of stations, the token hold time, the arrival rate of frames, the service rate, and other parameters. Using computer simulations, presented performance measure is validated.

• Review of KIISC
• /
• v.17 no.3
• /
• pp.26-31
• /
• 2007

공개된 네트워크 시스템 상에서의 개인 정보를 보호하기 위해 사용자 인증은 시스템 보안에 있어서 중요한 요소이다. 패스워드 기반의 인증 메커니즘은 비용과 효율성의 측면에서 널리 사용되고 있으며 최근 이중요소인증(Two-Factor Authentication)의 한 수단으로 일회용 패스워드(One-Time Password, OTP)를 도입하고 있다. 본고에서는 일회용 패스워드에 대한 인증 기술과 OTP 통합 인증 센터로 구성되는 OTP 통합 인증 시스템에 대해 검토하며 취약성에 대해 살펴보고 이에 대한 대응 방안으로 서비스 제공자의 식별자를 포함한 일회용 패스워드 생성 매체를 이용하는 사용자 인증 시스템을 구성한다. 또한 USB 토큰 형태의 일회용 패스워드 매체를 이용하여 다수의 서비스 제공자의 일회용 패스워드를 지원하는 인증 시스템을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.916-918
• /
• 2005

표절이란 원본 자료의 출처를 밝히지 않고 사용하는 행위인데, 프로그램 표절은 표절로 의심되는 유사 소스코드를 말한다. 프로그램 표절을 검출하는 방법은 소스코드의 토큰 요약 후 비교하거나 단어와 키워드의 개수를 측정해 통계적으로 비교, 계산하거나 또는 프로그램의 구문구조를 비교하는 등 여러 접근 방법이 있다. 본 조사 보고서에서는 프로그램 표절 검출 방법 및 응용 도구에 대한 최근 연구 동향을 조사하여 정리하고 향후 발전 방향을 토론한다.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.111-113
• /
• 2006

FOUNDATION fieldbus provides scheduling and token-passing services for cyclic and sporadic data respectively. In this paper, we evaluate the delay performance of token-passing mechanism in FOUNDATION fieldbus network system using an experimental model. This paper introduces a method of developing an experimental model which consists of 10 nodes of FOUNDATION fieldbus communication device. Using the experimental model, we evaluate the delay performance of time-critical and time-available data with respect to change of TTRT parameter.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.1000-1005
• /
• 1993

In this paper asymptotic formulate for performance characteristics throughput, delay) of large scale token-passing networks with priorities and limited service are given. In particular, adaptive control procedures for obtaining optimal buffer capacity with respect to each priority and optimal limited service are shown. All results obtained are supported by simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.37-42
• /
• 1992

The main purpose of the paper is to derive asymptotic formulae for performance characteristics(throughput, delay) of large-scale token-passing network with buffered stations and to optimize the buffer capacity with respect to the probability of data generation. We consider two versions of token-passing network: uniform and nonuniform token-passing time interval. All results obtained are supported by simulations.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.430-433
• /
• 1999

Woo[8]proposed dual-token based fault-tolerant scheduling algorithm in multiprocessor environment for resolving the problem of old systems that have a central dispatcher processor. However, this algorithm does not present token allocation algorithm in detail when central dispatcher processor has failed. In this paper, we propose a fault detection algorithm and processor selection algorithm for token allocation when central dispatcher processor has failed.