Efficient Signature Scheme Research Articles

Improving Throughput of Mobile Sensors via Certificateless Signature Supporting Batch Verification

Mobile sensors enjoy the advantages of easy installation and low consumption, which have been widely adopted in many information systems. In those systems where data are generated rapidly, the throughput of the sensors is one of the most fundamental factors that determine the system functionality. For example, to guarantee data integrity, digital signature techniques can be applied. In many practical scenarios, such as the smart grid system, data are generated rapidly and, hence, the signature together with the data must also be transmitted and verified in time. This requires the mobile sensors to support a high-throughput data processing ability. In this setting, how to achieve efficient signature schemes supporting batch verification must be considered. Many signatures, such as the original national cryptographic standard, namely, the SM2 algorithm, do not support batch verification and are in a public-key infrastructure setting. In this paper, we propose a SM2-based certificateless signature scheme with batch verification, which is suitable for the aforementioned environment. The scheme extends the Chinese cryptographic standard SM2 algorithm to the certificateless setting and multiple signatures can be verified simultaneously. Another advantage of this scheme is that its signing phase does not involve any pairing operation. The verification phase only requires a constant pairing operation, which is not related to the number of signatures to be verified. The construction is generic and can be instantiated using any traditional signature scheme.

A Privacy-Preserving Data Aggregation Scheme Based on Chinese Remainder Theorem in Mobile Crowdsensing System

Mobile crowdsensing provides a large-scale reliable data, since sensing nodes support wide distribution, flexible mobility, and opportunistic connectivity. The generated data often contains the sensing node's sensitive information. Existing schemes dedicated to protecting the privacy of perception data, but these schemes cannot balance the computational and communication overheads well. Therefore, we propose a privacy-preserving data aggregation scheme based on the Chinese remainder theorem. Using blinding factor and Paillier homomorphic encryption technology, which not only ensures the privacy of perceived data but also improves the robustness of the system. Specially, the introduction of secure multicast communication technology based on the Chinese remainder theorem protects task privacy and ensures only designated sensing nodes can obtain the task. In addition, we design an efficient signature scheme to ensure data integrity. Detailed security analysis shows that our scheme is existentially unforgeable against adaptively chosen message attack. Extensive experiments and performance analysis show that our scheme is efficient and has a low communication overhead.

Efficient Linkable Ring Signature Scheme over NTRU Lattice with Unconditional Anonymity.

In cloud and edge computing, senders of data often want to be anonymous, while recipients of data always expect that the data come from a reliable sender and they are not redundant. Linkable ring signature (LRS) can not only protect the anonymity of the signer, but also detect whether two different signatures are signed by the same signer. Today, most lattice-based LRS schemes only satisfy computational anonymity. To the best of our knowledge, only the lattice-based LRS scheme proposed by Torres et al. can achieve unconditional anonymity. But the efficiency of signature generation and verification of the scheme is very low, and the signature length is also relatively long. With the preimage sampling, trapdoor generation, and rejection sampling algorithms, this study proposed an efficient LRS scheme with unconditional anonymity based on the e-NTRU problem under the random oracle model. We implemented our scheme and Torres et al.'s scheme, as well as other four efficient lattice-based LRS schemes. It is shown that under the same security level, compared with Torres et al.'s scheme, the signature generation time, signature verification time, and signature size of our scheme are reduced by about 94.52%, 97.18%, and 58.03%, respectively.

A Secure and Efficient Signature Scheme for IoT in Healthcare

To provide faster access to the treatment of patients, healthcare system can be integrated with Internet of Things to provide prior and timely health services to the patient. There is a huge limitation in the sensing layer as the IoT devices here have low computational power, limited storage and less battery life. So, this huge amount of data needs to be stored on the cloud. The information and the data sensed by these devices is made accessible on the internet from where medical staff, doctors, relatives and family members can access this information. This helps in improving the treatment as well as getting faster medical assistance, tracking of routine activities and health focus of elderly people on frequent basis. However, the data transmission from IoT devices to the cloud faces many security challenges and is vulnerable to different security and privacy threats during the transmission path. The purpose of this research is to design a Certificateless Secured Signature Scheme that will provide a magnificent amount of security during the transmission of data. Certificateless signature, that removes the intricate certificate management and key escrow problem, is one of the practical methods to provide data integrity and identity authentication for the IoT. Experimental result shows that the proposed scheme performs better than the existing certificateless signature schemes in terms of computational cost, encryption and decryption time. This scheme is the best combination of high security and cost efficiency and is further suitable for the resource constrained IoT environment.

Constructing efficient and secure batch signature schemes

