Identity-based Signature Scheme Research Articles

A Secure and Effective Hierarchical Identity-Based Signature Scheme for ADS-B Systems

A Secure and Effective Hierarchical Identity-Based Signature Scheme for ADS-B Systems

Post-Quantum Secure Identity-Based Signature Scheme with Lattice Assumption for Internet of Things Networks.

The Internet of Things (IoT) plays an essential role in people's daily lives, such as healthcare, home, traffic, industry, and so on. With the increase in IoT devices, there emerge many security issues of data loss, privacy leakage, and information temper in IoT network applications. Even with the development of quantum computing, most current information systems are weak to quantum attacks with traditional cryptographic algorithms. This paper first establishes a general security model for these IoT network applications, which comprises the blockchain and a post-quantum secure identity-based signature (PQ-IDS) scheme. This model divides these IoT networks into three layers: perceptual, network, and application, which can protect data security and user privacy in the whole data-sharing process. The proposed PQ-IDS scheme is based on lattice cryptography. Bimodal Gaussian distribution and the discrete Gaussian sample algorithm are applied to construct the fundamental difficulty problem of lattice assumption. This assumption can help resist the quantum attack for information exchange among IoT devices. Meanwhile, the signature mechanism with IoT devices' identity can guarantee non-repudiation of information signatures. Then, the security proof shows that the proposed PQ-IDS can obtain the security properties of unforgeability, non-repudiation, and non-transferability. The efficiency comparisons and performance evaluations show that the proposed PQ-IDS has good efficiency and practice in IoT network applications.

Identity-based chameleon hash from lattices

Identity-based chameleon hash (IBCH) is a cryptographic primitive with nice properties. IBCH equips each user with a trapdoor and the hash values can be publicly evaluated w.r.t. the identity of any user. On the one hand, it is hard to find collisions for the hash values without the user’s trapdoor. On the other hand, with the help of the user’s trapdoor, finding collisions becomes easy. An important application of IBCH is to upgrade an identity-based signature (IBS) scheme to an on-line/off-line identity-based signature (OO-IBS) scheme. OO-IBS is a useful tool to provide authenticity in lightweight smart devices, since it only involves light on-line computations and does not need key certificate. Up to now, there are many IBCH constructions from traditional number-theoretic assumptions like RSA, CDH, etc. However, none of the existing IBCH schemes achieve the post-quantum security in the standard model. In this paper, we propose a new IBCH scheme from lattices. The security of our IBCH is reduced to a well-accepted lattice-based assumption – the Short Integer Solution (SIS) assumption in the standard model. Our work provides the first post-quantum solution to IBCH in the standard model.

Multidimensional Epidemiological Survey Data Aggregation Scheme Based on Personalized Local Differential Privacy

In recent years, with the rapid development of intelligent technology, information security and privacy issues have become increasingly prominent. Epidemiological survey data (ESD) research plays a vital role in understanding the laws and trends of disease transmission. However, epidemiological investigations (EI) involve a large amount of privacy-sensitive data which, once leaked, will cause serious harm to individuals and society. Collecting EI data is also a huge task. To solve these problems and meet personalized privacy protection requirements in EIs, we improve the uOUE protocol based on utility-optimized local differential privacy to improve the efficiency and accuracy of data coding. At the same time, aiming at the collection and processing of ESD, a multidimensional epidemiological survey data aggregation scheme based on uOUE is designed. By using Paillier homomorphic encryption and an identity-based signature scheme to further prevent differential attacks and achieve multidimensional data aggregation, the safe, efficient, and accurate aggregation processing of ESD is executed. Through security proof and performance comparison, it is verified that our algorithm meets the requirements of local differential privacy and unbiased estimation. The experimental evaluation results on two data sets show that the algorithm has good practicability and accuracy in ESD collection and provides reliable and effective privacy protection.

Efficient Blockchain-Assisted Distributed Identity-Based Signature Scheme for Integrating Consumer Electronics in Metaverse

Efficient Blockchain-Assisted Distributed Identity-Based Signature Scheme for Integrating Consumer Electronics in Metaverse

Comment on “An efficient identity-based signature scheme with provable security”

In this comment paper, we reveal a security issue in an efficient identity-based signature (IBS) scheme that has been proven secure in the standard model. More specifically, we perform a key-only attack on the IBS scheme to break its universal unforgeability. Since the security notion of universal unforgeability under key-only attack (uuf-koa) is a weaker notion than the existential unforgeability under chosen message attack (euf-cma), this invalidates the euf-cma security claimed by the IBS scheme. Subsequently, we propose a fix to achieve a stronger seuf-cma security without a random oracle.

