Efficient Encryption Scheme Research Articles

An Efficient Image Encryption Scheme for Medical Image Security

In the contemporary landscape of digital healthcare, the confidentiality and integrity of medical images have become paramount concerns, necessitating the development of robust security measures. This research endeavors to address these concerns by proposing an innovative image encryption scheme tailored specifically for enhancing medical image security. The proposed scheme integrates a sophisticated blend of symmetric and asymmetric encryption techniques, complemented by a novel key management system, to fortify the protection of medical image data against unauthorized access and malicious tampering. The proposed DNA-based encryption algorithm leverages the unique properties of DNA encoding to securely scramble image data, providing an added layer of protection. By utilizing DNA sequences in the encryption and decryption processes, the scheme achieves a high level of data confusion and diffusion, significantly enhancing security. The efficacy of the proposed encryption scheme is validated through comprehensive experimental evaluations, which demonstrate its proficiency in ensuring data security while maintaining computational efficiency. The scheme's compatibility with existing medical imaging systems is also examined, affirming its seamless integration into contemporary healthcare infrastructures. This research contributes to the advancement of medical image security by proposing an efficient encryption scheme that strikes a balance between stringent security requirements and practical implementation considerations. The primary contributions include the development of a DNA-based encryption algorithm and a novel key management system, both of which significantly enhance the security of medical images. This research contributes to the advancement of medical image security by proposing an efficient encryption scheme that strikes a balance between stringent security requirements and practical implementation considerations. By safeguarding the confidentiality and integrity of medical images, the proposed scheme empowers healthcare providers to uphold patient privacy and trust in the digital age. Experimental results show that this approach ensures robust encryption without compromising image quality, making it suitable for sensitive medical imaging applications.

Blockchain based medical image encryption using Arnold’s cat map in a cloud environment

Improved software for processing medical images has inspired tremendous interest in modern medicine in recent years. Modern healthcare equipment generates huge amounts of data, such as scanned medical images and computerized patient information, which must be secured for future use. Diversity in the healthcare industry, namely in the form of medical data, is one of the largest challenges for researchers. Cloud environment and the Block chain technology have both demonstrated their own use. The purpose of this study is to combine both technologies for safe and secure transaction. Storing or sending medical data through public clouds exposes information into potential eavesdropping, data breaches and unauthorized access. Encrypting data before transmission is crucial to mitigate these security risks. As a result, a Blockchain based Chaotic Arnold’s cat map Encryption Scheme (BCAES) is proposed in this paper. The BCAES first encrypts the image using Arnold’s cat map encryption scheme and then sends the encrypted image into Cloud Server and stores the signed document of plain image into blockchain. As blockchain is often considered more secure due to its distributed nature and consensus mechanism, data receiver will ensure data integrity and authenticity of image after decryption using signed document stored into the blockchain. Various analysis techniques have been used to examine the proposed scheme. The results of analysis like key sensitivity analysis, key space analysis, Information Entropy, histogram correlation of adjacent pixels, Number of Pixel Change Rate, Peak Signal Noise Ratio, Unified Average Changing Intensity, and similarity analysis like Mean Square Error, and Structural Similarity Index Measure illustrated that our proposed scheme is an efficient encryption scheme as compared to some recent literature. Our current achievements surpass all previous endeavors, setting a new standard of excellence.

An improved secured cloud data using dynamic rivest-shamir-adleman key

<span>Encryption methods had been widely used for secure data transmission and communication in both public and private organizations against intruders. Rivest-shamir-adleman (RSA) encryption algorithm is one of the most popular and efficient encryption schemes that has been in used for decades. Due to technological advancement and innovation, there is a threat to this algorithm. It is believed that introduction of quantum computer will break RSA algorithm easily. In view of this, it is pertinent to research into how RSA algorithm could be strengthened against all adversaries. This research aim at protecting client/server communication and file sharing by generating dynamic public and private keys. The proposed method was implemented in visual basic.net 2008. The result shows that dynamic keys do not affect the performance of the system and it is capable of protecting communication and file sharing between client/server. As the key generated keeps changing at an interval, it will difficult for most advance computer to factor any of the keys before another key is generated. This is the basis of the security of the proposed system.</span><br /><em></em>

