Signature Verification Algorithm Research Articles

Efficient privacy protection scheme with batch verification in smart grid

Smart grids can establish two-way communication with users, collect their electricity consumption data and provide reasonable pricing, but fine-grained electricity consumption data leads to the leakage of user privacy. In order to protect the privacy of user data and the security of data transmission process, this article proposes an efficient and batch validated privacy protection scheme. In this scheme, legitimate entities transmit encrypted electricity data after mutual authentication. To ensure the correct data is received, we propose a new batch signature verification algorithm. Security analysis shows that our solution achieves user privacy and data security. The simulation experiments provided demonstrate that the efficiency of the proposed scheme can satisfy the requirements of real-time communication.

DWSCNN Online Signature Verification Algorithm Based on CAE-MV Feature Dimensionality Reduction

DWSCNN Online Signature Verification Algorithm Based on CAE-MV Feature Dimensionality Reduction

Lightweight Privacy and Security Computing for Blockchained Federated Learning in IoT

The development of Internet of Things (IoT) makes human life more intelligent, and the interconnection of all things has become a reality. However, the surge in the number of devices and centralized management brings severe challenges to IoT, such as single point of failure, poor security, privacy leakage, and low reliability. Due to the decentralization, verifiability and privacy protection of blockchain federated learning, some blockchain federated learning schemes have been proposed to solve these problems, but bring new challenges, such as device privacy leakage and heavy security computing load. In this paper, we propose a new decentralized, secure and verifiable consortium blockchain federated learning privacy protection scheme, named LPBFL, which realizes lightweight computing while ensuring the privacy of the local model and dataset of the device. To achieve lightweight privacy protection, LPBFL adopts the Paillier encryption and the newly designed lightweight digital signature and batch verification algorithm. Additionally, considering that devices upload invalid or even toxic local models intentionally or unintentionally, we design a device reputation selection mechanism to make blockchain federated learning more efficient. Finally, the theoretical analysis proves the security of LPBFL and verifies the unforgeability of the proposed digital signature. Comprehensive comparisons and extensive experiments demonstrate that our LPBFL has significant advantages in multiple aspects.

Efficient and Flexible Multiauthority Attribute-Based Authentication for IoT Devices

The correctness and reliability of data sources are the keys to the practicality of data collected by IoT devices. Attribute-based signature(ABS) is a cryptographic primitive for users to sign with their own attributes, which can be applied to the authentication process in IoT scenarios. The attribute authority is responsible for issuing the attribute key to the user in ABS. Multiple authorities can complete attribute management tasks to avoid the threat of a single authority. However, attribute authorities need to execute multiple interactions to collaborate to generate attribute keys for users, which brings a large transmission burden. In addition, a lot of resource-constrained terminals in the IoT mostly play the role of signer or verifier in authentication protocols. The signature generation and verification algorithms often have heavy pairing and exponentiation operations. Currently, no ABS scheme takes into account the efficiency of all participating entities simultaneously. In this paper, we present an aggregated anonymous key issue (AAKI) protocol to reduce the transmission burden between multiple authorities. Meanwhile, the non-interactive zero-knowledge proof aggregate exponentiation (NI-ZKPoKAE) protocol is designed to aggregate the transmitted secret values in AAKI. To reduce the computational burden of signers and verifiers, Blakley secret sharing, where the Hadamard matrix is used more efficiently to handle the (n,n)-threshold, is used to construct an efficient and fine-grained multi-authority ABS (EFMA-ABS) scheme. This brings high efficiency to all three types of parties involved in IoT authentication. Our above-mentioned protocols have been proven to be feasible and effective.

Feature selection method based on quantum inspired genetic algorithm for Arabic signature verification

Feature selection method based on quantum inspired genetic algorithm for Arabic signature verification

Implementation of Block-Level Double Encryption Based on Machine Learning Techniques for Attack Detection and Prevention

