Hierarchical Identity-based Signature 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

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.

Extraction Security of Sequential Aggregate Signatures

Aggregate signature schemes enable anyone to compress many signatures into one. Besides the unforgeability of aggregate signature, another property called aggregate extraction sometimes is useful. In sequential aggregate signature schemes, the aggregate signature is computed incrementally by the signers. We introduce extraction security in the sequential context which can be seen as an analogy of aggregate extraction introduced by Boneh et al. in CRYPTO 2003. In addition to the practical meaning, it also has benefits in the construction of hierarchical identity-based signatures as we will point out. We study several well known aggregate signature schemes and prove some of them satisfy extraction security.

Unlinkable and Revocable Secret Handshake

Abstract In this paper, we introduce a new construction for unlinkable secret handshake that allows a group of users to perform handshakes anonymously. We define formal security models for the proposed construction and prove that it can achieve session key security, anonymity and affiliation hiding. In particular, the proposed construction ensures that (i) anonymity against protocol participants (including group authority) is achieved since a hierarchical identity-based signature is used in generating group user’s pseudonym-credential pairs and (ii) revocation is achieved using a secret sharing-based revocation mechanism.

An energy efficient authentication scheme based on hierarchical IBDS and EIBDS in grid-based wireless sensor networks

Wireless sensor network is a peculiar kind of ad hoc network, consists of hundreds of tiny, resource constrained as sensor nodes. Clustering is a demanding task in such environment mainly due to the unique constraints such as energy efficiency and dynamic topology. In this paper, a novel energy efficient cluster-based routing algorithm is proposed on which hierarchical identity-based digital signature (IBDS) and enhanced-identity-based digital signature (EIBDS) scheme is concerning in grid-based wireless sensor networks. Firstly we form clusters using multi-parameters-based type-2 fuzzy logic algorithm. This paper proposes an improved ant colony optimisation algorithm, which optimises the energy consumption on data transfer in a WSN. Each node in a sensor network is authenticated using elliptic curve cryptography (ECC). After a set of simulation tests on NS-3 simulator, our proposed work achieves good performance for various metrics.

Authenticated and Privacy-Preserving Consent Management in the Internet of Things

As the Internet of Things (IoT) starts providing meaningful solutions in multiple domains, users expect to take full advantage of the features and benefits of smart devices, but not at the cost of privacy loss. They want to keep control over their own data, e.g. through consent and authorization management. This paper proposes a lightweight privacy-preserving solution for managing user’s consent relative to specific purposes (obligations). The originality of our proposal is manyfold. First, the consent is issued cryptographically by the user over some consented specific purposes, thus it protects both the user and the service provider against possible repudiations. Second, the users’ privacy is preserved as the protocol supports untraceability over the channel, and pseudonymity with regard to the service provider. Pseudonyms are fully managed by the users themselves through suitable use of Hierarchical Identity-Based Signature (HIBS). Third, the solution is lightweight in terms of communication and computation, thus making it suitable for IoT resource constrained environments. Fourth, an illustrative car-sharing use case is presented where users are able to personalize their driving experience. Fifth, a formal validation of the protocol is provided with the AVISPA tool, along with an informal security and privacy analysis. Sixth, our approach addresses part of the European General Data Protection Regulation (GDPR), as it supports user consent management and helps providers with handling accountability.

A New ADS-B Authentication Framework Based on Efficient Hierarchical Identity-Based Signature with Batch Verification

Automatic dependent surveillance-broadcast (ADS-B) has become a crucial part of next generation air traffic surveillance technology and will be mandatorily deployed for most of the airspaces worldwide by 2020. Each aircraft equipped with an ADS-B device keeps broadcasting plaintext messages to other aircraft and the ground station controllers once or twice per second. The lack of security measures in ADS-B systems makes it susceptible to different attacks. Among the various security issues, we investigate the integrity and authenticity of ADS-B messages. We propose a new framework for providing ADS-B with authentication based on three-level hierarchical identity-based signature (HIBS) with batch verification. Previous signature-based ADS-B authentication protocols focused on how to generate signatures efficiently, while our schemes can also significantly reduce the verification cost, which is critical to ADS-B systems, since at any time an ADS-B receiver may receive lots of signatures. We design two concrete schemes. The basic scheme supports partial batch verification and the extended scheme provides full batch verification. We give a formal security proof for the extended scheme. Experiment results show that our schemes with batch verification are tremendously more efficient in batch verifying $n$ signatures than verifying $n$ signatures independently. For example, the running time of verifying 100 signatures is 502 and 484 ms for the basic scheme and the extended scheme respectively, while the time is 2500 ms if verifying the signatures independently.

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.