An Efficient Encryption Scheme with Fully Hidden Access Policy for Medical Data

With the development of informatization, patient medical data are generally stored in the form of electronic medical records. Hospitals store a large amount of medical data on cloud servers, which can ensure the integrity and sharing of medical data. There are many problems when sharing medical data, the most important of which is the security of private data. The ciphertext-policy attribute-based encryption (CP-ABE) algorithm not only supports data encryption, but also supports data access control. The CP-ABE algorithm is applied to medical databases. Through the encryption of medical data and the fine-grained control of data owner access to medical data, the privacy security and sharing security of medical data are realized. However, the traditional CP-ABE algorithm also has problems for the data user regarding access policy privacy leakage and the low efficiency of medical data encryption and decryption. This paper proposes a secure and efficient encryption technique. Medical data are encrypted using a symmetric encryption algorithm, and the CP-ABE algorithm with a fully hidden access policy encrypts the symmetric key. To implement access policy hiding, it uses an attribute bloom filter (ABF) for all access structures. The solution also supports the outsourced decryption of medical data, which can improve the encryption and decryption efficiency of the technique. Finally, in this paper, it is demonstrated that the scheme is selectively chosen-plaintext attack secure (CPA-secure). The experimental results show that users have less computational consumption to obtain medical data.

Achieving Secure and Efficient Dynamic Searchable Symmetric Encryption over Medical Cloud Data

In medical cloud computing, a patient can send her medical data to a cloud server from afar. Because medical data is highly sensitive, only authorized doctors are allowed to access it in this case. A frequent solution is to encrypt data before outsourcing it, with the patient simply sending the corresponding encryption key to the authorized doctors. However, due to the difficulties of digging through the encrypted data, the usability of outsourced medical data is severely limited. Over medical cloud data, we propose Secure and Efficient Dynamic Searchable Symmetric Encryption (SEDSSE) schemes. To begin, we propose a dynamic searchable symmetric encryption scheme that uses the secure k-Nearest Neighbor (kNN) and Attribute-Based Encryption (ABE) techniques to achieve two important security features: forward privacy and backward privacy, both of which are difficult to achieve in the field of dynamic searchable symmetric encryption. Then, to address the key sharing problem that plagues the kNN-based searchable encryption strategy, we suggest an improved technique. In terms of storage, search, and update complexity, our solutions outperform prior proposals. Extensive tests show that our approaches are efficient in terms of storage overhead, index building, trapdoor generation, and query.

Secure and Efficient Encryption Scheme Based on Bilinear Mapping

Secure and Efficient Encryption Scheme Based on Bilinear Mapping

Efficient Identity-Based Broadcast Encryption Scheme on Lattices for the Internet of Things

In an identity-based broadcast encryption (IBBE) scheme, the ciphertext is usually appended with a set of user identities to specify intended recipients. However, as IBBE is adopted in extensive industries, the demand of anonymity for specific scenarios such as military applications is urgent and ought no more to be ignored. On the contrary, how to optimize computation and communication is an unavoidable challenge in the IBBE scheme construction, especially in the large-scaled resource-limited wireless networks such as the Internet of Things (IoT), where the cost of computation and communication should be mitigated as much as possible since other functions including connectivity and privacy should be given the top priority. Thus, we present an IBBE scheme from the lattice, in which we employ the Chinese remainder theorem and lattice basis delegation in fixed dimensions to obtain several desirable characteristics, such as constant-size public parameter, private key, and ciphertext. In addition, our encryption and decryption algorithms are more efficient than broadcast encryption (BE) schemes based on number-theoretic problems. To be noticed, our scheme can simultaneously achieve confidentiality and outsider anonymity against the chosen-plaintext attack under the hardness of the learning with error (LWE) problem.