In ordinary signature schemes, such as RSA, DSA, ECDSA, the signing process is performed only for a single message. Due to performance issues, in some contexts, the above solutions will become unsuitable if a party needs to sign multiple messages simultaneously. For example, in the authenticated key exchange protocols based on signatures between client and server, the server is expected to handle multiple key exchange requests from different clients simultaneously. Batch signing is a solution that generates signatures for multi-messages simultaneously with a single (ordinary) signature generation. In this article, we will consider some of the existing batch signing solutions and point out a few of their weakness. To deal with these problems, the paper also proposes two secure types of batch signature schemes, but still ensures the same efficiency as the existing batch signing solution.

SCBS: A Short Certificate-Based Signature Scheme With Efficient Aggregation for Industrial-Internet-of-Things Environment

The advent of the Internet of Things (IoT) has escalated the sharing of information among various smart devices many fold, irrespective of their geographical location. Recently, applications, such as e-healthcare, farm monitoring, border security, smart transportation, etc. have attracted wide attention from the research community. However, as devices in the Industrial-IoT (IIoT) environment share their information using the Internet, security issues, such as authentication, integrity, and confidentiality of data pose various challenges to the research community for the successful implementation of any solution. To handle these issues, several digital signature-based schemes have been designed in the past. However, because of the usage of the identity-based public-key cryptography (IDPKC) or certificate-less-based public-key cryptography (CLPKC), these schemes suffer from key escrow or secret key distribution problems. To eliminate these flaws, this article presents a short digital signature scheme without pairing in certificate-based setting with aggregation in IIoT environment. Besides, in IIoT environment, communication and computational costs are also considered as imperative challenges. In this regard, the pairing free construction, short length signature and aggregation make it a communication and computational efficient signature scheme. The performance comparison of the proposed scheme shows that our scheme causes less computational overhead and takes significantly less execution time as compared to the existing schemes, which is imperative for the resource limited IIoT devices. We also demonstrate that signature aggregation and verification cost is 6.67(n+2) ms which is much less in comparison to the verification cost ( 20.01n ms) of n short signatures.

On the Performance Analysis for CSIDH-Based Cryptosystems

In this paper, we present the performance and security analysis for various commutative SIDH (CSIDH)-based algorithms. As CSIDH offers a smaller key size than SIDH and provides a relatively efficient signature scheme, numerous CSIDH-based key exchange algorithms have been proposed to optimize the CSIDH. In CSIDH, the private key is an ideal class in a class group, which can be represented by an integer vector. As the number of ideal classes represented by these vectors determines the security level of CSIDH, it is important to analyze whether the different vectors induce the same public key. In this regard, we generalize the existence of a collision for a base prime p≡7mod8. Based on our result, we present a new interval for the private key to have a similar security level for the various CSIDH-based algorithms for a fair comparison of the performance. Deduced from the implementation result, we conclude that for a prime p≡7mod8, CSIDH on the surface using the Montgomery curves is the most likely to be efficient. For a prime p≡3mod8, CSIDH on the floor using the hybrid method with Onuki’s collision-free method is the most likely to be efficient and secure.

Secure and Efficient Identity-based Batch Verification Signature Scheme for ADS-B System

Secure and Efficient Identity-based Batch Verification Signature Scheme for ADS-B System

An Efficient and Provably Secure Certificateless Blind Signature Scheme for Flying Ad-Hoc Network Based on Multi-Access Edge Computing

Unmanned aerial vehicles (UAVs), when interconnected in a multi-hop ad-hoc fashion, or as a flying ad-hoc network (FANET), can efficiently accomplish mission-critical tasks. However, UAVs usually suffer from the issues of shorter lifespan and limited computational resources. Therefore, the existing security approaches, being fragile, are not capable of countering the attacks, whether known or unknown. Such a security lapse can result in a debilitated FANET system. In order to cope up with such attacks, various efficient signature schemes have been proposed. Unfortunately, none of the solutions work effectively because of incurred computational and communication costs. We aimed to resolve such issues by proposing a blind signature scheme in a certificateless setting. The scheme does not require public-key certificates, nor does it suffer from the key escrow problem. Moreover, the data that are aggregated from the platform that monitors the UAVs might be too huge to be processed by the same UAVs engaged in the monitoring task. Due to being latency-sensitive, it demands high computational capability. Luckily, the envisioned fifth generation (5G) mobile communication introduces multi-access edge computing (MEC) in its architecture. MEC, when incorporated in a UAV environment, in our proposed model, divides the workload between UAVs and the on-board microcomputer. Thus, our proposed model extends FANET to the 5G mobile network and enables a secure communication between UAVs and the base station (BS).

Secure and efficient certificateless aggregate signature scheme from bilinear pairings

