Key Management Procedures Research Articles

An Efficient Multilayer approach for Securing E-Healthcare Data in Cloud using Crypto – Stego Technique

Healthcare data has been moving to cloud platforms in recent years, which has increased accessibility and scalability but also raised security issues. Ensuring data integrity and safeguarding private health information from unwanted access are critical. This paper presents a comprehensive strategy to integrate effective Elliptic Curve Cryptography ECC-AES with steganography techniques to improve the security of healthcare data in the cloud. ECCAES is especially well-suited for cloud situations with limited resources since it provides strong security with reduced key sizes. Confidentiality is guaranteed by encrypting healthcare data using ECC- AES before storage, reducing the possibility of data breaches. Steganography techniques are also integrated to improve security against skilled adversaries by adding an extra degree of obfuscation by concealing encrypted data inside innocuous files or images. Strict key management procedures, access control systems, and frequent security audits are important components of the proposed system that ensure adherence to Health Insurance Portability and Accountability Act (HIPAA) and General Data Protection Regulation (GDPR) compliance requirements pertaining to healthcare data protection. Programs for employee awareness and training are also crucial for reducing the likelihood of human mistakes. Healthcare businesses can safely use cloud technology while protecting patient data integrity and privacy by putting in place multi-layered security safeguards. The proposed system provides the multilayer security on healthcare data in cloud environment than other existing systems.

FORMATION OF THE COST SYSTEM BASED ON THEIR OPTIMAL STRUCTURE

The functioning of business entities of the machine-building industry is closely related to the consumption in the process of manufacturing and selling products (goods, services) of a wide range of material, energy, labor, financial, and intellectual resources. Accordingly, the amounts incurred by the enterprise constitute a generalized monetary estimate of the cost of consumed production resources, and also reflect the optimal use of resources, the consumption of which is important for providing all the needs of the enterprise at the stage of production processes. Effective management influence at the stage of formation and implementation of expenses requires ensuring an equally significant degree of differentiation of the defined management system, as well as the justified application of norms and methods of solving management problems related to the optimal regulation of consumption norms. The basis of the integrated cost management system is a hierarchical system of performance indicators of the enterprise, which provides an opportunity to implement the principle of decentralization in the implementation of management decisions. The budgeting system creates prerequisites for attracting additional financial resources, finding channels for their mobilization, adequate centralization of cash flows, and regulates their rational use. The proposed algorithm for implementing an integrated cost management system is shown in Fig. 3.6. determines the procedure for implementing a set of systematized measures regarding the implementation of management technology, the system of intra-firm cost planning, which prescribes key regulations and management procedures.

Implementing end-to-end encryption strategist for strengthening data security across network communication

In order to improve data security in network communication, this project suggests using End-to-End Encryption (E2EE). E2EE protects against unwanted access by guaranteeing that private information is kept secret for the duration of its travel. In order to mitigate potential vulnerabilities at intermediate points, cryptographic procedures are implemented to safeguard data from the point of origin to its final destination. The method makes use of strong encryption algorithms and key management procedures in order to strengthen the confidentiality and integrity of data that is transferred. This method tackles the growing worries about data breaches, privacy violations, and cyberthreats. By emphasizing E2EE, communication networks’ security posture is strengthened and user and stakeholder trust is increased. By implementing this proactive security solution, organizations may protect sensitive data, comply with changing regulatory requirements, and provide a strong basis for safe data sharing in the digital sphere.

Critical Data Encryption: A Deep Study

This research offers a thorough analysis of critical data encryption with an emphasis on its relevance in the age of massive digital data and persistent cybersecurity risks. It examines a number of vital data encryption-related topics, such as the development of cryptography over time, strategies for safeguarding crucial data, algorithms for encrypting data, key management, physical storage security, and anticipated developments. End-to-end encryption, strong key management procedures, multi-factor authentication, safe data backups, key rotation, audits, security policies, and complying with regulations are all stressed. Strong encryption algorithms like AES are also important. In order to protect vital data from illegal access and fresh risks, the report emphasizes the ongoing need for vigilance and progress in encryption techniques

Security Management for an Advanced Metering Infrastructure (AMI) System of Smart Electrical Grids