Information Transmission Scheme between Train and RBC Based on AES-ECC Algorithm

The existing information encryption scheme between the Radio Block Center (RBC) and the ground has problems such as weak keys, and the vehicle-ground information has a potential threat of being stolen. In order to ensure the safety of driving, on the basis of ensuring the correct transmission of train and ground information, research on more efficient encryption schemes has become the focus of work. In response to this trend, a hybrid encryption scheme based on AES and ECC encryption algorithms is proposed. The AES algorithm replaces the original 3DES algorithm, and the elliptic curve encryption algorithm ECC is used to encrypt the session key to improve the encryption security level. The encryption simulation, avalanche effect verification and execution efficiency test of fixed-length data are completed on Visual Stduio 2013 platform, and compared with the original encryption scheme. The results show that the scheme can meet the avalanche effect and the accuracy of data transmission, and it takes less time than the original encryption scheme, and is more suitable for two-way large-capacity information transmission between vehicles and ground.

An efficient outsourcing attribute-based encryption scheme in 5G mobile network environments

An efficient outsourcing attribute-based encryption scheme in 5G mobile network environments

Challenges in Cryptography

Cryptography as a field of study is exciting because it brings together beautiful mathematics and many cutting-edge areas of computer science and engineering to find solutions that touch all aspects of life in a digital era. In a single day at a cryptography conference, one can hear talks on election security and legislation on regulating encryption, new mathematical constructions that might yield more efficient encryption schemes, how to wirelessly hack a Tesla and drive away without the key, how Google secures communication between its data centers, and how to build a more private blockchain.

PCS-ABE (t, n): a secure threshold multi authority CP-ABE scheme based efficient access control systems for cloud environment

Cloud computing is a current phrase in marketing for an idea that has been recognized for years: Outsourcing. Cloud computing provides a large number of gratuities for each customer and enterprise agency. ‘Cloud model’ is more of a notion in which the data are hosted online and accessed at anytime-anywhere manner, on a pay-per-use model. However, the users may not fully trust the cloud service providers (CSPs) in that environment. So, it is hard to decide whether the cloud service provider (CSP) meets their expectations to provide the proper secrecy to users' shared data and privacy. Several access control schemes that allow, deny, or restrict users to have access to data have been proposed. Among these, the Attribute-Based Encryption (ABE) scheme has generally used to provide security efficiently in public managed cloud scheme storage. The earlier Attribute-Based Encryption (ABE) schemes have a single authority maintaining the whole attribute set and suffer from a single-point bottleneck problem. To resolve this issue, some Multi-Authority Attribute-Based Encryption (MA-ABE) schemes have proposed in which disjoint attribute sets are maintained separately, but the bottleneck problem still occurs. This paper involves multi-authority (MA) models, where multiple authorities mutually handle a uniform attribute set. It uses an efficient (t, n) threshold secret sharing scheme, in which n multiple authorities share the master key, and a legitimate user selects any t—out of n—authorities compute his/her secret_key. The results of security and performance analysis show that the proposed methodology is not only computationally secure whenever it is compromised by less than t—number of authorities, but still robust whenever at least t—number of authorities are active in the model. This paper uses an efficient encryption scheme to encrypt the plaintext message, which encrypts one byte at a time. It performs faster execution of encryption and reduces the hardware complexity.

Strong leakage-resilient encryption: enhancing data confidentiality by hiding partial ciphertext

