• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.865-867
• /
• 2009

This paper is a research on the statistical analysis of the feature information for the dynamic signature verification. we could improved processing time and reduce signature database without increase of error rate. We have used statistical analysis method T-test for the verification based on the experimental results.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.665-670
• /
• 2006

This paper deals with a modified method of the dynamic time warping and feature points to extract various important information of the signature for the dynamic signature verification. We could achieve lower equal error rate, small and efficient feature points and fast processing time for the notification.

• Journal of KIISE:Software and Applications
• /
• v.34 no.12
• /
• pp.1065-1074
• /
• 2007

Among various methods to compare reference signatures with an input signature, the segment-to-segment matching method has more advantages than global and point-to-point methods. However, the segment-to-segment matching method has the problem of having lower recognition rate according to the variation of partitioning points. To resolve this drawback, this paper proposes a signature verification method by considering linear discriminant analysis as well as segment-to-segment matching method. For the final decision step, we adopt statistical based Bayesian classifier technique to effectively combine two individual systems. Under the various experiments, the proposed method shows better performance than segment-to-segment based matching method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.4
• /
• pp.430-435
• /
• 2006

In this paper, we propose a method based on multimodal biometrics system using the face and signature under ubiquitous computing environments. First, the face and signature images are obtained by PDA and then these images with user ID and name are transmitted via WLAN(Wireless LAN) to the server and finally the PDA receives verification result from the server. The multimodal biometrics recognition system consists of two parts. In client part located in PDA, user interface program executes the user registration and verification process. The server consisting of the PCA and LDA algorithm shows excellent face recognition performance and the signature recognition method based on the Kernel PCA and LDA algorithm for signature image projected to vertical and horizontal axes by grid partition method. The proposed algorithm is evaluated with several face and signature images and shows better recognition and verification results than previous unimodal biometrics recognition techniques.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.385-396
• /
• 2005

In this paper, a new structural approach to on-line signature verification is presented. A primitive pattern is defined as a part segmented by a local minimal position of speed. And a structural description of signature is composed of subpatterns which are defined as such forms as rotation shape, cusp shape and bell shape, acquired by composition of the primitives regarding the directional changes. As the matching method to find identical parts between two signatures, a modified DP(dynamic programming) matching algorithm is presented. And also, variation and complexity of local parts are computed from the training samples, and reference model and decision boundary are derived from these. Error rate, execution time and memory usage are compared among the functional approach, the parametric approach and the proposed structural approach. It is found that the average error rate can be reduced from 14.2% to 4.05% when the local parts of a signature are weighted and the complexity is used as a factor of decision threshold. Though the error rate is similar to that of functional approaches. time consumption and memory usage of the proposed structural approach are shown to be very effective.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6243-6259
• /
• 2019

As a foundation of next-generation air transportation systems, automatic dependent surveillance-broadcast (ADS-B) helps pilots and air traffic controllers create a safer and more efficient national airspace system. Owing to the open communication environment, it is easy to insert fake aircraft into the system via spoofing or the insertion of false messages. Efforts have thus been made in academic research and practice in the aviation industry to ensure the security of transmission of messages of the ADS-B system. An identity-based batch verification (IBV) scheme was recently proposed to enhance the security and efficiency of the ADS-B system, but current IBV schemes are often too resource intensive because of the application of complex hash-to-point operations or bilinear pairing operations. In this paper, we propose a lightweight IBV signature scheme for the ADS-B system that is robust against adaptive chosen message attacks in the random oracle model, and ensures the security of batch message verification and against the replaying attack. The proposed IBV scheme needs only a small and constant number of point multiplication and point addition computations instead of hash-to-point or pairing operations. Detailed performance analyses were conducted to show that the proposed IBV scheme has clear advantages over prevalent schemes in terms of computational cost and transmission overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.462-466
• /
• 2005

Dynamic (On-line) signature verification system consists of preprocessing, feature extraction, comparison and decision process for internal processing, and registration and verification windows for the user interface. We describe an implementation and design for an advanced dynamic signature verification system. Also, we suggest the method of feature extraction, matching algorithm, efficient user interface and an objective criteria for evaluating the performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1345-1352
• /
• 2010

The structural approach in the signature verification, representing a signature as a structural form of local primitives, shows an excellent performance since it counts in the local characteristics such as local variation, stroke complexity, and etc. However, this method has a problem of template data sizing which can not fix the number of subpatterns comprising a signature. In this paper, we proposed a new algorithm to reduce the signature data into a fixed size by selecting a fixed number of subpatterns which is considered as important parts. As a result, it shows more excellent performance when the fixed sized sub-patterns is applied with local weights extracted from variational characteristics and complexities in local part. And the number of subpatterns representing a signature reference model can be fixed under a certain number of segments determined appropriately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1693-1698
• /
• 2009

This paper is a research on the feature information using direction information and adjusting constant w for the dynamic signature verification. We could improved processing time and reduce signature database without the increase of error rate. We could confirmed these results by using statistical method T-test.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.286-288
• /
• 2012

Facing the counterfeiting acts towards various products, many manufacturers implement ePedigree system to secure their supply chain. Using ePedigree, a distribution history including a valid product identifier from the manufacturer until the final retailer is recorded. And this ePedigree is signed by each involved supply chain party using digital signature. With this digital signature, any unauthorized alteration to the ePedigree document would generate a failed verification process. If there is a counterfeit product using a fake ePedigree document, it wouldn't be able to pass the verification process either. Hence, there wouldn't be any counterfeit product that could enter the legal supply chain and bought by the consumer. We are proposing to use ECDSA instead of RSA since it has faster performance and shorter key size. At a certain same security level, ECDSA only needs 163 bits, while RSA needs 1024 bits.