In on-line signature verification, complexity of signature shape can influence the value of the optimal threshold for individual signatures. If writer-dependent threshold selection is not possible, some threshold equalization method based on the complexity of signatures is needed. In this paper, we propose three different threshold equalization methods based on (i) average number of samples, (i...

ER (Extended R-squared) is proposed as a similarity measure for on-line signature verification. SLR (Simple Linear Regression) defines R as a measure of goodnessof-fit. We observed that R is a good similarity measure for 1-dimensional sequences. However, many kinds of sequences are multidimensional, such as on-line signature sequences, 2D curves, etc. Therefore, we extend R to ER for multidimen...

An identity (ID)-based signature scheme allows any pair of users to communicate securely and to verify each other’s signatures without exchanging public key certificates. We have several ID-based signatures based on the discrete logarithm problem. While they have an advantage that the system secret can be shared by several parties through threshold schemes, they have a critical disadvantage in ...

We are developing methods for online (or dynamical) signature verification. Our method is first to move the test signature to the sample signature so that the DP matching can be done well, and then compare the pen information along the matched points of the signatures. However, it is not easy to determine how to use the several elements of discrepancy between them. In this paper, we propose a v...

By combining the two notations of ring signature and authenticated encryption together, we introduce a new type of authenticated encryption signature, called ring authenticated encryption, which has the following properties: signer-ambiguity, signer-verifiability, recipient-designation, semantic-security, verification-convertibility, verification-dependence and recipient-ambiguity. We also give...

In order to reduce the computational complexity of the DWT domain on-line signature verification, the authors propose to utilize the pen-movement vector as an input parameter. Experimental results indicate that the verification rate obtained using the pen-movement vector parameter is equivalent to that obtained by the conventional method, although the computational complexity of the proposed me...

Signature is a behavioral biometric: it is not based on the physical properties, such as fingerprint or face, of the individual, but behavioral ones. Signature verification is split into two according to the available data in the input. Offline (static) signature verification takes as input the image of a signature and is useful in automatic verification of signatures found on bank checks and d...

In this paper, we introduce an efficient Conditional Privacy-Preserving authentication scheme(ECPB) based on group signature for vehicular ad hoc networks (VANETs). Although group signature is widely used in VANETs for security requirements, the existing schemes based on group signatures suffer longer computational delays in the certificate revocation list (CRL) checking and in the signature ve...

A minimum-knowledge scheme allows a claimant to prove its Identity to a verifier without disclosing any secret information. Minimum-knowledge schemes, incorporating identity verification, signature generation and verification, are generally based on interactive proofs. The Ohta-Okamoto minimum-knowledge identification and signature scheme is characterised by a good balance between the claimant’...

p ) , only the legitimate signer with knowledge of x can generate the signatures to satisfy the verification. Although the attacker can generate bogus signatures in the signature collection protocol, these signatures cannot satisfy the batch verification criterion. There are some other secure ElGamal type signature schemes as proposed in [4] that can also be used to design similar DSA type secu...