Key Revocation Research Articles

A secure hierarchical deterministic wallet with stealth address from lattices

The concept of Hierarchical Deterministic Wallet (HDW) was introduced by Wuille in Bitcoin Improvement Proposal 32 (BIP32). HDW enables an individual/organization to generate cryptographic keys and subsequently ease the key management problems (e.g., backup and recovery). Since the first HDW algorithm in 2012, HDW has gradually shown its fit for many promising use cases, such as Bitcoin-like cryptocurrencies, global key revocation in FIDO2 standard. In order to achieve all the features (i.e., deterministic derivation, master public key and hierarchy) and the security (i.e., safety of cryptocurrencies and privacy protection of users) requirements for HDW, Yin et al. (ESORICS 2022) conceptualized Hierarchical Deterministic Wallet supporting Stealth Address (HDWSA), and gave a provably secure construction from the standard Computational Diffie-Hellman Assumption. Unfortunately, the construction is not quantum-resistant. In this work, we propose the first HDWSA construction from lattices to fill this gap, we provide the security proof for the construction in the random oracle model (ROM) based on hard problems over lattices. Compared with existing works, to the best of our knowledge, our construction not only captures all the HDW features and security properties, but also provides the potential quantum resistance.

Analysis of Key Management Schemes for Centralized and Distributed Key Revocation in Wireless Sensor Networks

Analysis of Key Management Schemes for Centralized and Distributed Key Revocation in Wireless Sensor Networks

Anonymous lattice-based authentication protocol for vehicular communications

Quantum-proof authentication is essential for vehicular communications as the threat of quantum computing attacks on traditional encryption methods grows. Several lattice-based authentication protocols have recently been developed to help with this issue, but they come with hefty storage and communication overheads. Most of them also fail to provide strong anonymity for vehicles and edge nodes and can not support authentication for vehicles from multiple domains. This study presents a new lattice-based authentication protocol for vehicular communications that addresses limitations of previous methods and offers advanced security features such as anonymity, and unlinkability. The protocol utilizes a distributed ledger to store public keys, making the system more secure, tamper-proof, and efficient for key revocation in large networks. Additionally, it allows for a multi-domain authentication system for vehicular communication with improved security and flexibility. The proposed protocol's security is evaluated both formally and informally to demonstrate its resistance against the well-known attacks. Additionally, the performance analysis indicates that the proposed protocol surpasses current protocols and is suitable for vehicular communications.

IIBES: a proposed framework to improve the identity-based encryption system for securing federated learning

PurposeIn the field of cryptography, authentication, secrecy and identification can be accomplished by use of secret keys for any computer-based system. The need to acquire certificates endorsed through CA to substantiate users for the barter of encoded communications is one of the most significant constraints for the extensive recognition of PKC, as the technique takes too much time and susceptible to error. PKC’s certificate and key management operating costs are reduced with IBC. IBE is a crucial primeval in IBC. The thought behind presenting the IBE scheme was to diminish the complexity of certificate and key management, but it also gives rise to key escrow and key revocation problem, which provides access to unauthorised users for the encrypted information.Design/methodology/approachThis paper aims to compare the result of IIBES with the existing system and to provide security analysis for the same and the proposed system can be used for the security in federated learning.FindingsFurthermore, it can be implemented using other encryption/decryption algorithms like elliptic curve cryptography (ECC) to compare the execution efficiency. The proposed system can be used for the security in federated learning.Originality/valueAs a result, a novel enhanced IBE scheme: IIBES is suggested and implemented in JAVA programming language using RSA algorithm, which eradicates the key escrow problem through eliminating the need for a KGC and key revocation problem by sing sub-KGC (SKGC) and a shared secret with nonce. IIBES also provides authentication through IBS as well as it can be used for securing the data in federated learning.

A Smart Contract-based Blockchain Solution in IoT Networks

The emergence and growing use of advanced technologies has opened up new possibilities for addressing the security challenges of resource-constrained IoT net- works. As IoT devices exchange sensitive data, secure key management is essential for IoT network security, particularly during the key revocation phase. However, current IoT key management solutions require improvements due to the resource limitations of IoT devices. Despite these limitations, existing key revocation solutions still have several areas for improvement, including high communication overheads. Therefore, a decentralized and efficient solution is necessary to address these issues in IoT networks, with a focus on security. This paper proposes a new solution for key revocation based on Blockchain technology using smart contracts to minimize communication overhead and energy consumption in IoT networks. The paper presents a security and performance analysis to assess its correctness. The results indicate that our proposal outperforms other solutions by having a reduced communication overhead of 93.55%, 91.87%, and 99.75% compared to other solutions during the compromising, leaving, and draining cases, respectively. This demonstrates that our solution is efficient and suitable for IoT networks.