ABSTRACTThe most important contribution of modern cryptography is the invention of digital signatures. To deal with specific application scenarios, digital signature schemes have been evolved with different variants. One of such variants is the aggregate signature scheme, which allows aggregation of different signatures by different users on different messages, to achieve computational and communication efficiency. Such schemes are useful in the design of Wireless Sensor Networks, Mobile Ad-hoc Networks, and Vehicular Ad-hoc Networks, where storage, bandwidth, and computational complexity are major constraints. In order to improve the computational and communicational efficiency along with security, in this paper, we propose a novel Certificateless Aggregate Signature (CLAS) scheme and extended it to achieve full aggregation. The proposed CLAS scheme uses bilinear pairings over elliptic curves and is proven secure in the Random Oracle Model under the assumption that Computational Diffie–Hellman Problem is hard. The security of the proposed CLAS scheme is proven without using forking lemma to achieve tight security. We compared our scheme with well-known existing schemes. Efficiency analysis shows that our scheme is much efficient than existing schemes in terms of communication and computational costs.

CB-CAS: Certificate-Based Efficient Signature Scheme With Compact Aggregation for Industrial Internet of Things Environment

The notion of aggregation of data in Industrial Internet of Things (IIoT) environment is a common practice. It shortens the data and associated signatures to reduce the bandwidth requirement. The compact aggregate signature (CAS) scheme creates a constant length aggregate signature (AS). Thus, the length of the CAS is independent of the number of messages or signatures to be aggregated. This article presents the first pairing-free CAS scheme in certificate-based settings. Due to the certificate-based approach, the proposed scheme is free from key escrow and key distribution problems inherited in identity-based cryptography (IDC) and certificate-less cryptography (CLC), respectively. Being compact and pairing free, it is the least bandwidth-consuming and the most efficient provably secure aggregation method. The length and computational cost analysis show that the scheme is the most appealing to use in the IIoT environment.

CB-PS: An Efficient Short-Certificate-Based Proxy Signature Scheme for UAVs

Recently, the deployment and usage of unmanned aerial vehicles (UAVs) to monitor and track a geographical region have been increased exponentially. The network infrastructure designed to deploy UAVs consists of sensors, actuators, and other communication smart devices for data collection and processing. As security and privacy is one of the challenging tasks in such an environment, so to design an efficient and secure data dissemination scheme is a challenging task due to limited storage and computation power of UAVs. To mitigate various attacks in such an environment, several efficient signature schemes were proposed in the literature. However, none of these schemes work well due to high computation and communication costs. To overcome these challenges, this paper presents a short proxy signature (CB-PS) scheme in certificate-based setting. Due to implicit usage of certificates, CB-PS solves inherent key escrow of ID-based designated verifier proxy signature. It also eliminates the necessity of secret key distribution in ID-based schemes. The proposed CB-PS scheme is adaptively unforgeable in a random oracle model. It is also efficient with respect to both signature length and computational complexity. The comparison of computational costs reveals that the proposed scheme consumes the least cost 15.45 ms in comparison to the costs of existing competitive schemes.

Short tightly secure signatures for signing a vector of group elements: A new approach

We give a new approach to build tightly secure signatures for signing a vector of group elements in a bilinear group. We illustrate its usefulness to construct efficient signature schemes by giving two new constructions of partially structure preserving signature schemes, a weaker version of structure preserving signatures which are still compatible with Groth-Sahai Non-Interactive Zero-Knowledge Proofs. The first scheme is simpler to analyze, while the second scheme is more efficient and has a signature size of only 3 group elements. This is comparable to the state-of-the art in tightly secure signatures in bilinear groups without the partial structure preserving property. We finally give a third construction using the same ideas, a tightly secure signature scheme in bilinear groups which is comparable with the state-of-the-art.

Efficient and Secure Certificateless Directed Proxy Signature Scheme without Pairings

Efficient and Secure Certificateless Directed Proxy Signature Scheme without Pairings

Efficient proxy ring signature for VANET

The messages in vehicular ad hoc networks (VANET) are vulnerable to attack in the open wireless environment. Group communication in VANET is receiving more attention, which confronts many security issues. First, only users who have passed legal authentication can communicate in the group. The ring signature is an effective solution. In addition, the group membership in the vehicular self-organising network changes rapidly, which leads to dynamic adjustment of group members. It is necessary to consider the computing power and communication capability of each node in the group members. To speed up the authentication process, a roadside unit with more computing power and communication capability than vehicles is selected as the signature agent, which effectively reduces the computational load of vehicles and accelerates the communication throughput. Meanwhile, the computational task and communication overhead have not been well-solved. To address these issues, this paper proposed an efficient proxy ring signature scheme for VANET to achieve higher signature efficiency and lower transmission overhead. The scheme allows both privacy protection and original signer tracing. Security analysis shows that the proposed scheme meets the security requirements of VANET.