Leakage-resilient encryption is a powerful tool to protect data confidentiality against side channel attacks. In this work, we introduce a new and strong leakage setting to counter backdoor (or Trojan horse) plus covert channel attack, by relaxing the restrictions on leakage. We allow bounded leakage at anytime and anywhere and over anything. Our leakage threshold (e.g., 10,000 bits) could be much larger than typical secret key (e.g., AES key or RSA private key) size. Under such a strong leakage setting, we propose an efficient encryption scheme which is semantic secure in standard setting (i.e., without leakage) and can tolerate strong continuous leakage.We manage to construct such a secure scheme under strong leakage setting, by hiding partial (e.g., $$1\%$$ ) ciphertext as secure as we hide the secret key using a small amount of more secure hardware resource, so that it is almost equally difficult for any adversary to steal information regarding this well-protected partial ciphertext or the secret key. We remark that the size of such well-protected small portion of ciphertext is chosen to be much larger than the leakage threshold. We provide concrete and practical examples of such more secure hardware resource for data communication and data storage. Furthermore, we also introduce a new notion of computational entropy, as a sort of computational version of Kolmogorov complexity. Our quantitative analysis shows that, hiding partial ciphertext is a powerful countermeasure, which enables us to achieve higher security level than existing approaches in case of backdoor plus covert channel attacks. We also show the relationship between our new notion of computational entropy and existing relevant concepts, including Shannon entropy, Yao entropy, Hill entropy, all-or-nothing Transform, and exposure-resilient function. This new computation entropy formulation may have independent interests.

Biometric based Multi-Authority Inner Product Encryption for Electronic Health Record

INTRODUCTION: Attribute-based encryption enhances the security of electronic health records outsourced to the cloud. At the same time, single authority attribute based encryption leads to user privacy breech and attribute management complexity. Multi authority attribute-based encryption enhances user privacy and attribute management, but lacks privacy and integrity of data. Therefore, biometric-based multi-authority inner product encryption is proposed to improve data integrity, data privacy, and user privacy.OBJECTIVES: The proposed scheme aims to enhance data integrity, data privacy, and user privacy in cloud-based Electronic Health Record.METHODS: An exhaustive literature review has been made related to securing electronic health record outsourced to the cloud and found that data integrity is lacking in existing schemes. So an efficient encryption scheme has been proposed which adopts elliptic curve cryptography to enhance data integrity. The security analysis and computational complexity of the proposed scheme is done and compared with existing schemes.RESULTS: The proposed scheme guarantees data integrity and privacy of the sensitive information stored in the electronic health records. The scheme also satisfied the security requirements user privacy, fine-grained access control, and scalability needed for electronic health record outsourced to the cloud. The computational complexity of the proposed scheme is compared with the existing schemes. The result shows that user access rejection complexity and key generation complexity are comparatively low.CONCLUSION: Biometric, as a global identifier of the user, could improve data integrity for the electronic health records outsourced to the cloud. Multi-authority Inner Product Encryption hides the access structure, along with the data, could improve data privacy and user privacy. Employing NOT gate in the access structure reduces user access rejection complexity.

Secure compressive sensing for ECG monitoring

With the proliferation of wearable wireless sensors and adequate communication protocols, the internet of things (IoT) started to shape the healthcare sector into a new frame of connection between patients with health providers. Although the huge opportunities granted by this paradigm, it raises some concerns as well. Two main issues that could be highlighted are power consumption and medical record security. This paper aims to address both issues in an IoT-based remote health monitoring systems by exploring compressive sensing (CS). The presented solution exploits shift registers with sparse sensing matrices in order to construct an encryption key to implement a lightweight efficient encryption scheme. The obtained results show that CS can reduce power consumption by a factor of 35% by only transmitting 70% of the data while preserving the ECG information. In addition, the paper demonstrates that transmission is kept secure even if the illegitimate attacker can access 95% of the information needed to recover the data.

Cryptosystem techniques based on the improved Chebyshev map: an application in image encryption

The use of nonlinear (chaotic) transformations in cryptography to create confusion during encryption process has become a common practice. In this paper, a pair of proficient cryptosystem techniques are proposed in the form of substitution and permutation constructed on the one-dimensional chaotic map (Improved Chebyshev map). Initially, an efficient and simple method for the construction of S-box using one-dimensional chaotic system is presented. The main advantage of the suggested scheme is to generate strong S-boxes depending upon keys used by chaotic map. Then, an efficient encryption scheme based on substitution box and the chaotic map (substitution and permutation system) is presented. Experimental consequences validate the efficiency of anticipated algorithms. A great potential and higher performance for noticeable dominance regarding cryptographic applications can be seen for the presented cryptosystems in comparison with the algorithms already developed in literature.