Cloud computing is one of the most important business models of modern information technology. It provides a minimum of various services to the user interaction and low cost (hardware and software). Cloud services are based on the newline architectures on virtualization by using the multitenancy for better resource management and newline strong isolation between several virtual machines (VMs). The spying on a victim VM is challenging, particularly when one wants to use per-core microarchitectural features as a side channel. For example, the cache contains the most potential for damaging side channels, but shared information across different cores affects the cloud information. To overcome this problem, propose the Secure Block-Level Double Encryption (SBLDE) algorithm for user signature verification in the cloud server. It uses identity-based detection techniques to monitor the colocated VMs to identify abnormal cache data and channel behaviors typically during VM data transformation. The identity-based linear classification (IBLC) method is used for classifying the attacker channel when the data is transferred/retrieved from the VM cloud server. This cloud controller finds the channel misbehavior to block the port or channel, changing other available ports’ communication. The service verification provides strong user access permission on the cloud server when the unknown request to the cloud server suddenly executes the key authentication to verify the user permission. This linear classification trains the existing side-channel attack datasets to the classifier and identifies the VM cloud’s attack channel. The study focused on preventing attacks from interrupting the system and serves as an effective means for cross-VM side-channel attacks. This proposed method protects the cloud data and prevents cross-VM channel attack detection efficiently, compared to other existing methods. In this overall proposed method, SBLDE’s performance is to be evaluated and then compared with the existing method.

A Secure Live Signature Verification with Aho-Corasick Histogram Algorithm for Mobile Smart Pad

There is a long history of using handwritten signatures to verify or authenticate a “signer” of the signed document. With the development of Internet technology, many tasks can be accomplished through the document management system, such as the applications of digital contracts or important documents, and more secure signature verification is demanded. Thus, the live handwriting signatures are attracting more interest for biological human identification. In this paper, we propose a handwriting signature verification algorithm by using four live waveform elements as the verification features. A new Aho-Corasick Histogram mechanism is proposed to perform this live signature verification. The benefit of the ACH algorithm is mainly its ability to convert time-series waveforms into time-series short patterns and then perform a statistical counting on the AC machine to measure the similarity. Since AC is a linearly time complexity algorithm, our ACH method can own a deterministic processing time. According to our experiment result, the proposed algorithm has satisfying performance in terms of speed and accuracy with an average of 91% accuracy.

Digital signature scheme on the 2 x 2 matrix algebra

The article considers the structure of the 2x2 matrix algebra set over a ground finite field GF(p). It is shown that this algebra contains three types of commutative subalgebras of order p2, which differ in the value of the order of their multiplicative group. Formulas describing the number of subalgebras of every type are derived. A new post-quantum digital signature scheme is introduced based on a novel form of the hidden discrete logarithm problem. The scheme is characterized in using scalar multiplication as an additional operation masking the hidden cyclic group in which the basic exponentiation operation is performed when generating the public key. The advantage of the developed signature scheme is the comparatively high performance of the signature generation and verification algorithms as well as the possibility to implement a blind signature protocol on its base.

An Improved Provable Secure Certificateless Aggregation Signature Scheme for Vehicular Ad Hoc NETworks

Vehicular Ad hoc NETworks (VANETs) which is an important part of smart cities are large networks that organize wireless communication and information exchange between vehicles and X (X: cars, roads, pedestrians, and the Internet). The security and efficiency of the message authentication algorithm are crucial to the VANETs. After analyzing the security shortage of Wang Daxing et al VANETs message authentication scheme, an improved provable secure certificateless aggregation signature scheme for VANETs is proposed. The scheme constructs a secure certificateless aggregation authentication scheme by using Elliptic Curve Cryptography (ECC) and reduces the complexity of the cryptographic operation process, while achieving user’s conditional privacy protection. Rigid security analysis proves that the scheme satisfies the security requirements of VANETs. The performance analysis shows the proposed scheme considerably reduces the computational cost of message signature, single verification and aggregation verification algorithm, and reduces the communication cost when compared with Wang schemes.

Enhanced Security Identity-Based Privacy-Preserving Authentication Scheme Supporting Revocation for VANETs