On Tight Security Proofs for Schnorr Signatures

The Schnorr signature scheme is the most efficient signature scheme based on the discrete logarithm problem and a long line of research investigates the existence of a tight security reduction for this scheme in the random oracle model. Almost all recent works present lower tightness bounds and most recently Seurin EUROCRYPT 2012 showed that under certain assumptions the non-tight security proof for Schnorr signatures in the random oracle by Pointcheval and Stern EUROCRYPT’96 is essentially optimal. All previous works in this direction rule out tight reductions from the (one-more) discrete logarithm problem. In this paper, we introduce a new meta-reduction technique, which shows lower bounds for the large and very natural class of generic reductions. A generic reduction is independent of a particular representation of group elements. Most reductions in state-of-the-art security proofs have this property. It is desirable, because then the reduction applies generically to any concrete instantiation of the group. Our approach shows unconditionally that there is no tight generic reduction from any natural non-interactive computational problem $$\Pi $$ defined over algebraic groups to breaking Schnorr signatures, unless solving $$\Pi $$ is easy. In an additional application of the new meta-reduction technique, we also unconditionally rule out any (even non-tight) generic reduction from natural non-interactive computational problems defined over algebraic groups to breaking Schnorr signatures in the non-programmable random oracle model.

An Efficient Signature Scheme From Supersingular Elliptic Curve Isogenies

Since supersingular elliptic curve isogenies are one of the several candidate sources of hardness for building post-quantum cryptographic primitives, the research of efficient signature schemes based on them is still a hot topic. In this paper, we present a many-time signature scheme based on the hash function from supersingular elliptic curve isogenies over the finite field F p2 where p = 2 521 - 1. Our signature scheme achieves smaller signature sizes relative to other post-quantum signature schemes based on supersingular elliptic curve isogenies, such as Galbraith's signature schemes (AsiaCrypt 2017) and Yoo's scheme (FC 2017). The structure of our scheme follows that of the hash-based signature scheme submitted to National Institute of Standards and Technology for post-quantum cryptography in 2018 with some modifications. To complete the construction, we firstly apply the method of Weil restriction to improve the efficiency of hash function from supersingular elliptic curve isogenies by approximately 30%, then propose a new Winternitz one-time signature scheme based on the hash function. Finally, we implement the signature scheme.

Efficient Signature Scheme for Delivering Authentic Control Commands in the Smart Grid

Enabling secure delivery of control commands and alert messages is one of the critical requirements of smart grid communications. If adversaries were to gain access, they could alter or send malicious commands from the Control Center (CC), intended to the Remote Terminal Units (RTUs) and Intelligent Electronic Devices (IEDs). These malicious commands could disrupt power system operations and cause damage to power devices. In this paper, we propose an efficient signature scheme for ensuring the delivery of only legitimate commands over the communication network. We propose efficient signatures using hash that are sent by the CC along with commands for protecting command alteration over the network, which also provide sender authenticity by verifying the signatures at the RTU/IED. By using the proposed scheme, both random and malicious commands sent by an adversary are discarded. The security analysis shows that the scheme is secure against replay, repudiation and impersonation attacks. The performance evaluation and prototype simulation show that our signature scheme using SHA1, SHA256 and SHA384 is feasible, and can be used for communications from the CC to the field.

Efficient leakage-resilient blind and partially blind signatures

The techniques of the blind and partially blind signatures play an important role in numerous applications, most prominently in electronic voting and electronic cash. In this paper, we first present formal definitions of leakage-resilient blind and partially blind signatures. Subsequently, we propose an efficient leakage-resilient blind signature scheme and an efficient leakage-resilient partially blind signature scheme in the continual leakage model. The proposed leakage-resilient blind signature scheme is the first protocol which is secure even in a setting where the adversary may obtain leakage information on the signer's or user's internal state, including secret key and the randomness. However, in the only known leakage-resilient blind signature scheme which was proposed by Ruckert, the adversary is given the leakage information only about the signer's secret key. The proposed partially blind signature scheme is the first leakage-resilient partially blind signature scheme. Also, we analyse their security and efficiency in the generic bilinear group model.

Improvement of signature scheme based on factoring and chaotic maps

Chain and Kuo (2013) proposed an efficient signature scheme based on chaotic maps and factorisation. Their scheme is secure but requires many keys for signing documents. In this article, we shall propose an improvement of Chain and Kuo's signature scheme. The improved scheme will outperform their scheme in the number of keys.