An efficient outsourced attribute-based encryption scheme in the device-to-device mobile network

Device-to-device communication is considered as one of the hopeful technologies for proximal communication, which plays a vital role in the wireless systems and 5G cellular networks. The outsourced attribute-based encryption scheme is convinced to be very suitable for secure device-to-device communication since it allows not only fine-grained sharing of encrypted data but also achieves high efficiency in the decryption of general attribute-based encryption schemes. However, almost all existing outsourced attribute-based encryption schemes can hardly be applied directly in the device-to-device communication because many heavy computation operations, such as pairing and modular exponentiations, cannot be taken on the mobile devices in the device-to-device network. In this article, we propose a concept of outsourcing threshold decryption for attribute-based encryption and design a new efficient outsourcing threshold decryption scheme for ciphertext-policy attribute-based encryption. In our definition of outsourcing threshold decryption, the decryption, which is a computationally expensive operation, is outsourced to multiple semi-trusted and lightweight computing devices determined by an access structure and can be jointly taken by these devices. Our scheme supports proxy re-encryption which enables the decryption delegation. Finally, security and efficiency analyses of our proposed method indicate that our proposal guarantees strong security against chosen plaintext attacks and requires less outsourced computation and communication cost than the existing outsourced attribute-based encryption schemes.

Efficient and Verifiable Encryption Scheme in Lightweight Narrowband Internet of Things Applications

Efficient and Verifiable Encryption Scheme in Lightweight Narrowband Internet of Things Applications

Energy Efficient Encryption Scheme for Integrating Wireless Sensor Networks with Internet

Energy Efficient Encryption Scheme for Integrating Wireless Sensor Networks with Internet

Design and Analysis of Compressive Sensing-Based Lightweight Encryption Scheme for Multimedia IoT

This brief presents a compressive sensing (CS)-based lightweight cryptosystem for Internet of Things (IoT) applications. In a recent study, Pudi et al. presented two efficient CS-based cryptosystems: CS using stream cipher (CSSC) and CSSC with encryption of MSB-bits (CSSC-EM). The proposed work aims to improve the energy efficiency of CSSC-EM further, without compromising security. While the random Bernoulli sensing matrix in CSSC-EM offers greater flexibility for embedding security, it suffers from a high computational cost. In contrast, the deterministic nature of the structurally random matrix (SRM) rectifies the computational burden, making the CS encoder energy-conserving. In this brief, we first quantify the security of CSSC and CSSC-EM against a chosen plaintext attack (CPA). Based on this cryptanalysis, we propose a CS-based energy efficient encryption scheme using an SRM for multimedia IoT. The artificial noise is injected to quantized CS measurements to resist CPA, based on the rate-distortion analysis of CS using SRM. Further, bitstream resulting from entropy coding of quantized CS measurements is randomly corrupted through an intentional error vector to achieve uniform probability distribution. We develop an efficient hardware implementation of the overall cryptosystem based on a linear feedback shift register. Analytical and simulation results are presented to validate resistance of the proposed system against various attacks.

Efficient chosen-ciphertext secure hybrid encryption scheme tolerating continuous leakage attacks

ABSTRACTFor any PPT adversary, most traditional leakage-resilient cryptographic primitives cannot ensure that all elements in ciphertext are random. What’s worse, in a continuous leakage setting, there are few leakage-resilient cryptographic primitives available. Currently, not many researchers are studying leakage-resilient hybrid encryption (LR-HE) scheme. Thus, two continuous leakage-resilient hybrid encryption (CLR-HE) schemes are constructed in this paper, and the schemes’ security are proven based on the standard static assumption. Our constructions not only can maintain their claimed security in a continuous leakage setting, but also enjoy better performances. Because of these good performances, our constructions can provide continuous leakage-resilient security in the Internet of Things.