Advanced Metering Infrastructure (AMI) plays a crucial role in enabling the efficient functioning of Smart Electrical Grids, but its successful implementation hinges on robust cybersecurity measures. To uphold data confidentiality and integrity, the deployment of an effective key management scheme (KMS) for multiple Smart Meters (SMs) and devices is imperative. The AMI exhibits unique characteristics, including storage and computation constraints in SMs, hybrid message transmission techniques, and varying participation levels in Demand Response (DR) projects, necessitating a tailored approach to security compared to other systems. In this research, we propose a KMS that is designed to address the specific security concerns of the AMI. The scheme comprises three key management procedures catering to the unicast, broadcast, and multicast modes of hybrid transmission. Given the resource limitations of SMs, we adopted simple cryptographic techniques for key creation and refreshing policies, ensuring efficiency without compromising on security. Furthermore, considering the variability of participants in DR projects, we established key refreshing policies that adapted to changing involvement. The effectiveness and security of the proposed KMS were rigorously evaluated, demonstrating its practical applicability and ability to safeguard the AMI ecosystem. The results of the evaluation indicate that our approach provides a viable and robust solution to the security challenges faced by AMI systems. By employing the proposed KMS, stakeholders can confidently deploy and manage AMI, ensuring the protection of sensitive data and maintaining the integrity of the Smart Electrical Grid.

Bool Network: An Open, Distributed, Secure Cross-Chain Notary Platform

With the advancement of blockchain technology, hundreds of cryptocurrencies have been deployed. The bloom of heterogeneous blockchain platforms brings a new emerging problem: typically, various blockchains are isolated systems, how to securely identify and/or transfer digital properties across blockchains? There are three main kinds of cross-chain approaches: sidechains/relays, notaries, and hashed time-lock contracts. Among them, notary-based cross-chain solutions have the best compatibility and user-friendliness, but they are typically centralized. To resolve this issue, we present Bool Network – an open, distributed, secure cross-chain notary platform powered by MPC-based distributed key management over evolving hidden committees. More specifically, to protect the identities of the committee members, we propose a Ring verifiable random function ( <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Ring VRF</i> ) protocol, where the real public key of a VRF instance can be hidden among a ring, which may be of independent interest to other cryptographic protocols. Furthermore, all the key management procedures are executed in the TEE, such as Intel SGX, to ensure the privacy and integrity of partial key components. A prototype of the proposed Bool Network is implemented in Rust language, using Polkadot Substrate.

A key-escrow free identity-based signature scheme without requirement of a secure channel in the private key issuance phase

Identity-based cryptosystem (IBC) provides us the simplest key management procedures over traditional public key cryptosystem (PKC) as it eliminates the need for certificates of PKC. Hence, no certificate management activities are involved in IBC. However, there are two major drawbacks with the identity-based cryptosystem. One is the key-escrow problem and the other one is the necessity of a channel which is secure for the transmission of the private key, generated by a trusted centre called key generation centre (KGC). In this work, we propose an identity-based signature scheme, fitted in an existing established variant IBC model. The proposed scheme avoids the necessity of the secure channel as well as it is key-escrow free. The proposed scheme is constructed using bilinear pairings and based on the blinding-binding technique.

Escrow-Less Identity-Based Signature Scheme with Outsourced Protection in Cloud Computing

The identity-based cryptosystem (IBC) outfits with the most beneficial key management procedures. The IBC is bounded to the small network system due to the internal key escrow problem, which leads to two other problems: key abusing and user slandering problems. Some solutions that address the key escrow problem are certificate-less cryptosystems and multiple authorities-based IBC. However, they are expensive in terms of computation or loss of the identity-based feature. This paper presents an escrow-less identity-based signature (EL-IBS) scheme, where we employ one key generation center that authenticates a user and many authorities that issue a protected private key share without user authentication. We also outsource the key protection overhead to the cloud privacy centers. We proved that the our EL-IBS scheme is existential unforgeable, key abusing and existential user slandering secured against adaptively chosen message attack under the random oracle model and the well-known computational Diffie–Hellman problem.

Provably Secure Identity-Based Encryption and Signature over Cyclotomic Fields

Identity-based cryptography is a type of public key cryptography with simple key management procedures. To our knowledge, till now, the existing identity-based cryptography based on NTRU is all over power-of-2 cyclotomic rings. Whether there is provably secure identity-based cryptography over more general fields is still open. In this paper, with the help of the results of collision resistance preimage sampleable functions (CRPSF) over cyclotomic fields, we give concrete constructions of provably secure identity-based encryption schemes (IBE) and identity-based signature schemes (IBS) based on NTRU over any cyclotomic field. Our IBE schemes are provably secure under adaptive chosen-plaintext and adaptive chosen-identity attacks, meanwhile, our IBS schemes are existentially unforgeable against adaptively chosen message and adaptively chosen identity attacks for any probabilistic polynomial time (PPT) adversary in the random oracle model. The securities of both schemes are based on the worst-case approximate shortest independent vectors problem (SIVPγ) over corresponding ideal lattices. The secret key size of our IBE (IBS) scheme is short—only one (two) ring element(s). The ciphertext (signature) is also short—only two (three) ring elements. Meanwhile, as the case of NTRUEncrypt, our IBE scheme could encrypt n bits in each encryption process. These properties may make our schemes have more advantages for some IoT applications over postquantum world in theory.