System-widely and fine-grained forward secure identity-based signature scheme

In an identity-based signature (IBS) system, each user uses individual information as his/her public key, and also holds a private key issued by a fully trusted key generation center (KGC) with a master secret key. This avoids the mandatory requirement of public key infrastructure, and thus motivates the wide deployment of IBS in various fields. In practical scenarios, the premise that IBS can provide the intended security guarantee is to remain secret keys unrevealed. That is, on the one hand, after a user’s secret key is leaked, then an adversary can use it to create correct signatures for any messages, which invalidates all signatures produced by this user him/herself. On the other hand, what is worse, after the master secret key is disclosed, then all users’ signatures become useless, since the adversary can produce any user’s private key with it. In this paper, to reduce the damage of secret key leakage in IBS system, we introduce system-widely and fine-grained forward-secure IBS (SWFG-fs-IBS). In this primitive, the master secret key is immediately punctured after issuing a secret key for a new user, such that it would fail to issue a secret key for the same user again. Similarly, we also perform puncture operations on each user’s private key after signing messages, which prevents the exposed private key from creating signatures for previously signed messages. Concretely, we first define the syntax and security notions of SWFG-fs-IBS, and then propose its concrete construction with provable security. The theoretical analysis indicates that our proposal provides stronger and more practical forward security than previous fs-IBS schemes. We also provide an implementation of our proposal, and present extensive experiments to demonstrate its feasibility.

HIBEChain: A Hierarchical Identity-Based Blockchain System for Large-Scale IoT

Internet-of-Things enables interconnection of billions of devices, which perform autonomous operations and collect various types of data. These things, along with their generated huge amount of data, need to be handled efficiently and securely. Centralized solutions are not desired due to security concerns and scalability issue. In this article, we propose HIBEChain, a hierarchical blockchain system that realizes scalable and accountable management of IoT devices and data. HIBEChain consists of multiple permissioned blockchains that form a hierarchical tree structure. To support the hierarchical structure of HIBEChain, we design a decentralized hierarchical identity-based signature (DHIBS) scheme, which enables IoT devices to use their identities as public keys. Consequently, HIBEChain achieves high scalability through parallel processing as blockchain sharding schemes, and it also implements accountability by use of identity-based keys. Identity-based keys not only make HIBEChain more user-friendly, they also allow private key recovery by validators when necessary. We provide detailed analysis of its security and performance, and implement HIBEChain based on Ethereum source code. Experiment results show that a 6-ary, (7,10)-threshold, 4-level HIBEChain can achieve 32,000 TPS, and it needs only 9 seconds to confirm a transaction.

High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU

Identity-based cryptography is proposed to solve the complicated certificate management of traditional public-key cryptography. The pairing computation and high-level tower extension field arithmetic turn out to be the performance bottleneck of pairing-based signature schemes. Graphics processing units have been increasingly popular for general-purpose computing in recent years. They have shown a lot of promise in speeding up cryptographic schemes such as AES, RSA, and ECDSA. However, to our knowledge, the research on parallel implementation of pairings and identity-based cryptographic schemes on graphics processing units is somewhat outdated. Therefore, in this article, we implement the identity-based signature scheme in the IEEE P1363 Standard on a modern NVIDIA RTX 3060 card. We convert the pairing computation in signature verification into a product of pairings with fixed arguments and therefore avoid the scalar multiplication in 𝔾 2 . Then we employ the precomputation technique to improve the elliptic curve scalar multiplication, exponentiation in \(\mathbb {F}_{p^{12}}\) and the pairing computation. We also apply PTX ISA to multiple-precision arithmetic. Experiments demonstrate that our implementation can perform 43,856/46,753/39,798 pairings/sec for the Optimal Ate pairing, the pairing with a fixed argument, and two pairings with fixed arguments, respectively. Peak throughputs of signature generation and verification can achieve 322.6 and 40.6 kops/sec over the BN254 curve.

Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture

Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture

A New Digital Signature Primitive and Its Application in Blockchain

