Identity-based Signature Scheme Research Articles

A Secure ID Based Group Signature Scheme Based on Factoring and Discrete Logarithm Problem

ABSTRACTGroup signature scheme allows group members to sign an arbitrary number of messages on behalf of the group without revealing their identity. In case of dispute, the group manager holding a tracing key can reveal the identity of the signer from the signature. Tseng-Jan (Tseng & Jan, 1998) proposed a novel ID-based group signature scheme which is unforgeable. In this article we propose a secure ID-based group signature scheme based on factoring and discrete logarithm problem. Our Scheme is more secure as compared to Tseng-Jan group signature scheme.

<italic>BASIS</italic>: A Practical Multi-User Broadcast Authentication Scheme in Wireless Sensor Networks

Multi-user broadcast authentication is an important security service in wireless sensor networks (WSNs), as it allows a large number of mobile users of the WSNs to join in and broadcast messages to WSNs dynamically and authentically. To reduce communication cost due to the transmission of public-key certificates, broadcast authentication schemes based on identity (ID)-based cryptography have been proposed, but the schemes suffer from expensive pairing computations. In this paper, to minimize computation and communication costs, we propose a new provably secure pairing-free ID-based signature schemes with message recovery, MR-IBS , and PMR-IBS . We then construct an ID-based multi-user broadcast authentication scheme, BASIS , based on MR-IBS and PMR-IBS for broadcast authentication between users and a sink. We evaluate the practical feasibility of BASIS on WSN hardware platforms, MICAz and Tmote Sky are used in real-life deployments in terms of computation/communication cost and energy consumption. Consequently, BASIS reduces the total energy consumption on Tmote Sky by up to 72% and 17% compared with Bloom filter-based authentication scheme based on a variant of ECDSA with message recovery and IMBAS based on a ID-based signature scheme with message appendix, respectively.

Fuzzy identity-based signature scheme from lattice and its application in biometric authentication

Fuzzy identity-based signature scheme from lattice and its application in biometric authentication

Lattice-based strongly-unforgeable forward-secure identity-based signature scheme with flexible key update

Lattice-based strongly-unforgeable forward-secure identity-based signature scheme with flexible key update

A Secure ID-Based Blind and Proxy Blind Signature Scheme from Bilinear Pairings

ABSTRACTIn a blind signature scheme, the signer cannot link the relationship between the blind message and the signature of the chosen message. That is, blind signatures allow the user to obtain a signature of a message in a way that the signer learns neither the message nor the resulting signature. Therefore, it is very suitable for electronic commerce applications. A proxy signature allows the user to sign messages on behalf of the original signer. It is very useful when the original signer is not available to sign a specific document. A proxy blind signature combines the properties of both proxy signatures and blind signatures and is useful for e-cash and e-commerce applications. In this article, we propose a secure ID-based blind and proxy blind signature scheme from bilinear pairings. The proposed scheme satisfies the security properties of both blind and proxy blind signature scheme.

Efficient Hierarchical Identity-Based Signature With Batch Verification for Automatic Dependent Surveillance-Broadcast System

The automatic-dependent surveillance-broad-cast (ADS-B) is generally regarded as the most important module in air traffic surveillance technology. To obtain better airline security, ADS-B system will be deployed in most airspace by 2020, where aircraft will be equipped with an ADS-B device that periodically broadcasts messages to other aircraft and ground station controllers. Due to the open communication environment, the ADS-B system is subject to a broad range of attacks. To simultaneously implement both integrity and authenticity of messages transmitted in the ADS-B system, Yang et al. proposed a new authentication frame based on the three-level hierarchical identity-based signature (TLHIBS) scheme with batch verification, as well as constructing two schemes for the ADS-B system. However, neither TLHIBS schemes are sufficiently lightweight for practical deployment due to the need for complex hash-to-point operation or expensive certification management. In this paper, we construct an efficient TLHIBS scheme with batch verification for the ADS-B system. Our scheme does not require hash-to-point operation or (expensive) certification management. We then prove the TLHIBS scheme secure in the random oracle model. We also demonstrate the practicality of the scheme using experiments, whose findings indicate that the TLHIBS scheme supports attributes required by the ADS-B system without the computation cost in Chow et al. ’s scheme and Yang et al. ’s TLHIBS schemes.

Revocable ID-Based Signature with Short Size over Lattices

In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed. With the progress on the development of quantum technology, IBS schemes mentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional public-key settings, ID-based public-key settings have to offer a revocation mechanism to revoke misbehaving or malicious users. However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.

A Privacy-Preserving Mutual Authentication Resisting DoS Attacks in VANETs

