• Proceedings of the Korea Contents Association Conference
• /
• 2011.05a
• /
• pp.11-12
• /
• 2011

원 서명자를 대신해 거래 관련 제 3자가 서명을 수행하는 대리서명의 실행이 필요한 경우 원 서명자의 서명 위임 사실을 증명하는 위임장이 요구되어진다. 위임장을 전자 거래에 적용하기 위해서는 전자위임장에 관한 표준 프로파일 정의, 전자위임장의 배포 및 검증 방법에 대한 처리 기준이 마련되어야 하며 이를 기반으로 하는 사무 처리 모델이 제시되어야 한다. 이러한 전자위임장 기반구조상에서 다양한 유형의 온/오프라인 거래에 전자위임장을 적용함으로써 전자거래의 활성화에 기여할 수 있을 것으로 판단된다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.4
• /
• pp.71-84
• /
• 2003

Self-certified public keys need not be accompanied with a separate certificate to be authenticated by other users because the public keys are computed by both the authority and the user. At this point, verifiable self-certified public keys are proposed that can determine which is wrong signatures or public keys if public keys are used in signature scheme and then verification of signatures does not succeed. To verify these public keys, key generation center's public key trusted by users is required. If all users trust same key generation center, public keys can be verified simply. But among users in different domains, rusty relationship between two key generation centers must be accomplished. In this paper we propose inter-domain verifiable self-certified public keys that can be verified without certificate between users under key generation centers whose trusty relationship is accomplished. Also we present the execution of signature and key distribution between users under key generation centers use different public key parameters.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.91-96
• /
• 2005

Recetly, the term Personal Public Key Infrastructure (PKI) was introduced to supprot reliable and authenticated service in a Personal Area Network (PAN). However, traditional public key signature schemes and certificate status management are not suitable for a PAN environment since mobile devices that constitute the PAN have limited computing capability. In this paper, we propose a new scheme that efficiently provides signature generation and certificate status management for mobile devices. Based on hash chain technique, we intend to reduce computational overhead on signature generation, and further, to minimize communication overhead for managing certificate status.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.216-217
• /
• 2018

IEEE 1609.2 표준은 WAVE (Wireless Access in Vehicular Environment) 표준에서 차량간(V2V, Vehicle-to-Vehicle) 혹은 차량과 인프라간(V2I, Vehicle-to-Infrastructure)통신 상의 응용 메시지 보호를 위해 제정되었다. 이 표준은 메시지 이증 및 무결성 검증을 위하여 NIST p256 타원 곡선 커브 기반의 ECDSA 전자서명 기법을 사용한다. 매우 복잡한 도신 상의 출퇴근 환경에서는 수백대의 자동차가 전송하는 메시지를 정상적으로 처리하기 위하여, 차량의 OBU(On-Board Unit) 혹은 노상의 RSU(Road-Side Unit)에서 서명된 메시지의 검증 성능이 매우 중요한 이슈가 될 수 있다. 본 논문에서는 V2X 통신에서 효율적인 ECDSA 서명 검증을 위하여, OBU 혹은 RSU 환경에서 CPU 상의 병렬 처리 성능을 테스트 한 후 시사점을 살펴본다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.04a
• /
• pp.186-188
• /
• 2016

본 논문에서는 모바일 환경에서 동적서명인식에 관해 원본서명과 숙련된 위조서명의 구분을 검증하는 방법을 제안한다. 속도/거리 정보 실험(Data1)과 속도/거리정보와 가속도계를 추가 실험(Data2)을 원본 서명과 위조서명에 대한 테이블을 만들고, 비교하여 원본 서명의 인식률 확인한다. 제시한 방법은 각각 모바일 환경에서 10명이 20 번삑 손가락으로 테스트 하였다. 원본서명에서 딥 러닝중의 하나인 MLP를 실험한 결과 원본 서명에서 Data1은 92%, Data2는 95%의 정확도를 보였으며, 위조서명에서 Data1은 82%, Data2는 85%를 보였다. 그리고 AE에서 실험한 결과 Data1은 원본 서명에서 Data1은 95%, Data2는 97%의 정확도를 보였으며, 위조서명에서 Data1은 91.5%, Data2는 93%의 정확도가 보였다. 실험결과 위조서명에 대해서는 MLP로 위조서명을 분류하는 것보다 OAE에서 분류하는 것이 더 좋은 정확도를 보여준다.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.169-174
• /
• 2005

Electronic signature system is required to be used in the promotion of the e-Commerce. Because the application system for electronic signature system has inconvenience and vulnerability of security, users are reluctant to use it. Therefore, the electronic signature system should give a guarantee of convenience and security. In this paper, we propose server-based application model, which uses identity information and makes users access transparently to solve electronic signature problems. We also design and verify electronic signature system that reduces threats to security, which cause server attack by distributing the part of signature key to both server and client. The application model with lightweight server system based on the electronic signature system is expected to be used in the promotion of the e-Commerce and help to make its business more efficient and competitive.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.2
• /
• pp.377-387
• /
• 2009

Digital signatures not only provide a way of guaranteeing the integrity of data but also establish the identity of the signer. However, basic digital signature format which contains only the signature of the signer does not guarantee the correctness of its creation time, and it can not remain valid over long periods. This paper proposes a system which integrates timestamp service into digital signatures. The system provides online services for the creation and verification of long term digital signatures which can give the guarantee of the correctness of their creation times and can be proved to be valid over long periods. The proposed system can be used in the various areas such as e-commerce contracts, document archival services, and invoice applications, which requires long term digital signatures. The proposed system is tested with the KRISS timestamp service system.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.4
• /
• pp.169-176
• /
• 2003

Distributed signcryption was specially designed for distributing a signcrypted message to a designated group. Since a verifier of this signcryption should how the signer's public key in advance, it cannot provide the signer's anonymity. This study adds anonymity and non-repudiation by trusted party to the distributed signcryption with almost the same computational load. We also analyze security and computational loads of the proposed scheme. In addition, we extend our scheme to an efficient group signcryption.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.95-105
• /
• 2005

As a research on PKI is being very popular, the study relating to certificate status validation is being grown with aim to reduce an overhead of the protocol and to provide an efficient operation. The OCSP of the standard protocol related to the study enables applications to determine the revocation state of an identified certificate. However, the OCSP server can not service millions of certificate status validation requests from clients in a second on E-commerce because of the computational time for signature and verification. So, we propose the Real-time Certificate Status Validation Protocol(RCSVP) that has smaller computational time than OCSP. RCSVP server reduce the computational time of certificate status validation using hash function and common secret value. Also RCSVP client does not need the computational time of certificate verification to acquire the public key from an identified certificate. Therefore, the proposed protocol enables server to response millions of certificate status validation requests from clients in a second on E-commerce.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.1
• /
• pp.12-17
• /
• 2005

The segment matching method shows better performance than the global and points-based methods to compare reference signature with an input signature. However, the segment-to-segment matching method has the problem of decreasing recognition rate according to the variation of partitioning points. This paper proposes a fusion model based on the segment matching and HMM to construct a more reliable authentic system. First, a segment matching classifier is designed by conventional technique to calculate matching values lot dynamic information of signatures. And also, a novel HMM classifier is constructed by using the principal component analysis to calculate matching values for static information of signatures. Finally, SVM classifier is adopted to effectively combine two independent classifiers. From the various experiments, we find that the proposed method shows better performance than the conventional segment matching method.