In this paper, we propose a new digital signature primitive, called expander signature, and discuss its application in blockchain. The most promising advantage of expander signature is that a signer can generate all signatures at once using a powerful computer, and stores expander keys personally. Each time the signer wants some of his signatures to be verified, he releases the related expander key. No matter when or where, the signer can do this via a resource-limited device, for example, a personal portable terminal. We formally define the syntax and security of expander signature. Under our precisely defined security model, we give generic constructions of expander signature from both public key infrastructure-based and identity-based signature schemes. The security of our constructed expander signature schemes rigorously depends on the underlying public key signature schemes. The expander keys do not leak any information about the signer’s secret key and the size of the expander keys is constant no matter how many times the expander has been occurred. Finally, we give an application example of expander signature in blockchain.

Generic Construction of Forward-Secure Revocable Identity-Based Signature and Lattice-Based Instantiations

Forward-secure revocation is a powerful cryptographic technique to alleviate key exposure attacks on identity-based cryptosystems. In recent years, quantum computers have made some breakthroughs, so in the foreseeable future, existing cryptographic systems will be subject to quantum attacks. However, known forward-secure revocable identity-based signature (FS-RIBS) schemes were designed over bilinear pairing groups and may suffer from quantum computing attacks. To address this issue, this paper proposes a generic method to construct FS-RIBS schemes, taking (hierarchical) IBS schemes as a basic component. By instantiating it with some post-quantum (hierarchical) IBS schemes, e.g., lattice-based (hierarchical) IBS, we immediately obtain six FS-RIBS schemes under the hardness of the small integer solution problem, which is secure against quantum computing attacks.

Lightweight and Secure IoT-Based Payment Protocols from an Identity-Based Signature Scheme

After the great success of mobile wallets, the Internet of Things (IoT) leaves the door wide open for consumers to use their connected devices to access their bank accounts and perform routine banking activities from anywhere, anytime, and with any device. However, consumers need to feel safe when interacting with IoT-based payment systems, and their personal information should be protected as much as possible. Unlike what is usually found in the literature, in this paper, we introduce two lightweight and secure IoT-based payment protocols based on an identity-based signature scheme. We adopt a server-aided verification technique to construct the first scheme. This technique allows to outsource the heavy computation overhead on the sensor node to a cloud server while maintaining the user’s privacy. The second scheme is built upon a pairing-free ECC-based security protocol to avoid the heavy computational complexity of bilinear pairing operations. The security reduction results of both schemes are held in the Random Oracle Model (ROM) under the discrete logarithm and computational Diffie–Hellman assumptions. Finally, we experimentally compare the proposed schemes against each other and against the original scheme on the most commonly used IoT devices: a smartphone, a smartwatch, and the embedded device Raspberry Pi. Compared with existing schemes, our proposed schemes achieve significant efficiency in terms of communication, computational and storage overheads.

Post-quantum secure identity-based signature achieving forward secrecy

Identity-based cryptography (IBC) has gained significant attention over the years by enabling authentication of public key of a party without relying on certificates. Since the discovery of IBC, we have witnessed several ID-based identification (IBID) and identity-based signature (IBS) schemes in the literature. However, most of them depend heavily on discrete logarithm problem, making them susceptible to quantum attacks. This necessitates the development of IBID and IBS schemes that are immune to quantum attacks. In this work, we reveal the shortcomings of the recently (Peng et al., 2020) proposed isogeny-based IBS by Peng et al. We have discovered severe vulnerabilities in the key component of their IBS scheme, which rendered their IBS scheme unable to meet their claimed security guarantees. More positively, we have adopted a potential framework to resolve the flaws in their scheme. This led us to develop the first isogeny-basedIBID scheme that provides security against impersonation under passive attacks.The practical deployment of IBS in surveillance systems raises subtle security issues that should be addressed. To resolve these problems, we have also devised the first forward-secure identity-based signature (FSIBS) from isogenies. The comprehensive study of provable security reveals that our scheme provides correctness, forward security and is immune to forging attacks.

Secure and efficient two-party collaborative SM9 signature scheme suitable for smart home

The smart home usually has poor security and is vulnerable to attack since it adopts embedded processors that are limited by volume and power consumption. To improve the communication security of the smart home system, identity-based signature schemes are widely used in wireless network communications. However, the user’s signature private key is generally stored in a single device, it is easy to be stolen by attackers to control the smart home devices. To reduce the risk of leakage of the signature private key, a two-party collaborative signature scheme based on the SM9 algorithm is proposed in this paper. The user’s signature private key is generated through the collaboration of the two-party key generation center (KGC), and the integer secrets related to the signature private key are stored in two devices respectively. During the signing process, the two devices sign collaboratively to prevent the complete private key from being leaked. The security of the scheme is proved in the random oracle model. Theoretical analysis and experimental results show that our proposed scheme can achieve higher security with lower computation cost and communication cost when compared with the existing two-party SM9 signature schemes.