Efficient key revocation in WSN with lattice-based cryptography

Strong security is crucial as Wireless Sensor Network (WSN) become more common. Dynamic Lattice-Based Key Revocation (DLBKR) is a novel method for improving key revocation in WSN. Lattice-based cryptography helps DLBKR overcome compromised keys and evolving security threats in dynamic sensor networks. Key revocation mechanisms are examined in detail, with a focus on their limitations in WSN. Due to these networks limited resources and ever-changing structure, we propose DLBKR as a novel way to minimize the security risks of compromised keys. DLBKR is featured as a flexible and reactive solution due to its ability to adapt to threat levels. Simulated network sizes from 250 to 2000 nodes were used to evaluate DLBKR. Traditional methods like CRL and OCSP were compared. Latency, revocation efficiency, computational overhead, communication overhead, and key replacement delay were assessed. DLBKR outperforms CRL and OCSP in all parameters, proving its efficiency in dynamic and resource-limited WSN key revocation. This method performs well and offers a flexible framework that incorporates with sensor networks. The DLBKR method help WSN to manage key complexity.

EAKRR : An energy-efficient key management in WSN with ECC-based cryptography

Environmental monitoring, industrial automation, and other applications require Wireless Sensor Networks (WSN). WSN must efficiently manage cryptographic keys for safe communication and energy efficiency. This study introduces “Energy-Aware Key Revocation and Rekeying” (EAKRR) to address energy efficiency and security in WSN using Elliptic Curve Cryptography (ECC). Energy-efficient key management is needed in WSN which have sensor nodes with limited resources and energy. EAKRR is designed to adapt to sensor node energy levels to make crucial key revocation and rekeying decisions while maintaining strong and resilient security. Energy profiling is used by EAKRR to assess sensor node energy consumption during cryptographic and operational operations. Energy conservation is achieved by localized key revocation when a node’s energy drops below a threshold. EAKRR also optimizes security and energy efficiency with ECC-based adaptive key length modifications. EAKRR is compared to LEACH and AES to determine its efficacy. The results show that EAKRR is highly energy efficient, extending the network’s lifespan and maintaining security. Cryptographic operations are careful and wise because they can adjust to energy levels in real time. The balance between security and energy usage shows that ECC-based encryption works. Energy-efficient key management in WSN is crucial. EAKRR solves WSN problems by saving energy, extending network life, and securing the network.

An Access Control Scheme With Privacy-Preserving Authentication and Flexible Revocation for Smart Healthcare.

IoT and 5G-enabled smart healthcare allows medical practitioners to diagnose patients from any location via electronic health records (EHRs) by wireless body area network (WBAN) devices. Privacy, including the medical practitioner's identity and the patient's EHR, can easily be leaked from hospitals or cloud servers, and secret keys used to access EHRs must be revoked after diagnosis. In response to the challenges associated with user authentication and secret key revocation, this paper proposes an access control scheme with privacy-preserving authentication and flexible revocation for smart healthcare using attribute-based encryption (ABE), named PAFR-ABE, which provides access control to prevent malicious users from decrypting EHRs. Meanwhile, PAFR-ABE ensures privacy-preserving authentication for users during secret key generation, which safeguards users' identities and prevents unauthorized requests for secret keys. In addition, PAFR-ABE achieves flexible revocation and recovery of secret keys, which eliminates the need to update secret keys for unrevoked users. Security analysis indicates that PAFR-ABE meets the security requirements of an access control scheme for smart healthcare, especially in terms of forward security and backward security. Performance analysis shows that PAFR-ABE is efficient in the key generation and revocation algorithms compared with typical access control schemes.

Design and Implementation of Multi-key Blowfish and CAST Algorithm: Comparative Study with CBC, CFB and CTR Modes

In modern communication systems, secret keys are used to secure sensitive information such as personal data, financial transactions and government secrets. However, the security of these systems is only as strong as the secrecy of the key utilized for encrypting and decrypting the data. The use of easy guessable or compromised keys can lead to unauthorized access, data breaches, and identity theft. Additionally, the distribution and management of secret keys present challenges such as key generation, key distribution, key revocation, and key renewal, which can be complex and costly. Therefore, finding secure and efficient methods to manage secret keys is crucial for ensuring the confidentiality, integrity, and availability of sensitive information in today's digital age. Therefore, to improve the security of the symmetric encryption algorithms, The new method to encrypt and decrypt the difference size files using multiple keys is proposed. In addition to investigate the impact of using multiple keys on the security and performance of symmetric algorithms. However, the multiple keys are generated previously using MD5 and SHA2. The chosen algorithms in this study are Blowfish and CAST, with chosen three modes of operation: CBC, CFB and CTR. The results presented in the paper demonstrated that the Blowfish algorithm with generated multiple keys outperforms in the CBC mode despite has the most encryption and decryption time-consuming and memory usage. Where the randomness of Blowfish with mode CBC and CTR is the best throughput then it follows Blowfish with mode CFB.