Providing efficient anonymous authentication in vehicular ad hoc networks (VANETs) is a challenging issue. Identity-based signature schemes have been used to provide privacy-preserving authentication effectively for VANETs. In such scenario, mutual authentication between vehicles is critical to ensure only legitimate vehicles can involve in the inter-vehicle communication, and how to resist denial-of-service attack should be carefully addressed due to the regionally central signature verification in vehicle-road-side communications. In this paper, we propose a conditional privacy-preserving mutual authentication framework with denial-of-service attack resistance called MADAR. The authentication framework combines different identity-based signature schemes and distinguishes inner-region and cross-region authentications to increase efficiency. Beyond the privacy preservation and non-repudiation achieved by the existing framework, our authentication framework provides asymmetric inter-vehicle mutual authentication and strength-alterable computational DoS-attack resistance. We have formally proved the privacy preservation, unlinkability, mutual authenticity, and correctness of pseudonym with ProVerif, and analyzed other security objectives. The performance evaluations are conducted and the results demonstrate that our framework can achieve these security objectives with moderate computation and communication overheads.

Adaptive-ID Secure Identity-Based Signature Scheme from Lattices in the Standard Model

Identity-based signature (IBS) which is a paradigm built on public key cryptography has played a significant role in light-weight authentication. With the advent of the post quantum era, the lattice has become a main mathematical tool to construct quantum-immune cryptographic schemes. By utilizing an admissible hash function with compatible algorithms and lattice trapdoors as basic building blocks, we propose a new IBS scheme over lattices. The scheme is proved existentially unforgeable against adaptive identity attacks and chosen message attacks in the standard model under inhomogeneous short integer solution assumption via the generalized partitioning proof technique. Moreover, the scheme needs only logarithmic basic matrices as master public key while keeping the same private key size and signature size as those of other standard model lattice-based IBS schemes. This construction is the first adaptive-ID secure standard model IBS scheme over lattice with such space efficiency.

Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability

It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this paper, we propose a noninteractive verifiable outsourcing algorithm of bilinear pairing based on two servers in the one-malicious model. The outsourcer need not execute any expensive operation, such as scalar multiplication and modular exponentiation. Moreover, the outsourcer could detect any failure with a probability close to 1 if one of the servers misbehaves. Therefore, the proposed algorithm improves checkability and decreases communication cost compared with the previous ones. Finally, we utilize the proposed algorithm as a subroutine to achieve an anonymous identity-based encryption (AIBE) scheme with outsourced decryption and an identity-based signature (IBS) scheme with outsourced verification.

Efficient Revocable ID-Based Signature With Cloud Revocation Server

Over the last few years, identity-based cryptosystem (IBC) has attracted widespread attention because it avoids the high overheads associated with public key certificate management. However, an unsolved but critical issue about IBC is how to revoke a misbehaving user. There are some revocable identity-based encryption schemes that have been proposed recently, but little work on the revocation problem of identity-based signature has been undertaken so far. One approach for revocation in identity-based settings is to update users’ private keys periodically, which is usually done by the key generation center (KGC). But with this approach, the load on the KGC will increase quickly when the number of users increases. In this paper, we propose an efficient revocable identity-based signature (RIBS) scheme in which the revocation functionality is outsourced to a cloud revocation server (CRS). In our proposed approach, most of the computations needed during key-updates are offloaded to the CRS. We describe the new framework and the security model for the RIBS scheme with CRS and we prove that the proposed scheme is existentially unforgeable against adaptively chosen messages and identity attacks in the random oracle model. Furthermore, we monstrate that our scheme outperforms previous IBS schemes in terms of lower computation and communication costs.

Double Validation Multi Level Proxy Blind Signature Scheme Key Management

Identity-based signature (IBS) scheme can be widely used in resource-limited situations such as mobile e-commerce. In this paper, a lattice-based IBS scheme is first established by using trapdoor generation algorithm GenTrap, preimage sample algorithm SampleD and trapdoor delegated algorithm DelTrap put forward by Micciancio and Peikert in Eurocrypt’12; then the proposed scheme is proven to satisfy strong unforgeability against selective ID and static chosen massage attack in the standard model based on small integer solutions (SIS); and finally the proposed scheme is compared with the existing similar scheme in computing performance. The results show that the scheme presented in this paper enjoys the highest efficiency.

Identity-based Signatures from Lattices: Simpler, Faster, Shorter*

Identity-based signature is an important technique for lig ht-weight authentication. Re- cently, many efforts have been made to construct identity-based signatures over lattice assumptions since they would remain secure in future quantum age. In this paper we present a new identity- based signature scheme from lattice problems. This scheme is more efficient than other lattice-based identity-based signature schemes in terms of both computation and communication complexities. We prove its security in the random oracle model under short integer solution assumption that is as hard as approximating several worst-case lattice problems. We also extend the scheme to an identity-based message recovery signature scheme that has better performance.

Efficient Signature Scheme with Batch Verifications in Identity-Based Framework