Existing conditional privacy-preserving communication protocols based on a tamper-proof device (TPD) in vehicular ad hoc networks (VANETs) face the challenges of master key compromise and vehicle revocation. To address these challenges, we propose a new identity-based anonymous authentication scheme. In this scheme, the master key of the system will not be directly installed in the TPD; hence, it is impossible for an adversary to obtain the system master key from the TPD. To generate the private key of the vehicle, an additional secret is required, and this secret is provided by the roadside unit (RSU). Therefore, revoking a malicious vehicle from the VANETs is efficient, since the RSU only needs to stop generating the up-to-date secret for the vehicle. In addition, the signature verification algorithm of the scheme involves no bilinear pairing operations, making the verification process more efficient. The security of the scheme is proved to be equivalent to the elliptic curve discrete logarithm assumption in the random oracle. The experimental results show that the authentication of the scheme is more efficient, and the communication cost has been diminished.

Distance and Fuzzy Classifiers Alliance: The Solution to Off-line Arabic Signature Verification System for Forensic Science

Signature of a person is one of the most popular and legally accepted behavioral biometrics that provides secure means for verification and personal identification in many applications such as financial, commercial and legal transactions. The objective of the signature verification system is to classify between genuine and forgery that is often associated with intrapersonal and interpersonal variability. Unlike other languages, Arabic has unique features; it contains diacritics, ligatures, and overlapping. Because of lacking any form of dynamic information during the Arabic signature writing process, it will be more difficult to obtain higher verification accuracy. This paper addresses the above difficulty by introducing a novel Off-Line Arabic signature verification algorithm. Different from state-of-the-art works that adopt one-level of verification or multiple classifiers based on statistical learning theory; this work employs two-level of fuzzy set related verification. The level one verification depends on finding the total difference between the features extracted from the test signature and the mean values of each corresponding features in the training signatures (owning the same signature). Whereas, the level two verification relies on the output of the fuzzy logic module depending on the membership functions that has been created from the signature features in the training dataset for a specific signer. It is concluded from the experimental results that the verification system performs well and has the ability to reduce both False Acceptance Rate (FAR) and False Rejection Rate (FRR).

Privacy Protection Scheme for Data Aggregation in Wireless Sensor Networks Based on PRDA+ Protocol

<p class="0abstract"><span lang="EN-US">To improve the data aggregation privacy protection scheme in wireless sensor network (WSN), a new scheme is put forward based on the privacy protection of polynomial regression and the privacy protection method based on the homomorphic encryption. The polynomial data aggregation (PRDA+) protocol is also proposed. In this scheme, the node and the base station will pre-deploy a secret key, and the random number generator encrypts the random number for the seed through the private key, which protects the privacy of the data. Then, by comparing the decrypted aggregate data through the correlation between the two metadata, the integrity protection of the data is realized. A weighted average aggregation scheme that can be verified is proposed. In view of the different importance of user information, the corresponding weights are set for each sensor node. EL Gamal digital signature is used to authenticate sensor nodes. The results show that the signature verification algorithm enables the scheme to resist data tampering and data denial, and to trace the source of erroneous data.</span></p>

Server-Aided Attribute-Based Signature With Revocation for Resource-Constrained Industrial-Internet-of-Things Devices

The industrial Internet-of-things (IIoT) can be seen as the usage of Internet-of-things technologies in industries, which provides a way to improve the operational efficiency. An attribute-based signature (ABS) has been a very useful technique for services requiring anonymous authentication in practice, where a signer can sign a message over a set of attributes without disclosing any information about his/her identity, and a signature only attests to the fact that it is created by a signer with several attributes satisfying some claim predicate. However, an ABS scheme requires exponentiation and/or pairing operations in the signature generation and verification algorithms, and hence, it is quite expensive for resource-constrained devices like a sensor in the IIoT network to run an ABS scheme. To reduce the computational overheads for both signers and verifiers, it has been suggested to introduce a server to help with signature generation and verification, but existing results on the ABS with “server-aided computation” either suffer from the security issues or are not sufficiently efficient. In this paper, we consider server-aided ABS one step further, and propose a notion called server-aided ABS with revocation (SA-ABSR), which not only securely mitigates the workloads of users in generating and verifying signatures, but also enables user revocation by having the server immediately stop signature generations for revoked signers. We formally define the security model for SA-ABSR, present a concrete construction of SA-ABSR based on a standard ABS scheme, and prove its security under the defined security model. Also, we implement the proposed SA-ABSR scheme and the underlying standard ABS scheme to evaluate the performance, from which it is easy to see that the proposed SA-ABSR scheme is more efficient than its underlying ABS scheme.