A provable secure key-escrow-free identity-based signature scheme without using secure channel at the phase of private key issuance

The identity-based cryptosystems furnish us with simplest key management procedures. Yet, they have a very slow adoption in cryptography due to the key escrow problem and the necessity of a secure channel between the user and the Private Key Generator (PKG) to transmit the created private key to the user. In this paper, we propose an identity-based signature scheme that not only solves the key escrow problem but also eliminates the requirement of the secure channel. The proposed scheme is secure against existential forgery under adaptively chosen message and ID attacks in the random oracle model assuming the hardness of the Computational Diffie–Hellmann Problem (CDHP). Furthermore, we compare the efficiency of our scheme to that of a similar established scheme.

Anchor-Based Active Set for User-Centric Multi-Connectivity: Mobility Enhancement and Performance Evaluation

By organizing a dynamic transmission point group, user-centric networks (UCNs) are considered as a feasible solution to mine the potentials of dense networks where the densification gain is blocked by strong interference and frequent handovers. However, the state-of-art studies mostly focus on improving throughput performance. In this paper, user-centric multi-connectivity architecture is proposed, where multiple small cells serve the user as a user-specific active set to reduce the number of radio link failures (RLFs) and to increase the throughput gain, especially for cell-edge users. Especially, master eNodeB (MeNB) is chosen in the active set as a mobility anchor to control its neighboring small cells that are termed as slave eNodeBs (SeNBs), which reduces signaling overheads during handovers. To provide user-centric service, the active set follows the user's trajectory by adding new SeNB that provides strong signal strength and releasing serving SeNB that is far away from the user. Moreover, the design of key mobility management procedures for active set forming/reforming is taken into consideration. The results show that compared with single connectivity, the RLF in the proposed architecture shows a decrease of more than 50% when user speed is 3 km/h, and the average user throughput achieves an increase of around 74% gains when TP density is 2000 TPs/km 2 .

A Secure Crypto Base Authentication and Communication Suite in Wireless Body Area Network (WBAN) for IoT Applications

To monitor the functions of human body and their surroundings Wireless Body Area Network (WBAN) is used, which are based on low powered and light weight wireless sensors devices. WBAN highly supports numerous applications but this study will focus on the security of ubiquitous healthcare applications. In E-health research monitoring the critical data in terms of security has become a major challenge as WBAN deals with various threats day by day. Therefore the design of secure and reasonably resource optimal algorithms with a robust key generation and management scheme is today’s need. There must be only authorized user’s who can have access to patient related data; otherwise it can be exploited by anyone. This proposed study is aiming to formulate the two security suite for WBAN, which comprises on KBS keys, KAISC and Hash algorithm three improved versions of key management procedures and authentication procedure respectively. Firstly the KBS Keys and improved Hashing suite which is an independent and adaptive key management and authentication scheme for improving the security of WBANs will be used, and secondly KAISC will be used for inter-sensor communication and key management security scheme. All above mentioned procedures will be suitably blend with the encryption and decryption process which will securely send the patient’s critical data to the base station and further to the concerned doctor. The novelty of work is that the proposed methodology is not only simple but also advanced and much secured procedure of key generation and management that will be further validated by the performance analysis. This technique will be beneficial for the continuous monitoring of patient’s critical data in remote areas also.

An ID-Based Linearly Homomorphic Signature Scheme and Its Application in Blockchain

Identity-based cryptosystems mean that public keys can be directly derived from user identifiers, such as telephone numbers, email addresses, and social insurance number, and so on. So they can simplify key management procedures of certificate-based public key infrastructures and can be used to realize authentication in blockchain. Linearly homomorphic signature schemes allow to perform linear computations on authenticated data. And the correctness of the computation can be publicly verified. Although a series of homomorphic signature schemes have been designed recently, there are few homomorphic signature schemes designed in identity-based cryptography. In this paper, we construct a new ID-based linear homomorphic signature scheme, which avoids the shortcomings of the use of public-key certificates. The scheme is proved secure against existential forgery on adaptively chosen message and ID attack under the random oracle model. The ID-based linearly homomorphic signature schemes can be applied in e-business and cloud computing. Finally, we show how to apply it to realize authentication in blockchain.

Identity-based blind signature from lattices