In group-oriented applications, it is often required to verify a group of signatures/messages. The individual verification of signed messages in such applications comes at a high cost in terms of computations and time. To improve computational efficiency and to speed up the verification process, a batch verification technique is a good alternative to individual verification. Such a technique is useful in many real-world applications, such as mail servers, e-commerce, banking transactions, and so on. In this work, we propose a new, efficient identity-based signature (IDS) scheme supporting batch verifications. We prove that the proposed IDS scheme and its various types of batch verifications is tightly related to the Computational Diffie–Hellman problem under a random oracle paradigm. We compare the efficiency of the proposed scheme with related schemes that support batch verifications.

A new generic construction of anonymous designated confirmer signature for privacy-preserving fair exchange

ABSTRACTDesignated confirmer signature (DCS), introduced by Chaum at Eurocrypt 1994, can be used to control the public verifiability of a digital signature. It is a very useful tool in many applications which require a signature to remain anonymous and unverifiable until a certain time/condition is reached. In this paper, we propose a new generic construction of Anonymous Identity-Based DCS from Anonymous Identity-Based Signature. Interestingly, our construction also automatically implies an Anonymous Identity-Based Convertible Undeniable Signature scheme. We prove that the construction is secure for signer, verifier and confirmer in the standard model.

Identity Based Generalized Proxy Signcryption Scheme

Generalized signcryption can work as an encryption scheme, a signature scheme or a signcryption scheme with only one keypair and one algorithm. We extend it to the proxy system setting by considering sharing the same keypair and algorithm between the proxy signature and proxy signcryption, and we call it generalized proxy signcryption (GPSC). We give the formal definition and security model of GPSC in the identity-based setting by considering the whole abilities of an attacker, and propose a concrete scheme in the standard model. Our scheme is publicly verifiable, with strong security by considering insider attack, and with short system public parameters. Our scheme can be proved semantically secure against adaptively chosen ciphertext, chosen id and chosen warrant attack (short for IND-IB-GPSC-CCA) under the Decisional Bilinear Diffie-Hellman (DBDH) assumption, and existentially unforgeable against adaptively chosen message, chosen id and chosen warrant attack (short for EUF-IB-GPSC-CMA) under the (Computational Diffie-Hellman) CDH assumption. The performance evaluation shows it is of high efficiency. Moreover, we give a general construction of identity-based GPSC scheme from an identity-based combined signature and encryption scheme. DOI: http://dx.doi.org/10.5755/j01.itc.45.1.8758

PERM-GUARD: Authenticating the Validity of Flow Rules in Software Defined Networking

Software Defined Networking (SDN) is one type of the flow-rule-driven networks. In SDN, a centralized controller dictates the network behavior and configures network devices via flow rules. Therefore, the validity and consistency of flow rules are the critical for the security of operations in SDN, requiring a secure and efficient mechanism to manage and authenticate flow rules between the controller and network devices. In this paper, we aim to develop solutions to guarantee the validity of flow rules in SDN. We analyze the mechanisms that generate and manage flow rules in SDN, and present PERM-GUARD, a fine-grained permission management and authentication scheme for flow rules in SDN. PERM-GUARD employs a new permission authentication model and introduces an identity-based signature scheme for the controller to verify the validity of flow rules. We conduct theoretical analysis and simulation-based evaluation of PERM-GUARD. The results demonstrate that PERM-GUARD can efficiently identify and reject fake flow rules generated by unregistered applications. Meanwhile, it can also effectively filter out unauthorized flow rules created by valid applications, and trace their creator timely and accurately.

Certificateless Signature Scheme Based on Rabin Algorithm and Discrete Logarithm

Certificateless signature can effectively immue the key escrow problem in the identity-based signature scheme. But the security of the most certificateless signatures usually depends on only one mathematical hard problem, which makes the signature vulnerable when the underlying hard problem has been broken. In order to strengthen the security, in this paper, a certificateless signature whose security depends on two mathematical hard problems, discrete logarithm and factoring problems, is proposed. Then, the proposed certificateless signature can be proved secure in the random oracle, and only both of the two mathematical hard problems are solved, can the proposed signature be broken. As a consequence, the proposed certificateless signature is more secure than the previous signatures. On the other hand, with the pre-computation of the exponential modular computation, it will save more time in the signature signing phase. And compared with the other schemes of this kind, the proposed scheme is more efficient.

ID- Based Authentication for WiMAX

WiMAX is broadband wireless system being used for long range wireless networking, which makes this system vulnerable to security breaches. In this paperwe present authentication scheme using ID-based signature scheme for WiMAX, which offers a certificate-less public key verification. The proposed scheme has also increased message processing throughput as it has used elliptic curve cryptosystem, sigencryption and identity based cryptography.

On the security of two identity-based signature schemes based on pairings

ID-based signature enables users to verify signatures using only public identifier. Very recently, Rossi and Schmid (2015) [9] proposed two identity-based signature schemes along with the application to group communications. Unfortunately, by proposing concrete attack, we demonstrate that the former scheme is insecure against forgery attack, while the latter scheme has been totally broken in the sense that the signing key can be recovered from the valid signature easily.