Enhancing Security and Efficiency in Underwater Wireless Sensor Networks: A Lightweight Key Management Framework

Underwater Wireless Sensor Networks (UWSNs) obtains more attention due to their wide range of applications such as underwater oil field discovery, Tsunami monitoring systems, surveillance systems, and many more. In such a resource-constrained environment, sensors are more vulnerable to malicious attacks. Node authentication and secure communication is one of the vital issues in UWSNs. In this study, a secure and lightweight key management framework for UWSNs is proposed. The proposed framework includes key generation, key distribution, revocation, and authentication mechanisms along with lightweight implementation, and scalability. We use an elliptic curve-based algorithm for key distribution, and certificate revocation list (CRL) for key revocation. We also examine the performance of the proposed framework taking into account the amount of communication overhead as well as the level of security. The simulation results show that the proposed framework provides better security with less communication overhead compared to existing frameworks. This framework can be used for secure data communication in UWSNs, which has various applications in oceanography, environmental monitoring, and military operations.

On the Efficiency of a Lightweight Authentication and Privacy Preservation Scheme for MQTT

The Internet of Things (IoT) deployment in emerging markets has increased dramatically, making security a prominent issue in IoT communication. Several protocols are available for IoT communication; among them, Message Queuing Telemetry Transport (MQTT) is pervasive in intelligent applications. However, MQTT is designed for resource-constrained IoT devices and, by default, does not have a security scheme, necessitating an additional security scheme to overcome its weaknesses. The security vulnerabilities in MQTT inherently lead to overhead and poor communication performance. Adding a lightweight security framework for MQTT is essential to overcome these problems in a resource-constrained environment. The conventional MQTT security schemes present a single trusted scheme and perform attribute verification and key generation, which tend to be a bottleneck at the server and pave the way for various security attacks. In addition to that, using the same secret key for an extended period and a flawed key revocation system can affect the security of MQTT. To address these issues, we propose an Improved Ciphertext Policy-Attribute-Based Encryption (ICP-ABE) integrated with a lightweight symmetric encryption scheme, PRESENT, to improve the security of MQTT. In this work, the PRESENT algorithm enables the secure sharing of blind keys among clients. We evaluated a previously proposed ICP-ABE scheme from the perspective of energy consumption and communication overhead. Furthermore, we evaluated the efficiency of the scheme using provable security and formal methods. The simulation results showed that the proposed scheme consumes less energy in standard and attack scenarios than the simple PRESENT, Key Schedule Algorithm (KSA)-PRESENT Secure Message Queue Telemetry Transport (SMQTT), and ECC-RSA frameworks, with a topology of 30 nodes. In general, the proposed lightweight security framework for MQTT addresses the vulnerabilities of MQTT and ensures secure communication in a resource-constrained environment, making it a promising solution for IoT applications in emerging markets.

VANETs Security Using Cryptography

Abstract: The usage of Vehicular Ad-hoc Networks, often known as VANET, is becoming more common as the frequency of accidents in the modern world continues to rise. In situations like these, VANET makes accessible a broad variety of protective applications that may shield people from injury while they are operating motor vehicles. These applications can be used to prevent accidents. Additionally, it lessens the amount of collisions that take place, which in turn lessens the amount of damage that is sustained by cars, drivers, and passengers. By giving information to drivers about the flow of traffic along congested roads, VANETs make it possible for drivers to make better use of the time they have available. On the other hand, two security issues that are tied to the safety of drivers are the protection of an individual's right to privacy about their location and the maintenance of identifying information inside the network. Both of these issues are connected to the network. Many protocols need an infrastructure that enables the efficient distribution of keys, the revocation of keys, and the protection of sensitive communications by utilising a number of different cryptographic techniques in order to defend themselves against a wide variety of attacks and to guarantee that driver privacy is maintained. This is necessary in order to ensure that driver privacy is maintained. It is necessary to do extra work in the fields of computers and communication in order to implement a number of the security methods that are used for encrypting and authenticating V2V and V2I communications. These methods may be found in a variety of places. Because of this, it is essential to carry out research into a broad range of different cryptographybased approaches in order to boost the viability of various cryptography-based protocols and to improve the overall performance of these protocols. Because of the high mobility of nodes in the network, a suitable cryptographic technique is necessary. This method must be able to create short keys and short messages, take a little amount of processing time, and have a sufficient degree of security throughout the length of a key.