HIBS-KSharing: Hierarchical Identity-Based Signature Key Sharing for Automotive

Equipped with various sensors and intelligent systems, modern cars turn into entities with connectivity, autonomy, and safety. Car rental/car sharing is an innovative transportation concept and integral in today’s urban living. It enables users to access a fleet of vehicles located throughout cities. Complementing public transportation, the car-sharing service helps people to meet their transportation needs economically and in an environmentally responsible manner. When a customer wants to rent a car from a rental company or an owner wants to share a private car with his/her friends or family members, the customer or the user should gain admission to the car, such as unlocking the door and starting the engine. In this paper, we proposed a novel and secure key-sharing system named hierarchical identity-based signature key sharing (HIBS-KSharing), which consists of key generation, key transmission, and key management (e.g., remote issuing, revocation of access rights, and their delegation to other users or sharers). We implemented our proposed system based on Nexus smartphones and near-field communication devices. Compared with existing key-sharing schemes of car rental/sharing, our proposed HIBS-KSharing system is secure and easily extended.

An escrow‐free online/offline HIBS scheme for privacy protection of people‐centric sensing

AbstractPeople‐centric sensing (PCS), which collects information closely related to human activity and interactions in societies, is stepping into a flourishing time. Along with its great benefits, PCS poses new security challenges such as data integrity and participant privacy. Hierarchical identity‐based signature (HIBS) scheme can efficiently provide high‐integrity messaging, secure communication, and privacy protection to PCS. However, key escrow problem and low computation efficiency primarily hinder the adoption of HIBS scheme. In this paper, we propose an escrow‐free online/offline HIBS scheme for securing PCS. By utilizing user‐selected‐secret signing algorithm and splitting the signing phase into online and offline procedures, our scheme solves the key escrow problem and achieves high scheme performance. Copyright © 2016 John Wiley & Sons, Ltd.

An Access Authentication Scheme Based on 2-HIBS in Proxy Mobile IPv6 Network

Proxy Mobile IPv6 is a network-based mobility management protocol. The access authentication security plays the primary role in maintaining network security of proxy mobile IPv6. In this paper, we constructed an authentication framework, which is suitable for proxy mobile IPv6 and has eliminated the interaction between the access network and the home network. We implemented a mutual authentication between users and the access network by using hierarchical identity-based signature (HIBS) schemes and combining the identity-based signature and the real network environment based on proxy mobile IPv6. Also, we have enhanced the function of LMA to make it able to optimize the authentication function of proxy mobile IPv6 protocol by reusing historical authentication information. By results from security analysis, this scheme is secure.

Scalable Hierarchical Identity-based Signature Scheme from Lattices

In the paper, we propose a novel adaptively secure hierarchical identity-based signature scheme from lattices. The size of signatures in our scheme is shortest among the existing hierarchical identity-based signature schemes from lattices. Our scheme is motivated by Gentry et al.s signature scheme and Agrawal et al.s hierarchical identity-based encryption scheme.

Security and privacy issues in electronic health network

Electronic health network (EHN) is an information system providing functions involved in e-health. In this paper, we devise mechanisms covering three important security and privacy issues of EHN including trust management, privacy preserving, and data sharing. First, we propose an authenticated key agreement scheme based on hierarchical identity-based signature (HIBS). We abstract a hierarchical architecture from the social network architecture of EHN. To support large-scale scenarios, we introduce a virtual signature generation phase into traditional HIBS, thus our scheme will be efficient even the depth is quite big. Second, we propose a fast data searching scheme based on symmetric searchable encryption (SSE). To improve the searching efficiency, we introduce a two-level cache structure into the traditional SSE. Third, we propose an access control scheme based on hierarchical identity-based encryption (HIBE). To make it a fine-grained scheme, we organize the data owner’s file in hierarchy and introduce a virtual key generation phase to traditional HIBE. Also, the scheme can provide delegation and revocation functions easily. Besides, our schemes guarantee known-key secrecy, forward secrecy, and antidirection secrecy and possess the resistance capability to collude-attack. Evaluation results show that our scheme indeed achieves the security and efficiency.