A Cost-Effective Identity-Based Signature Scheme for Vehicular Ad Hoc Network Using Hyperelliptic Curve Cryptography

A Vehicular Ad Hoc Network (VANET) is a subset of the Mobile Ad Hoc Network (MANET) that allows vehicles to communicate with each other and with roadside stations to offer efficient and safe transportation. Furthermore, when VANET is used in connection with the Internet of Things (IoT) devices and sensors, it can help with traffic management and road safety by allowing vehicles to interact with one another at any time and from any location. Since VANET’s event-driven communications are carried out via an open wireless channel, there are significant security concerns. In this paper, we use Hyperelliptic Curve Cryptography (HECC) to offer a cost-effective identity-based signature for secure communication over VANET. The proposed scheme does not need certificate management, and we found that it is more secure against a variety of cryptographic threats after conducting a thorough security analysis. In addition, comparisons of communication and computational costs are made, demonstrating that the proposed scheme is more efficient in both respects than existing schemes.

Fully Secure ID-Based Signature Scheme with Continuous Leakage Resilience

The side channel attacks will lead to the destruction of the security of the traditional cryptographic scheme. Leakage-resilient identity-based signature has attracted great attention. Based on the dual system encryption technology, we construct an identity-based signature scheme that can resist continuous private key leakage. In the standard model, the security of the scheme is proved. The key points of our leakage-resilient signature scheme are as follows: (1) The private key can be extended according to the security requirements. In other words, when the leakage is serious, we can select a bigger value n, where n is a parameter related to the leakage rate. (2) An elaborate key update algorithm makes the scheme resist continuous leakage attacks. Furthermore, the updated private key has the same distribution as the previous private key. (3) The proposed scheme is fully secure in the standard model rather than in the random oracle model or in the general group model. In order to achieve this goal, we use dual system encryption technology. Thus, the security of the constructed scheme does not depend on the number of queries of the attacker.

Identity-based secure data aggregation in big data wireless sensor networks

Secure data aggregation (SDA) is an inherent paradigm in big data wireless sensor networks (WSNs) to reduce data transmissions, maximise the network lifetime and provide security. However, SDA protocols that use elliptic curve suffer from mapping and reverse mapping functions. Currently, there is no known mapping function which is both homomorphic and effective in reverse mapping. In addition, SDA protocols that use public key infrastructure incurs high computation and communication cost. To overcome these challenges, this paper proposes a novel identity-based secure data aggregation (ISDA) protocol for big data wireless sensor networks. This protocol is based on bilinear pairing and combines identity-based homomorphic encryption scheme with identity-based signature to achieve end-to-end security. In WSNs, this is the first SDA protocol that employs both identity-based encryption and identity-based signature scheme. ISDA shares the same public/private keys during encryption and signature generation, which significantly reduces the complexity of the protocol. Security analysis reveals that ISDA is secure against various internal and external attacks and proves the correctness of the proposed protocol. Performance evaluation shows that ISDA incurs less overhead than state-of-the-art bilinear pairing-based SDA schemes, thereby it minimises the energy consumption and increases the lifetime of wireless sensor networks.

An Efficient Conformable Fractional Chaotic Map‐Based Online/Offline IBSS Scheme for Provable Security in ROM

Chaos distributes with a covert method to condense the dynamic of complexity and satisfies the security requirements of a cryptographic system. This study gives an ability online/offline (O/O) ID‐based short signature (IBSS) scheme using conformable fractional chaotic maps. Furthermore, we establish its security under IBSS existential unforgeability of identity‐based short signature (IBSS) under chosen message attack (EUF‐IBSS‐CMA) in the random oracle model (ROM). Some of the stimulating preparations of obtainable processes are that they give a multiperiod application of the offline storage, which licenses the agent to recycle the offline pre‐registered data in time series (especially the polynomial time), rather than one‐period usage in all past IBSS processes.

An efficient identity-based signature scheme with provable security

Many identity-based digital signature schemes are proved secure in the random oracle model. However, the application of the random oracle may lead to security risks. The used hash function is specific and the response result of the query is not always random, hence it may cause the insecurity of the scheme. To solve the above issues, this paper presents an efficient identity-based signature scheme which is proved secure under the standard model. The security of the proposed scheme is reduced to the well-known computational Diffie–Hellman (CDH) assumption. Furthermore, compared with the related identity-based signature schemes, the scheme proposed in this paper has great advantages in the computation cost of signing and verification.