Verifiable Keyword Search Encryption Scheme That Supports Revocation of Attributes

In recent years, searchable encryption technology and attribute encryption technology have been widely used in cloud storage environments, and attribute-based searchable encryption schemes can both achieve the retrieval of encrypted data and effectively solve the access control problem. Considering that existing attribute-based searchable encryption schemes for cloud storage only support keyword search and do not support attribute revocation, most of the schemes that support attribute revocation only consider the computational overhead of users and ignore the large amount of computational resources consumed by attribute authorization centers when updating keys. In addition, keyword search may lead to partial errors in the returned search results, leading to the wastage of computational and broadband resources. To solve these issues, this paper proposes an attribute-based searchable encryption scheme that supports attribute revocation and is verifiable. To realize fine-grained ciphertext search of encrypted data, support scenarios of dynamic changes of user attributes, and ensure that third-party servers perform the search process reliably and honestly while minimizing computation and storage costs, first, this paper implements attribute revocation with the attribute authorization center by creating a user revocation list and an attribute key revocation list. At the same time, the system updates the attribute key at the time of user search request, which effectively reduces the computational overhead. Second, a third-party auditor is introduced to ensure the correctness of the search results. Finally, the security of this paper is verified by theoretical analysis, and the efficiency and practicality of this paper are verified by comparing it to other schemes through simulation experiments.

Scan-free verifiable public-key searchable encryption supporting efficient user updates in distributed systems

Searchable encryption (SE) is a promising technology that provides search functions while preserving information privacy. A small number of SE schemes can be applied to a distributed system. In such systems, multiple owners provide data that is encrypted by their secret keys to the system for retrieval by users. In this setup, however, users need to scan a searchable index for retrievals, which leads to linear search complexity. Moreover, updates of users (e.g., revoking an expired user from the system) generally incur substantial overhead to re-build the index. Accordingly, we propose a scan-free verifiable public-key searchable encryption scheme with an efficient user update function in a distributed system (i.e., in a multi-owner multi-user model). First, owners self-select secret keys to encrypt keywords. A master secret key is designed to support keyword searches among these keys. Additionally, a searchable index with an implicit relationship between the same keyword is proposed. There is no need to scan the index for keyword retrieval, which achieves sub-linear search complexity. It is also important that the updates of owners do not exert an influence on users and the other owners in our proposed scheme. As the key revocation mechanism, the master secret key is split into more partial secret keys that are distributed to users. Accordingly, the system only needs to re-split and re-distribute the key rather than re-building the index for updates of users. When making queries, not only are the content of queries and the master secret key concealed, but collusion between some users and the cloud server is resisted. The proposed scheme also supports an efficient result verification mechanism. The security and utility of our scheme were confirmed thru analysis and evaluation.

Secure Revocation Features in eKYC - Privacy Protection in Central Bank Digital Currency

Central bank digital currencies require the implementation of eKYC to verify whether a trading customer is eligible online. When an organization issues an ID proof of a customer for eKYC, that proof is usually achieved in practice by a hierarchy of issuers. However, the customer wants to disclose only part of the issuer's chain and documents to the trading partner due to privacy concerns. In this research, delegatable anonymous credential (DAC) and zero-knowledge range proof (ZKRP) allow customers to arbitrarily change parts of the delegation chain and message body to range proofs expressed in inequalities. That way, customers can protect the privacy they need with their own control. Zero-knowledge proof is applied to prove the inequality between two time stamps by the time stamp server (signature presentation, public key revocation, or non-revocation) without disclosing the signature content and stamped time. It makes it possible to prove that the registration information of the national ID card is valid or invalid while keeping the user's personal information anonymous. This research aims to contribute to the realization of a sustainable financial system based on self-sovereign identity management with privacy-enhanced PKI.

Intelligent Transportation Using Wireless Sensor Networks Blockchain and License Plate Recognition.