New Efficient Hierarchical Identity-based Signature

To construct a high efficient and strong secure Hierarchical Identity-based Signature(HIBS) with a low computation cost is the main challenge at present. In this paper, a new construction of HIBS scheme is proposed. The new scheme achieves the selective security. However, our scheme has constant size private keys and signature which solves the trade-off between private keys and signatures. The cost of verification only requires three bilinear pairings, which are independent of hierarchy depth. Furthermore, under the CDHI assumption, the scheme is provably secure against existential forgery for adaptive chosen message and selective-identity attack in the standard model. The new scheme is suitable for the large mobile networks.

Efficient hierarchical identity-based signatures from lattices

Lattice-based hierarchical identity-based signature HIBS schemes are receiving significant attention due to provable security reductions and potential security for quantum computers. However, most of the existing HIBS schemes based on lattices are less efficient for practical applications. To make lattice-based HIBS schemes become more practical, this paper presents an efficient HIBS scheme from lattices. Both the secret key size and the signature length of our proposal are much shorter than those of other lattice-based HIBS proposals. Our scheme is proven to be strongly unforgeable against adaptive identity attacks in the random oracle model. The security of the construction relies on the standard short integer solution SIS assumption.

Generic Construction of Identity-Based Strong Key-Insulated Signature

It is worthwhile to deal with the key-exposure problem for identity-based signature. Identity-based key-insulated signature can successfully reduce the damage caused by key-exposure, and thus attracts the researchers' great interest. In this paper, we study the problem of how to generically construct identity-based strong key-insulated signature, and proposed a generic construction of identity-based strong key-insulated signature schemes from two-level hierarchical identity-based signature.

New Constructions of Hierarchical Identity-Based Signature in the Standard Model

In this paper, a new construct of hierarchical identity-based signature(HIBS) scheme is proposed at first. It has many advantages over those available, such as fully secure without using random oracles, efficient signing algorithm. Additionally, it is provably secure under the computational Diffie-Hellman(CDH) assumption. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model. However, the length of its private key and signature increases as the hierarchy depth expands. Then a modified scheme is presented. The signature of modified scheme consists of three group elements and the private keys size shrinks as the identity depth increases. Under the h-CDH assumption, it is provable security in full security model without using random oracles.

Adaptively secure hierarchical identity-based signature in the standard model

Hierarchical identity-based signature (HIBS) has wide applications in the large network. However, the existing works cannot solve the trade-off between the security and efficiency. The main challenge at present is to construct a high efficient and strong secure HIBS with a low computation cost. In this paper, a new construction of HIBS scheme is proposed. The new scheme achieves the adaptive security which is a strong security in the identity-based cryptography. But our scheme has short public parameters and the private keys size shrinks as the hierarchy depth increases. The signature size is a constant and the cost of verification only requires four bilinear pairings, which are independent of hierarchy depth. Furthermore, under the q-strong computational diffie-Hellman problem ( q-SDH) assumption, the scheme is provably secure against existential forgery for adaptive chosen message and identity attack in the standard model.

Practical Hierarchical Identity Based Encryption Scheme without Random Oracles

Recently, Au et al. proposed a practical hierarchical identity-based encryption (HIBE) scheme and a hierarchical identity-based signature (HIBS) scheme. In this paper, we point out that there exists security weakness both for their HIBE and HIBS scheme. Furthermore, based on q-ABDHE, we present a new HIBE scheme which is proved secure in the standard model and it is also efficient. Compared with all previous HIBE schemes, ciphertext size as well as decryption cost are independent of the hierarchy depth. Ciphertexts in our HIBE scheme are always just four group elements and decryption requires only two bilinear map computations.

New Construction of Short Hierarchical ID-Based Signature in the Standard Model

In this paper, a new construction of hierarchical ID-Based signature (HIBS) scheme is proposed. The new scheme has some advantages over the available schemes: the private keys size shrinks as the identity depth increases and the signature size is a constant as it consists of three group elements. Furthermore, under the h-CDH assumption, our scheme is provably secure in the standard model. This assumption is more natural than many of the hardness assumptions recently introduced to HIBS in the standard model.