Blind signature allows a user to get a signature of a signer on an arbitrary message, and the verifier can convince that the signature is indeed signed by the signer without leaking any information about the message. This property is necessary when the user’s privacy needs protection, such as a bank bill, a trade secret, etc. As an alternative of public key infrastructure, the identity-based system can simplify the key management procedures in certificate-based public key systems. Inspired by the requirement of identity-based blind signature in the post quantum world, we research on identity-based blind signature based on hard lattice problems under the random Oracle model. We propose a construction built upon the blind signature by Ruckert, and it is proved to be one-more unforgeable against selective identity and chosen message attacks (sID-CMA) and unconditionally blind. The proposed scheme has 2 moves, and its security can be reduced to the small integer solution (SIS) problem.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement (DAGKA) protocol is presented. It is round-optimal, since: 1) in setup and join algorithms, only one round of communication is required; 2) in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the protocol resists key control attack and achieves forward security.

Round-optimal ID-based dynamic authenticated group key agreement

A group key agreement protocol provides a set of users with a shared secret key to achieve cryptographic goal. When membership changes, group session key should be updated efficiently and securely. Hence, dynamic group key agreement protocols are of practical significance. Identity-based group key agreement protocols are preferred to certificate-based ones since identity-based protocols can simplify public key management procedure. Most of previous dynamic group key agreement protocols need at least two rounds to establish or refresh group session keys. In this paper, an identity-based dynamic authenticated group key agreement DAGKA protocol is presented. It is round-optimal, since: 1 in setup and join algorithms, only one round of communication is required; 2 in leave algorithm, there is no message exchange among group members. Joining members cannot compute previous session keys and leaving members cannot compute subsequent session keys. The protocol is provably secure. Its AKE-security is proved under decisional bilinear Diffie-Hellman DBDH assumption. In addition, the protocol resists key control attack and achieves forward security.

A strongly secure identity-based authenticated group key exchange protocol

In group key exchange (GKE) protocols, a shared secret key is established among a group of members for cryptographic use over a public network. An identity-based protocol is preferred to that under the employment of traditional public key infrastructure (PKI), since identity-based cryptosystem can simplify public key management procedure. In ASIACCS 2011, a security model for GKE protocol called EGBG model was proposed. The EGBG model takes ephemeral secret key leakage attack into consideration. Until now, there is no ID-based GKE protocol secure in the EGBG model. In this paper, we propose an identity-based GKE protocol. Its AKE-security with KCIR and full forward secrecy, MA-security with KCIR and its contributiveness are proven in the EGBG model. The proposed protocol does not involve NAXOS trick, which does not resist side channel attack and thus it provides stronger security guarantee. It achieves mutual authentication without applying signature, which makes the protocol more practical.

Cryptanalysis of a secure and efficient identity-based signature scheme

The distinguishing characteristic of identity-based signatures is that only the identity with no certificate of a signer is involved in the verification of a signature, which simplifies the key management procedures dramatically. A novel identity-based signature scheme that can be proven secure in the standard model was given by Paterson and Schuldt in 2006. Unfortunately, the scheme is not efficient in computation. An improvement due to Gu, et al. was proposed recently to improve the computational efficiency, and it was claimed as being provably secure in the standard model and more efficient than the known schemes in the same flavor. However, this paper shows that the new scheme by Gu, et al. is insecure by demonstrating two concrete attacks in which an adversary can not only forge the private key of an identity but also forge signatures on arbitrary message. The study also identifies a flaw in their security proofs, i.e., the view of the adversary in the security reduction is not independent of the event that the simulation succeeds.

Research on Urban Digital Governance Framework Based on Grid Management

Urban grid management (UGM), as a new urban digital governance pattern, has been applied in more and more Chinese cities in recent years. After analyzing the digital governance practices in Beijing - the key technology, management method, management procedure and implementation effect of the UGM pattern, we find that UGM pattern is capable of both simplifying administrative process and improving the government management efficiency, while the target of digital governance to provide quality public service and expand public participation has been ignored. Therefore, an urban digital governance framework based on grid management consisting of four modules and eight systems is put forward in this paper. This framework takes into account the improving government management efficiency, providing better public service and expanding democratic participation at the same time.

ID-based signature schemes from bilinear pairing: A survey

In identity (ID)-based cryptosystems, a user can use his/her identity as the public key, which simplifies the key management procedure compared to certificate-based cryptosystems. Authentication is a desired property in cryptographic protocols. The signature scheme provides this property. Notion of pairing reduces the computation overheads and makes the system simple and efficient. In this survey, we have tried to cover some ID-based signature schemes based on bilinear pairings with their protocol and security analysis to the best of our knowledge. We hope this survey will provide a ready reference to work in the related area.