License Plate Recognition (LPR) is essential for the Internet of Vehicles (IoV) since license plates are a necessary characteristic for distinguishing vehicles for traffic management. As the number of vehicles on the road continues to grow, managing and controlling traffic has become increasingly complex. Large cities in particular face significant challenges, including concerns around privacy and the consumption of resources. To address these issues, the development of automatic LPR technology within the IoV has emerged as a critical area of research. By detecting and recognizing license plates on roadways, LPR can significantly enhance management and control of the transportation system. However, implementing LPR within automated transportation systems requires careful consideration of privacy and trust issues, particularly in relation to the collection and use of sensitive data. This study recommends a blockchain-based approach for IoV privacy security that makes use of LPR. A system handles the registration of a user's license plate directly on the blockchain, avoiding the gateway. The database controller may crash as the number of vehicles in the system rises. This paper proposes a privacy protection system for the IoV using license plate recognition based on blockchain. When a license plate is captured by the LPR system, the captured image is sent to the gateway responsible for managing all communications. When the user requires the license plate, the registration is done by a system connected directly to the blockchain, without going through the gateway. Moreover, in the traditional IoV system, the central authority has full authority to manage the binding of vehicle identity and public key. As the number of vehicles increases in the system, it may cause the central server to crash. Key revocation is the process in which the blockchain system analyses the behaviour of vehicles to judge malicious users and revoke their public keys.

An Efficient Blockchain-Based Conditional Privacy-Preserving Authentication Protocol for VANETs

Vehicular Ad-hoc Networks (VANETs) have potential applications in improving the efficiency and safety for intelligent transportation systems. The openness of VANETs, however, also introduces privacy and security implications. Despite a number of conditional privacy-preserving authentication (CPPA) schemes with anonymity and conditional traceability have been designed for VANETs, a majority of these schemes cannot be directly applied to a real-world setting (e.g., due to the need for a certificate manager for issuing keys in PKI-based solutions, or the inherent key escrow problem in ID-based solutions). There have also been attempts to design blockchain-based CPPA schemes, but these schemes may not support key revocation or are inefficient (e.g., due to on-chain operations). This paper proposes an efficient blockchain-based CPPA (EBCPPA) scheme, which is designed to mitigate the above limitations. Our proposal consists of two key building blocks, namely: signature of knowledge and smart contract. To evaluate the feasibility, we present the security and performance analyses of EBCPPA. Specifically, the performance evaluations show that EBCPPA is more efficient than other existing state-of-the-art solutions, in terms of signing (improving at least 49.71%), the verification (improving at least 32.84%) and bandwidth requirement (reducing at least 27.59%).

VBlock: A Blockchain-Based Tamper-Proofing Data Protection Model for Internet of Vehicle Networks.

The rapid advancement of the Internet of Vehicles (IoV) has led to a massive growth in data received from IoV networks. The cloud storage has been a timely service that provides a vast range of data storage for IoV networks. However, existing data storage and access models used to manage and protect data in IoV networks have proven to be insufficient. They are centralized and usually accompanied by a lack of trust, transparency, security, immutability, and provenance. In this paper, we propose VBlock, a blockchain-based system that addresses the issues of illegal modification of outsourced vehicular data for smart city management and improvement. We introduce a novel collusion-resistant model for outsourcing data to cloud storage that ensures the network remains tamper-proof, has good data provenance and auditing, and solves the centralized problems prone to the single point of failure. We introduced a key revocation mechanism to secure the network from malicious nodes. We formally define the system model of VBlock in the setting of a consortium blockchain. Our simulation results and security analysis show that the proposed model provides a strong security guarantee with high efficiency and is practicable in the IoV environment.

Cantor Pairing lightweight key generation for wireless body area networks

Wireless Body Area Networks (WBAN) are getting grandness due to the low-cost digital sensor communication devices. Implantable tiny sensor nodes and wearable sensor nodes are getting membership in a WBAN network. The characteristics of these member nodes are hugely different in terms of processing power and communication technology. Therefore, the nature of a WBAN network comes under heterogeneous category. Combining different types of nodes under one roof with a communication protocol is one of the perplexed tasks of WBAN. Security and Power consumption are the prime concerns in WBAN networks. High security communication protocols consume more power whereas low power consuming protocols lack some security. Equilibrating the balance between power, performance and security is an inevitable chore while designing communication protocols for WBAN. This work named as Cantor Pairing Light Weight Key Generation (CPLKG) is targeted to improve the security without impacting the performance in terms of Throughput, End-to-End delay, Packet Delivery Ratio, Memory and Power consumption. Device ID Hash Function (DHF), Cantor Pairing Key Generation (CPKG) and Cantor Pairing Key Revocation (CPKR) are the contributed functional blocks used to construct the proposed CPLKG method.

QuSigS: A quantum Signcryption scheme to recover key escrow problem and key revocation problem in cloud computing

QuSigS: A quantum Signcryption scheme to recover key escrow problem and key revocation problem in cloud computing