A Practical Scheme of Smart Grid Privacy Protection

In view of the shortcomings of security loopholes, high overhead and single data types in the current smart grid privacy protection scheme, a practical smart grid privacy protection scheme is proposed in this paper. In terms of security, the combination of an improved Pilliar algorithm and an identity-based pseudonym algorithm realizes a combination of data aggregation technology and identity anonymity technology, making the user’s privacy more secure. In the aspect of system overhead, an identity based batch signature verification algorithm is adopted, which makes the number of bilinear pairings calculated only 3 times and has nothing to do with the number of users. Moreover, the improved Paillier algorithm used also greatly reduces the computational overhead. In terms of data types, the combination of super-incremental digital sequences and ladder power consumption fusion algorithms allows the control center to obtain a variety of data. Therefore, this scheme has the characteristics of security, high efficiency and diversification of data types.

A real-world online signature verification system based on correlation algorithm

Handwriting signature is one of features of the biometric identification and authentication, which is used to verify or authenticate a 'signer' and the document signed. US law (the electronic signatures (E-Sign) in Global and National Commerce Act) and the United Nations Commission on International Trade Law Model Law on Electronic Commerce already grant electronic signatures legal validity equivalent to traditional hand-written counterparts. The intention of those laws is to cut costs while providing more stringent security, especially in the emerging e-commerce arena. In this paper, we (a) describe fundamentals and the current status of electronic signatures in detail. (b) Propose an online handwriting signature verification algorithm by using four online elements as the verification features (they are X axle, Y axle, pressure and velocity (time). Correlation algorithm is used to test and verify signatures. (c) Develop a real world application system with the online electronic signature.

Online signature verification using double‐stage feature extraction modelled by dynamic feature stability experiment

Identification based on signature verification is one of the most popular biometric methods which were used even prior to the advent of computers. In the field of dynamic signature verification, signatures' time functions (e.g. pen tip velocity, acceleration and pressure) are analysed in addition to static appearance of signatures. Dynamic feature stability (DFS) experiment is a process for finding the most stable signature partitions which are difficult to forge. The experiment can most effectively lead to a focus on the signature trajectories. Due to the different angles related to the signature pad which are regarded as major problem in signature verification algorithms, in this study, radon transform is used to transform rotation effect to shift effect. Convolutional neural network disregards the precise location of image features, as well as shift effects in both axes of image that is decline by its nature. According to DFS experiment, three independent recognition paths are structured and their effects on final classification are determined by the experiment. Three Persian datasets are analysed by DFS, which led to a reliable trait of Persian signatures. As a result, the least verification error is attained. Besides, SVC2004, as an international benchmark is evaluated by the proposed algorithm.

SVM Based Online Signature Verification Technique Using Reference Feature Vector

A new algorithm for online signature verification has been presented in this study. The eighty features are identified and used to characterize the online signatures. The signatures are further represented in a vector form by using symbolic representation. In proposed algorithm, two Reference feature vector for both genuine and forgery signature vector are generated for training purpose by the use of random intervals. The two class SVM classifier has been implemented for the verification task. The rigorous experiments by generating nearly a total of 1,000,000 training and testing files are performed to check the performance of the system. The popular benchmark database from first signature verification competition held in 2004 is considered for experimentation. The results are shown in terms of FAR and FRR. We have obtained a minimum value of mean FAR and mean FRR as 7.0092 and 2.2633 respectively for the same dataset in comparison to previous work. After performing sixty more iterations, we have evaluated sixty such values of FAR and FRR by changing the width of the original interval up to sixty times and analyzed behavior shows that if we keep on increasing the width of the original interval, the value of mean FAR and the corresponding FRR will keep on decreasing to the minimum level.

Proposal of Enhancement for Quartz Digital Signature

Today, we see a large dependence on systems developed with cryptography. Especially in terms of public key cryptosystems, which are widely used on the Internet. However, public key cryptography was threatened and new sources began to be investigated when Shor in 1997 developed a polynomial time algorithm for factoring integers and to compute the discrete logarithm with a quantum computer. In this context, Patarin proposed Hidden Field Equations (HFE), a trapdoor based on 𝓜𝓜𝓜𝓜 (𝓜𝓜ultivariate 𝓠𝓠uadratic) and IP (Isomorphism of Polynomials) problems. Such problems are not affected by the Shor algorithm, moreover 𝓜𝓜𝓜𝓜 Problem was proved by Patarin and Goubin to be NP-complete. Despite the basic HFE has been broken, there are variants that are secure, obtained by a generic modification. The Quartz – digital signature scheme based on HFEv-, with special choice of parameters – is a good example of this resistance to algebraic attacks aimed at the recovery of the private key, because even today it remains secure. Furthermore, it also generates short signatures. However, Joux and Martinet, based on axioms of Birthday Paradox Attack, proved that Quartz is malleable, showing that if the adversary has a valid pair (message, signature), he can get a second signature with 𝟐𝟐𝟓𝟓𝟓𝟓 computations and 𝟐𝟐𝟓𝟓𝟓𝟓 calls to the signing oracle, so that the estimated current security standards are at least 𝟐𝟐𝟏𝟏𝟏𝟏𝟏𝟏. Thus, based on Quartz, we present a new digital signature scheme, achieving the adaptive chosen message attacks that make calls to the random oracle, with a security level estimated at 𝟐𝟐𝟏𝟏𝟏𝟏𝟏𝟏. Our cryptosystem also provides an efficiency gain in signature verification algorithm and vector initializations that will be used for signing and verification algorithms. Furthermore we provide an implementation of Original Quartz and Enhanced Quartz in the Java programming language.

Proposal of Enhancement for Quartz Digital Signature

Today, we see a large dependence on systems developed with cryptography. Especially in terms of public key cryptosystems, which are widely used on the Internet. However, public key cryptography was threatened and new sources began to be investigated when Shor in 1997 developed a polynomial time algorithm for factoring integers and to compute the discrete logarithm with a quantum computer. In this context, Patarin proposed Hidden Field Equations (HFE), a trapdoor based on MQ (Multivariate Quadratic) and IP (Isomorphism of Polynomials) problems. Such problems are not affected by the Shor algorithm, moreover MQ Problem was proved by Patarin and Goubin to be NP-complete. Despite the basic HFE has been broken, there are variants that are secure, obtained by a generic modification. The Quartz - digital signature scheme based on HFEv-, with special choice of parameters - is a good example of this resistance to algebraic attacks aimed at the recovery of the private key, because even today it remains secure. Furthermore, it also generates short signatures. However, Joux and Martinet, based on axioms of Birthday Paradox Attack, proved that Quartz is malleable, showing that if the adversary has a valid pair (message, signature), he can get a second signature with 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">50</sup> computations and 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">50</sup> calls to the signing oracle, so that the estimated current security standards are at least 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">112</sup> . Thus, based on Quartz, we present a new digital signature scheme, achieving the adaptive chosen message attacks that make calls to the random oracle, with a security level estimated at 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">112</sup> . Our cryptosystem also provides an efficiency gain in signature verification algorithm and vector initializations that will be used for signing and verification algorithms. Furthermore we provide an implementation of Original Quartz and Enhanced Quartz in the Java programming language.

Automated Offline Arabic Signature Verification System using Multiple Features Fusion for Forensic Applications

The signature of a person is one of the most popular and legally accepted behavioral biometrics that provides a secure means for verification and personal identification in many applications such as financial, commercial and legal transactions. The objective of the signature verification system is to classify between genuine and forged signatures that are often associated with intrapersonal and interpersonal variability. Unlike other languages, Arabic has unique features; it contains diacritics, ligatures, and overlapping. Because of lacking any form of dynamic information during the Arabic signature’s writing process, it will be more difficult to obtain higher verification accuracy. This paper addresses the above difficulty by introducing a novel offline Arabic signature verification algorithm. The key point is using multiple feature fusion with fuzzy modeling to capture different aspects of a signature individually in order to improve the verification accuracy. State-of-the-art techniques adopt the fuzzy set to describe the properties of the extracted features to handle a signature’s uncertainty; this work also employs the fuzzy variables to describe the degree of similarity of the signature’s features to deal with the ambiguity of questioned document examiner judgment of signature similarity. It is concluded from the experimental results that the verification system performs well and has the ability to reduce both False Acceptance Rate (FAR) and False Rejection Rate (FRR).