A medical image encryption is proposed based on the Fisher-Yates scrambling,filter diffusion and S-box substitution.First,chaotic sequence associated with the plaintext is generated by logistic-sine-cosine system,whic...A medical image encryption is proposed based on the Fisher-Yates scrambling,filter diffusion and S-box substitution.First,chaotic sequence associated with the plaintext is generated by logistic-sine-cosine system,which is used for the scrambling,substitution and diffusion processes.The three-dimensional Fisher-Yates scrambling,S-box substitution and diffusion are employed for the first round of encryption.The chaotic sequence is adopted for secondary encryption to scramble the ciphertext obtained in the first round.Then,three-dimensional filter is applied to diffusion for further useful information hiding.The key to the algorithm is generated by the combination of hash value of plaintext image and the input parameters.It improves resisting ability of plaintext attacks.The security analysis shows that the algorithm is effective and efficient.It can resist common attacks.In addition,the good diffusion effect shows that the scheme can solve the differential attacks encountered in the transmission of medical images and has positive implications for future research.展开更多
Satellite images are widely used for remote sensing and defence applications,however,they are subject to a variety of threats.To ensure the security and privacy of these images,theymust be watermarked and encrypted be...Satellite images are widely used for remote sensing and defence applications,however,they are subject to a variety of threats.To ensure the security and privacy of these images,theymust be watermarked and encrypted before communication.Therefore,this paper proposes a novel watermarked satellite image encryption scheme based on chaos,Deoxyribonucleic Acid(DNA)sequence,and hash algorithm.The watermark image,DNA sequence,and plaintext image are passed through the Secure Hash Algorithm(SHA-512)to compute the initial condition(keys)for the Tangent-Delay Ellipse Reflecting Cavity Map(TD-ERCS),Henon,and Duffing chaotic maps,respectively.Through bitwise XOR and substitution,the TD-ERCS map encrypts the watermark image.The ciphered watermark image is embedded in the plaintext image.The embedded plaintext image is permuted row-wise and column-wise using the Henon chaotic map.The permuted image is then bitwise XORed with the values obtained from the Duffing map.For additional security,the XORed image is substituted through a dynamic S-Box.To evaluate the efficiency and performance of the proposed algorithm,several tests are performed which prove its resistance to various types of attacks such as brute-force and statistical attacks.展开更多
With increasing demand for data circulation,ensuring data security and privacy is paramount,specifically protecting privacy while maximizing utility.Blockchain,while decentralized and transparent,faces challenges in p...With increasing demand for data circulation,ensuring data security and privacy is paramount,specifically protecting privacy while maximizing utility.Blockchain,while decentralized and transparent,faces challenges in privacy protection and data verification,especially for sensitive data.Existing schemes often suffer from inefficiency and high overhead.We propose a privacy protection scheme using BGV homomorphic encryption and Pedersen Secret Sharing.This scheme enables secure computation on encrypted data,with Pedersen sharding and verifying the private key,ensuring data consistency and immutability.The blockchain framework manages key shards,verifies secrets,and aids security auditing.This approach allows for trusted computation without revealing the underlying data.Preliminary results demonstrate the scheme's feasibility in ensuring data privacy and security,making data available but not visible.This study provides an effective solution for data sharing and privacy protection in blockchain applications.展开更多
With the continuous growth of exponential data in IoT,it is usually chosen to outsource data to the cloud server.However,cloud servers are usually provided by third parties,and there is a risk of privacy leakage.Encry...With the continuous growth of exponential data in IoT,it is usually chosen to outsource data to the cloud server.However,cloud servers are usually provided by third parties,and there is a risk of privacy leakage.Encrypting data can ensure its security,but at the same time,it loses the retrieval function of IoT data.Searchable Encryption(SE)can achieve direct retrieval based on ciphertext data.The traditional searchable encryption scheme has the problems of imperfect function,low retrieval efficiency,inaccurate retrieval results,and centralized cloud servers being vulnerable and untrustworthy.This paper proposes an Efficient searchable encryption scheme supporting fuzzy multi-keyword ranking search on the blockchain.The blockchain and IPFS are used to store the index and encrypted files in a distributed manner respectively.The tamper resistance of the distributed ledger ensures the authenticity of the data.The data retrieval work is performed by the smart contract to ensure the reliability of the data retrieval.The Local Sensitive Hash(LSH)function is combined with the Bloom Filter(BF)to realize the fuzzy multi-keyword retrieval function.In addition,to measure the correlation between keywords and files,a new weighted statistical algorithm combining RegionalWeight Score(RWS)and Term Frequency–Inverse Document Frequency(TF-IDF)is proposed to rank the search results.The balanced binary tree is introduced to establish the index structure,and the index binary tree traversal strategy suitable for this scheme is constructed to optimize the index structure and improve the retrieval efficiency.The experimental results show that the scheme is safe and effective in practical applications.展开更多
Machine-to-machine (M2M) communication networks consist of resource-constrained autonomous devices, also known as autonomous Internet of things (IoTs) or machine-type communication devices (MTCDs) which act as a backb...Machine-to-machine (M2M) communication networks consist of resource-constrained autonomous devices, also known as autonomous Internet of things (IoTs) or machine-type communication devices (MTCDs) which act as a backbone for Industrial IoT, smart cities, and other autonomous systems. Due to the limited computing and memory capacity, these devices cannot maintain strong security if conventional security methods are applied such as heavy encryption. This article proposed a novel lightweight mutual authentication scheme including elliptic curve cryptography (ECC) driven end-to-end encryption through curve25519 such as (i): efficient end-to-end encrypted communication with pre-calculation strategy using curve25519;and (ii): elliptic curve Diffie-Hellman (ECDH) based mutual authentication technique through a novel lightweight hash function. The proposed scheme attempts to efficiently counter all known perception layer security threats. Moreover, the pre-calculated key generation strategy resulted in cost-effective encryption with 192-bit curve security. It showed comparative efficiency in key strength, and curve strength compared with similar authentication schemes in terms of computational and memory cost, communication performance and encryption robustness.展开更多
In wireless communication transmission,image encryption plays a key role in protecting data privacy against unauthorized access.However,conventional encryption methods often face challenges in key space security,parti...In wireless communication transmission,image encryption plays a key role in protecting data privacy against unauthorized access.However,conventional encryption methods often face challenges in key space security,particularly when relying on chaotic sequences,which may exhibit vulnerabilities to brute-force and predictability-based attacks.To address the limitations,this paper presents a robust and efficient encryption scheme that combines iterative hyper-chaotic systems and Convolutional Neural Networks(CNNs).Firstly,a novel two-dimensional iterative hyper-chaotic system is proposed because of its complex dynamic behavior and expanded parameter space,which can enhance the key space complexity and randomness,ensuring resistance against cryptanalysis.Secondly,an innovative CNN architecture is introduced for generating the key stream for the cryptographic system.CNN architecture exhibits excellent nonlinearity and can further optimize the key generation process.To rigorously evaluate the encryption performance,extensive simulation analyses were conducted,including visualization,statistical histogram,information entropy,correlation,differential attack,and resistance.The method has shown a high NPCR(Number of Pixel Change Rate)of 99.642%and a UACI(Unified Average Changing Intensity)value of 33.465%,exhibiting powerful resistance to differential attacks.A series of comprehensive experimental tests have illustrated that the proposed scheme exhibits superior distribution characteristics,which underscores the robustness and efficacy of the image encryption,and helps for communication security.展开更多
Ciphertext data retrieval in cloud databases suffers from some critical limitations,such as inadequate security measures,disorganized key management practices,and insufficient retrieval access control capabilities.To ...Ciphertext data retrieval in cloud databases suffers from some critical limitations,such as inadequate security measures,disorganized key management practices,and insufficient retrieval access control capabilities.To address these problems,this paper proposes an enhanced Fully Homomorphic Encryption(FHE)algorithm based on an improved DGHV algorithm,coupled with an optimized ciphertext retrieval scheme.Our specific contributions are outlined as follows:First,we employ an authorization code to verify the user’s retrieval authority and perform hierarchical access control on cloud storage data.Second,a triple-key encryption mechanism,which separates the data encryption key,retrieval authorization key,and retrieval key,is designed.Different keys are provided to different entities to run corresponding system functions.The key separation architecture proves particularly advantageous in multi-verifier coexistence scenarios,environments involving untrusted third-party retrieval services.Finally,the enhanced DGHV-based retrieval mechanism extends conventional functionality by enabling multi-keyword queries with similarity-ranked results,thereby significantly improving both the functionality and usability of the FHE system.展开更多
Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.P...Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.Previous schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing costs.To address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training scheme.Firstly,we design a multi-precision functional encryption computation based on Euclidean division.Second,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced heterogeneity.Finally,we conduct experiments on three datasets.The results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.展开更多
Attribute-based encryption(ABE)is a cryptographic framework that provides flexible access control by allowing encryption based on user attributes.ABE is widely applied in cloud storage,file sharing,e-Health,and digita...Attribute-based encryption(ABE)is a cryptographic framework that provides flexible access control by allowing encryption based on user attributes.ABE is widely applied in cloud storage,file sharing,e-Health,and digital rightsmanagement.ABE schemes rely on hard cryptographic assumptions such as pairings and others(pairingfree)to ensure their security against external and internal attacks.Internal attacks are carried out by authorized users who misuse their access to compromise security with potentially malicious intent.One common internal attack is the attribute collusion attack,in which users with different attribute keys collaborate to decrypt data they could not individually access.This paper focuses on the ciphertext-policy ABE(CP-ABE),a type of ABE where ciphertexts are produced with access policies.Our firstwork is to carry out the attribute collusion attack against several existing pairingfree CP-ABE schemes.As a main contribution,we introduce a novel attack,termed the anonymous key-leakage attack,concerning the context in which users could anonymously publish their secret keys associated with certain attributes on public platforms without the risk of detection.This kind of internal attack has not been defined or investigated in the literature.We then show that several prominent pairing-based CP-ABE schemes are vulnerable to this attack.We believe that this work will contribute to helping the community evaluate suitable CP-ABE schemes for secure deployment in real-life applications.展开更多
Existing chaotic encryption schemes primarily focus on single types of images,making the design of hybrid image encryption schemes more suitable for practical applications.In this paper,a hyperchaotic map with a spher...Existing chaotic encryption schemes primarily focus on single types of images,making the design of hybrid image encryption schemes more suitable for practical applications.In this paper,a hyperchaotic map with a spherical attractor is proposed,which is constructed using spherical coordinates.Dynamical analyses reveal that the hyperchaotic map exhibits global hyperchaos and high complexity,making it capable of generating more complex chaotic sequences suitable for image encryption.A hybrid encryption scheme based on a hyperchaotic map is proposed for two-dimensional(2D)images,three-dimensional(3D)models,and 3D point clouds.Firstly,the pixels of 2D image and the coordinate data of 3D image are fused into a plaintext cube,which is combined with Hash-512 to obtain the initial value of the hyperchaotic map.Chaotic sequences are utilized for cube space internal confusion and dynamic cross-diffusion.The encrypted images demonstrate high information entropy,and the test results show that the encryption scheme effectively protects the images.The proposed hybrid image encryption scheme provides an efficient solution for securing various types of images.展开更多
In the field of Internet, an image is of great significance to information transmission. Meanwhile, how to ensure and improve its security has become the focus of international research. We combine DNA codec with quan...In the field of Internet, an image is of great significance to information transmission. Meanwhile, how to ensure and improve its security has become the focus of international research. We combine DNA codec with quantum Arnold transform(QAr T) to propose a new double encryption algorithm for quantum color images to improve the security and robustness of image encryption. First, we utilize the biological characteristics of DNA codecs to perform encoding and decoding operations on pixel color information in quantum color images, and achieve pixel-level diffusion. Second, we use QAr T to scramble the position information of quantum images and use the operated image as the key matrix for quantum XOR operations. All quantum operations in this paper are reversible, so the decryption operation of the ciphertext image can be realized by the reverse operation of the encryption process. We conduct simulation experiments on encryption and decryption using three color images of “Monkey”, “Flower”, and “House”. The experimental results show that the peak value and correlation of the encrypted images on the histogram have good similarity, and the average normalized pixel change rate(NPCR) of RGB three-channel is 99.61%, the average uniform average change intensity(UACI) is 33.41%,and the average information entropy is about 7.9992. In addition, the robustness of the proposed algorithm is verified by the simulation of noise interference in the actual scenario.展开更多
Public-key encryption is essential for secure communications,eliminating the need for pre-shared keys.However,traditional schemes such as RSA(Rivest-Shamir-Adleman)and elliptic curve cryptography rely on computational...Public-key encryption is essential for secure communications,eliminating the need for pre-shared keys.However,traditional schemes such as RSA(Rivest-Shamir-Adleman)and elliptic curve cryptography rely on computational complexity,making them increasingly susceptible to advances in computing power and algorithms.Physical-layer encryption,which leverages the intrinsic properties of physical systems,offers a promising alternative with security rooted in physics.Despite progress in this field,public-key encryption at the optical layer remains largely unexplored.Here,we propose a novel optical public-key encryption scheme based on partially coherent light sources.The cryptographic keys are encoded in the incoherent optical transmission matrix of an on-chip Mach-Zehnder interferometer mesh,providing high complexity and resilience to computational attacks.We experimentally demonstrate encrypted image transmission over 40 km of optical fiber with high decryption fidelity and achieve a 10 Gbit/s optical encryption rate using a lithium niobate photonic chip.This represents the first implementation of public-key encryption at the physical optical layer.The approach offers key advantages in security,cost,energy efficiency,and compatibility with commercial optical communication systems.By integrating public-key encryption into photonic hardware,this work opens a new direction for secure and high-speed optical communications in next-generation networks.展开更多
Driven by advancements in mobile internet technology,images have become a crucial data medium.Ensuring the security of image information during transmission has thus emerged as an urgent challenge.This study proposes ...Driven by advancements in mobile internet technology,images have become a crucial data medium.Ensuring the security of image information during transmission has thus emerged as an urgent challenge.This study proposes a novel image encryption algorithm specifically designed for grayscale image security.This research introduces a new Cantor diagonal matrix permutation method.The proposed permutation method uses row and column index sequences to control the Cantor diagonal matrix,where the row and column index sequences are generated by a spatiotemporal chaotic system named coupled map lattice(CML).The high initial value sensitivity of the CML system makes the permutation method highly sensitive and secure.Additionally,leveraging fractal theory,this study introduces a chaotic fractal matrix and applies this matrix in the diffusion process.This chaotic fractal matrix exhibits selfsimilarity and irregularity.Using the Cantor diagonal matrix and chaotic fractal matrix,this paper introduces a fast image encryption algorithm involving two diffusion steps and one permutation step.Moreover,the algorithm achieves robust security with only a single encryption round,ensuring high operational efficiency.Experimental results show that the proposed algorithm features an expansive key space,robust security,high sensitivity,high efficiency,and superior statistical properties for the ciphered images.Thus,the proposed algorithm not only provides a practical solution for secure image transmission but also bridges fractal theory with image encryption techniques,thereby opening new research avenues in chaotic cryptography and advancing the development of information security technology.展开更多
In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic q...In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency.展开更多
Tag key encapsulation mechanism （Tag-KEM）/data encapsulation mechanism （DEM） is a hybrid framework proposed in 2005. Tag-t（EM is one of its parts by using public-key encryption （PKE） technique to encapsulate a ...Tag key encapsulation mechanism （Tag-KEM）/data encapsulation mechanism （DEM） is a hybrid framework proposed in 2005. Tag-t（EM is one of its parts by using public-key encryption （PKE） technique to encapsulate a symmetric key. In hybrid encryptions, the long-raessage PKE is not desired due to its slow operation. A general method is presented for constructing Tag-KEM schemes with short-message PKEs. The chosen ciphertext security is proved in the random oracle model. In the method, the treatment of the tag part brings no additional ciphertext redundancy. Among all the methods for constructing Tag-KEM, the method is the first one without any validity checking on the tag part, thus showing that the Tag-KEM/DEM framework is superior to KEM＋DEM one.展开更多
The concept of sharing of personal health data over cloud storage in a healthcare-cyber physical system has become popular in recent times as it improves access quality.The privacy of health data can only be preserved...The concept of sharing of personal health data over cloud storage in a healthcare-cyber physical system has become popular in recent times as it improves access quality.The privacy of health data can only be preserved by keeping it in an encrypted form,but it affects usability and flexibility in terms of effective search.Attribute-based searchable encryption(ABSE)has proven its worth by providing fine-grained searching capabilities in the shared cloud storage.However,it is not practical to apply this scheme to the devices with limited resources and storage capacity because a typical ABSE involves serious computations.In a healthcare cloud-based cyber-physical system(CCPS),the data is often collected by resource-constraint devices;therefore,here also,we cannot directly apply ABSE schemes.In the proposed work,the inherent computational cost of the ABSE scheme is managed by executing the computationally intensive tasks of a typical ABSE scheme on the blockchain network.Thus,it makes the proposed scheme suitable for online storage and retrieval of personal health data in a typical CCPS.With the assistance of blockchain technology,the proposed scheme offers two main benefits.First,it is free from a trusted authority,which makes it genuinely decentralized and free from a single point of failure.Second,it is computationally efficient because the computational load is now distributed among the consensus nodes in the blockchain network.Specifically,the task of initializing the system,which is considered the most computationally intensive,and the task of partial search token generation,which is considered as the most frequent operation,is now the responsibility of the consensus nodes.This eliminates the need of the trusted authority and reduces the burden of data users,respectively.Further,in comparison to existing decentralized fine-grained searchable encryption schemes,the proposed scheme has achieved a significant reduction in storage and computational cost for the secret key associated with users.It has been verified both theoretically and practically in the performance analysis section.展开更多
We propose a new image encryption algorithm on the basis of the fractional-order hyperchaotic Lorenz system. While in the process of generating a key stream, the system parameters and the derivative order are embedded...We propose a new image encryption algorithm on the basis of the fractional-order hyperchaotic Lorenz system. While in the process of generating a key stream, the system parameters and the derivative order are embedded in the proposed algorithm to enhance the security. Such an algorithm is detailed in terms of security analyses, including correlation analysis, information entropy analysis, run statistic analysis, mean-variance gray value analysis, and key sensitivity analysis. The experimental results demonstrate that the proposed image encryption scheme has the advantages of large key space and high security for practical image encryption.展开更多
Based on the Fisher–Yatess scrambling and DNA coding technology, a chaotical image encryption method is proposed. First, the SHA-3 algorithm is used to calculate the hash value of the initial password, which is used ...Based on the Fisher–Yatess scrambling and DNA coding technology, a chaotical image encryption method is proposed. First, the SHA-3 algorithm is used to calculate the hash value of the initial password, which is used as the initial value of the chaotic system. Second, the chaotic sequence and Fisher–Yatess scrambling are used to scramble the plaintext,and a sorting scrambling algorithm is used for secondary scrambling. Then, the chaotic sequence and DNA coding rules are used to change the plaintext pixel values, which makes the ciphertext more random and resistant to attacks, and thus ensures that the encrypted ciphertext is more secure. Finally, we add plaintext statistics for pixel-level diffusion to ensure plaintext sensitivity. The experimental results and security analysis show that the new algorithm has a good encryption effect and speed, and can also resist common attacks.展开更多
The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant qua...The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and eneryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security,security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.展开更多
Attribute-based encryption is drawing more attention with its inherent attractive properties which are potential to be widely used in the newly developing cloud computing. However, one of the main obstacles for its ap...Attribute-based encryption is drawing more attention with its inherent attractive properties which are potential to be widely used in the newly developing cloud computing. However, one of the main obstacles for its application is how to revoke the attributes of the users, though some ABE schemes have realized revocation, they mostly focused on the user revocation that revokes the user＇s whole attributes, or attribute revocation under the indirect revocation model such that all the users＇ private keys will be affected by the revocation. In this paper, we define the model of CP-ABE supporting the attribute revocation under the direct revocation model, in which the revocation list is embed in the ciphertext and none of the users＇ private keys will be affected by the revocation process. Then we propose a generic construction, and prove its security with the decision q-BDHE assumption.展开更多
文摘A medical image encryption is proposed based on the Fisher-Yates scrambling,filter diffusion and S-box substitution.First,chaotic sequence associated with the plaintext is generated by logistic-sine-cosine system,which is used for the scrambling,substitution and diffusion processes.The three-dimensional Fisher-Yates scrambling,S-box substitution and diffusion are employed for the first round of encryption.The chaotic sequence is adopted for secondary encryption to scramble the ciphertext obtained in the first round.Then,three-dimensional filter is applied to diffusion for further useful information hiding.The key to the algorithm is generated by the combination of hash value of plaintext image and the input parameters.It improves resisting ability of plaintext attacks.The security analysis shows that the algorithm is effective and efficient.It can resist common attacks.In addition,the good diffusion effect shows that the scheme can solve the differential attacks encountered in the transmission of medical images and has positive implications for future research.
基金supported by the Deanship of Scientific Research at King Khalid University for funding this work through the large group research project under grant number RGP2/461/45the Deanship of Scientific Researchat Northern Border University,Arar,Saudi Arabia for funding this research work through the project number NBU-FFR-2025-3030-05.
文摘Satellite images are widely used for remote sensing and defence applications,however,they are subject to a variety of threats.To ensure the security and privacy of these images,theymust be watermarked and encrypted before communication.Therefore,this paper proposes a novel watermarked satellite image encryption scheme based on chaos,Deoxyribonucleic Acid(DNA)sequence,and hash algorithm.The watermark image,DNA sequence,and plaintext image are passed through the Secure Hash Algorithm(SHA-512)to compute the initial condition(keys)for the Tangent-Delay Ellipse Reflecting Cavity Map(TD-ERCS),Henon,and Duffing chaotic maps,respectively.Through bitwise XOR and substitution,the TD-ERCS map encrypts the watermark image.The ciphered watermark image is embedded in the plaintext image.The embedded plaintext image is permuted row-wise and column-wise using the Henon chaotic map.The permuted image is then bitwise XORed with the values obtained from the Duffing map.For additional security,the XORed image is substituted through a dynamic S-Box.To evaluate the efficiency and performance of the proposed algorithm,several tests are performed which prove its resistance to various types of attacks such as brute-force and statistical attacks.
基金supported by the National Key Research and Development Plan in China(Grant No.2020YFB1005500)。
文摘With increasing demand for data circulation,ensuring data security and privacy is paramount,specifically protecting privacy while maximizing utility.Blockchain,while decentralized and transparent,faces challenges in privacy protection and data verification,especially for sensitive data.Existing schemes often suffer from inefficiency and high overhead.We propose a privacy protection scheme using BGV homomorphic encryption and Pedersen Secret Sharing.This scheme enables secure computation on encrypted data,with Pedersen sharding and verifying the private key,ensuring data consistency and immutability.The blockchain framework manages key shards,verifies secrets,and aids security auditing.This approach allows for trusted computation without revealing the underlying data.Preliminary results demonstrate the scheme's feasibility in ensuring data privacy and security,making data available but not visible.This study provides an effective solution for data sharing and privacy protection in blockchain applications.
基金funded by the Jilin Provincial Department of Education Scientific Research Project(Project No.JJKH20250872KJ).
文摘With the continuous growth of exponential data in IoT,it is usually chosen to outsource data to the cloud server.However,cloud servers are usually provided by third parties,and there is a risk of privacy leakage.Encrypting data can ensure its security,but at the same time,it loses the retrieval function of IoT data.Searchable Encryption(SE)can achieve direct retrieval based on ciphertext data.The traditional searchable encryption scheme has the problems of imperfect function,low retrieval efficiency,inaccurate retrieval results,and centralized cloud servers being vulnerable and untrustworthy.This paper proposes an Efficient searchable encryption scheme supporting fuzzy multi-keyword ranking search on the blockchain.The blockchain and IPFS are used to store the index and encrypted files in a distributed manner respectively.The tamper resistance of the distributed ledger ensures the authenticity of the data.The data retrieval work is performed by the smart contract to ensure the reliability of the data retrieval.The Local Sensitive Hash(LSH)function is combined with the Bloom Filter(BF)to realize the fuzzy multi-keyword retrieval function.In addition,to measure the correlation between keywords and files,a new weighted statistical algorithm combining RegionalWeight Score(RWS)and Term Frequency–Inverse Document Frequency(TF-IDF)is proposed to rank the search results.The balanced binary tree is introduced to establish the index structure,and the index binary tree traversal strategy suitable for this scheme is constructed to optimize the index structure and improve the retrieval efficiency.The experimental results show that the scheme is safe and effective in practical applications.
文摘Machine-to-machine (M2M) communication networks consist of resource-constrained autonomous devices, also known as autonomous Internet of things (IoTs) or machine-type communication devices (MTCDs) which act as a backbone for Industrial IoT, smart cities, and other autonomous systems. Due to the limited computing and memory capacity, these devices cannot maintain strong security if conventional security methods are applied such as heavy encryption. This article proposed a novel lightweight mutual authentication scheme including elliptic curve cryptography (ECC) driven end-to-end encryption through curve25519 such as (i): efficient end-to-end encrypted communication with pre-calculation strategy using curve25519;and (ii): elliptic curve Diffie-Hellman (ECDH) based mutual authentication technique through a novel lightweight hash function. The proposed scheme attempts to efficiently counter all known perception layer security threats. Moreover, the pre-calculated key generation strategy resulted in cost-effective encryption with 192-bit curve security. It showed comparative efficiency in key strength, and curve strength compared with similar authentication schemes in terms of computational and memory cost, communication performance and encryption robustness.
基金supported in part by the National Key Research and Development Program of China(No.2021YFB3101500)the Fundamental Research Funds for the Central Universities(No.2023RC69).
文摘In wireless communication transmission,image encryption plays a key role in protecting data privacy against unauthorized access.However,conventional encryption methods often face challenges in key space security,particularly when relying on chaotic sequences,which may exhibit vulnerabilities to brute-force and predictability-based attacks.To address the limitations,this paper presents a robust and efficient encryption scheme that combines iterative hyper-chaotic systems and Convolutional Neural Networks(CNNs).Firstly,a novel two-dimensional iterative hyper-chaotic system is proposed because of its complex dynamic behavior and expanded parameter space,which can enhance the key space complexity and randomness,ensuring resistance against cryptanalysis.Secondly,an innovative CNN architecture is introduced for generating the key stream for the cryptographic system.CNN architecture exhibits excellent nonlinearity and can further optimize the key generation process.To rigorously evaluate the encryption performance,extensive simulation analyses were conducted,including visualization,statistical histogram,information entropy,correlation,differential attack,and resistance.The method has shown a high NPCR(Number of Pixel Change Rate)of 99.642%and a UACI(Unified Average Changing Intensity)value of 33.465%,exhibiting powerful resistance to differential attacks.A series of comprehensive experimental tests have illustrated that the proposed scheme exhibits superior distribution characteristics,which underscores the robustness and efficacy of the image encryption,and helps for communication security.
基金supported by the Innovation Program for Quantum Science and technology(2021ZD0301300)supported by the Fundamental Research Funds for the Central Universities(Nos.3282024046,3282024052,3282024058,3282023017).
文摘Ciphertext data retrieval in cloud databases suffers from some critical limitations,such as inadequate security measures,disorganized key management practices,and insufficient retrieval access control capabilities.To address these problems,this paper proposes an enhanced Fully Homomorphic Encryption(FHE)algorithm based on an improved DGHV algorithm,coupled with an optimized ciphertext retrieval scheme.Our specific contributions are outlined as follows:First,we employ an authorization code to verify the user’s retrieval authority and perform hierarchical access control on cloud storage data.Second,a triple-key encryption mechanism,which separates the data encryption key,retrieval authorization key,and retrieval key,is designed.Different keys are provided to different entities to run corresponding system functions.The key separation architecture proves particularly advantageous in multi-verifier coexistence scenarios,environments involving untrusted third-party retrieval services.Finally,the enhanced DGHV-based retrieval mechanism extends conventional functionality by enabling multi-keyword queries with similarity-ranked results,thereby significantly improving both the functionality and usability of the FHE system.
基金supported by Natural Science Foundation of China(Nos.62303126,62362008,author Z.Z,https://www.nsfc.gov.cn/,accessed on 20 December 2024)Major Scientific and Technological Special Project of Guizhou Province([2024]014)+2 种基金Guizhou Provincial Science and Technology Projects(No.ZK[2022]General149) ,author Z.Z,https://kjt.guizhou.gov.cn/,accessed on 20 December 2024)The Open Project of the Key Laboratory of Computing Power Network and Information Security,Ministry of Education under Grant 2023ZD037,author Z.Z,https://www.gzu.edu.cn/,accessed on 20 December 2024)Open Research Project of the State Key Laboratory of Industrial Control Technology,Zhejiang University,China(No.ICT2024B25),author Z.Z,https://www.gzu.edu.cn/,accessed on 20 December 2024).
文摘Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.Previous schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing costs.To address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training scheme.Firstly,we design a multi-precision functional encryption computation based on Euclidean division.Second,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced heterogeneity.Finally,we conduct experiments on three datasets.The results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.
文摘Attribute-based encryption(ABE)is a cryptographic framework that provides flexible access control by allowing encryption based on user attributes.ABE is widely applied in cloud storage,file sharing,e-Health,and digital rightsmanagement.ABE schemes rely on hard cryptographic assumptions such as pairings and others(pairingfree)to ensure their security against external and internal attacks.Internal attacks are carried out by authorized users who misuse their access to compromise security with potentially malicious intent.One common internal attack is the attribute collusion attack,in which users with different attribute keys collaborate to decrypt data they could not individually access.This paper focuses on the ciphertext-policy ABE(CP-ABE),a type of ABE where ciphertexts are produced with access policies.Our firstwork is to carry out the attribute collusion attack against several existing pairingfree CP-ABE schemes.As a main contribution,we introduce a novel attack,termed the anonymous key-leakage attack,concerning the context in which users could anonymously publish their secret keys associated with certain attributes on public platforms without the risk of detection.This kind of internal attack has not been defined or investigated in the literature.We then show that several prominent pairing-based CP-ABE schemes are vulnerable to this attack.We believe that this work will contribute to helping the community evaluate suitable CP-ABE schemes for secure deployment in real-life applications.
基金Project supported by the Basic Scientific Research Projects of Department of Education of Liaoning Province,China(Grant No.LJ212410152049)the Technological Innovation Projects in the field of artificial intelligence of Liaoning Province,China(Grant No.2023JH26/10300011)。
文摘Existing chaotic encryption schemes primarily focus on single types of images,making the design of hybrid image encryption schemes more suitable for practical applications.In this paper,a hyperchaotic map with a spherical attractor is proposed,which is constructed using spherical coordinates.Dynamical analyses reveal that the hyperchaotic map exhibits global hyperchaos and high complexity,making it capable of generating more complex chaotic sequences suitable for image encryption.A hybrid encryption scheme based on a hyperchaotic map is proposed for two-dimensional(2D)images,three-dimensional(3D)models,and 3D point clouds.Firstly,the pixels of 2D image and the coordinate data of 3D image are fused into a plaintext cube,which is combined with Hash-512 to obtain the initial value of the hyperchaotic map.Chaotic sequences are utilized for cube space internal confusion and dynamic cross-diffusion.The encrypted images demonstrate high information entropy,and the test results show that the encryption scheme effectively protects the images.The proposed hybrid image encryption scheme provides an efficient solution for securing various types of images.
基金Project supported by the Natural Science Foundation of Shandong Province, China (Grant No. ZR2021MF049)Joint Fund of Natural Science Foundation of Shandong Province (Grant Nos. ZR2022LLZ012 and ZR2021LLZ001)the Key R&D Program of Shandong Province, China (Grant No. 2023CXGC010901)。
文摘In the field of Internet, an image is of great significance to information transmission. Meanwhile, how to ensure and improve its security has become the focus of international research. We combine DNA codec with quantum Arnold transform(QAr T) to propose a new double encryption algorithm for quantum color images to improve the security and robustness of image encryption. First, we utilize the biological characteristics of DNA codecs to perform encoding and decoding operations on pixel color information in quantum color images, and achieve pixel-level diffusion. Second, we use QAr T to scramble the position information of quantum images and use the operated image as the key matrix for quantum XOR operations. All quantum operations in this paper are reversible, so the decryption operation of the ciphertext image can be realized by the reverse operation of the encryption process. We conduct simulation experiments on encryption and decryption using three color images of “Monkey”, “Flower”, and “House”. The experimental results show that the peak value and correlation of the encrypted images on the histogram have good similarity, and the average normalized pixel change rate(NPCR) of RGB three-channel is 99.61%, the average uniform average change intensity(UACI) is 33.41%,and the average information entropy is about 7.9992. In addition, the robustness of the proposed algorithm is verified by the simulation of noise interference in the actual scenario.
基金supported by the Fundamental Research Funds for the Central Universities.National Natural Science Foundation of China(62425504,U21A20511,62275088).
文摘Public-key encryption is essential for secure communications,eliminating the need for pre-shared keys.However,traditional schemes such as RSA(Rivest-Shamir-Adleman)and elliptic curve cryptography rely on computational complexity,making them increasingly susceptible to advances in computing power and algorithms.Physical-layer encryption,which leverages the intrinsic properties of physical systems,offers a promising alternative with security rooted in physics.Despite progress in this field,public-key encryption at the optical layer remains largely unexplored.Here,we propose a novel optical public-key encryption scheme based on partially coherent light sources.The cryptographic keys are encoded in the incoherent optical transmission matrix of an on-chip Mach-Zehnder interferometer mesh,providing high complexity and resilience to computational attacks.We experimentally demonstrate encrypted image transmission over 40 km of optical fiber with high decryption fidelity and achieve a 10 Gbit/s optical encryption rate using a lithium niobate photonic chip.This represents the first implementation of public-key encryption at the physical optical layer.The approach offers key advantages in security,cost,energy efficiency,and compatibility with commercial optical communication systems.By integrating public-key encryption into photonic hardware,this work opens a new direction for secure and high-speed optical communications in next-generation networks.
基金supported by the National Natural Science Foundation of China(62376106)The Science and Technology Development Plan of Jilin Province(20250102212JC).
文摘Driven by advancements in mobile internet technology,images have become a crucial data medium.Ensuring the security of image information during transmission has thus emerged as an urgent challenge.This study proposes a novel image encryption algorithm specifically designed for grayscale image security.This research introduces a new Cantor diagonal matrix permutation method.The proposed permutation method uses row and column index sequences to control the Cantor diagonal matrix,where the row and column index sequences are generated by a spatiotemporal chaotic system named coupled map lattice(CML).The high initial value sensitivity of the CML system makes the permutation method highly sensitive and secure.Additionally,leveraging fractal theory,this study introduces a chaotic fractal matrix and applies this matrix in the diffusion process.This chaotic fractal matrix exhibits selfsimilarity and irregularity.Using the Cantor diagonal matrix and chaotic fractal matrix,this paper introduces a fast image encryption algorithm involving two diffusion steps and one permutation step.Moreover,the algorithm achieves robust security with only a single encryption round,ensuring high operational efficiency.Experimental results show that the proposed algorithm features an expansive key space,robust security,high sensitivity,high efficiency,and superior statistical properties for the ciphered images.Thus,the proposed algorithm not only provides a practical solution for secure image transmission but also bridges fractal theory with image encryption techniques,thereby opening new research avenues in chaotic cryptography and advancing the development of information security technology.
基金supported in part by the National Natural Science Foundation of China under Grant 62262073in part by the Yunnan Provincial Ten Thousand People Program for Young Top Talents under Grant YNWR-QNBJ-2019-237in part by the Yunnan Provincial Major Science and Technology Special Program under Grant 202402AD080002.
文摘In the age of big data,ensuring data privacy while enabling efficient encrypted data retrieval has become a critical challenge.Traditional searchable encryption schemes face difficulties in handling complex semantic queries.Additionally,they typically rely on honest but curious cloud servers,which introduces the risk of repudiation.Furthermore,the combined operations of search and verification increase system load,thereby reducing performance.Traditional verification mechanisms,which rely on complex hash constructions,suffer from low verification efficiency.To address these challenges,this paper proposes a blockchain-based contextual semantic-aware ciphertext retrieval scheme with efficient verification.Building on existing single and multi-keyword search methods,the scheme uses vector models to semantically train the dataset,enabling it to retain semantic information and achieve context-aware encrypted retrieval,significantly improving search accuracy.Additionally,a blockchain-based updatable master-slave chain storage model is designed,where the master chain stores encrypted keyword indexes and the slave chain stores verification information generated by zero-knowledge proofs,thus balancing system load while improving search and verification efficiency.Finally,an improved non-interactive zero-knowledge proof mechanism is introduced,reducing the computational complexity of verification and ensuring efficient validation of search results.Experimental results demonstrate that the proposed scheme offers stronger security,balanced overhead,and higher search verification efficiency.
基金Supported by the National Natural Science Foundation of China(60603010,60970120)~~
文摘Tag key encapsulation mechanism （Tag-KEM）/data encapsulation mechanism （DEM） is a hybrid framework proposed in 2005. Tag-t（EM is one of its parts by using public-key encryption （PKE） technique to encapsulate a symmetric key. In hybrid encryptions, the long-raessage PKE is not desired due to its slow operation. A general method is presented for constructing Tag-KEM schemes with short-message PKEs. The chosen ciphertext security is proved in the random oracle model. In the method, the treatment of the tag part brings no additional ciphertext redundancy. Among all the methods for constructing Tag-KEM, the method is the first one without any validity checking on the tag part, thus showing that the Tag-KEM/DEM framework is superior to KEM＋DEM one.
文摘The concept of sharing of personal health data over cloud storage in a healthcare-cyber physical system has become popular in recent times as it improves access quality.The privacy of health data can only be preserved by keeping it in an encrypted form,but it affects usability and flexibility in terms of effective search.Attribute-based searchable encryption(ABSE)has proven its worth by providing fine-grained searching capabilities in the shared cloud storage.However,it is not practical to apply this scheme to the devices with limited resources and storage capacity because a typical ABSE involves serious computations.In a healthcare cloud-based cyber-physical system(CCPS),the data is often collected by resource-constraint devices;therefore,here also,we cannot directly apply ABSE schemes.In the proposed work,the inherent computational cost of the ABSE scheme is managed by executing the computationally intensive tasks of a typical ABSE scheme on the blockchain network.Thus,it makes the proposed scheme suitable for online storage and retrieval of personal health data in a typical CCPS.With the assistance of blockchain technology,the proposed scheme offers two main benefits.First,it is free from a trusted authority,which makes it genuinely decentralized and free from a single point of failure.Second,it is computationally efficient because the computational load is now distributed among the consensus nodes in the blockchain network.Specifically,the task of initializing the system,which is considered the most computationally intensive,and the task of partial search token generation,which is considered as the most frequent operation,is now the responsibility of the consensus nodes.This eliminates the need of the trusted authority and reduces the burden of data users,respectively.Further,in comparison to existing decentralized fine-grained searchable encryption schemes,the proposed scheme has achieved a significant reduction in storage and computational cost for the secret key associated with users.It has been verified both theoretically and practically in the performance analysis section.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61004078 and 60971022)the Natural Science Foundation of Shandong Province, China (Grant Nos. ZR2009GQ009 and ZR2009GM005)+1 种基金the China Postdoctoral Science Foundation (Grant No. 20100481293)the Special Funds for Postdoctoral Innovative Projects of Shandong Province, China (Grant No. 201003037)
文摘We propose a new image encryption algorithm on the basis of the fractional-order hyperchaotic Lorenz system. While in the process of generating a key stream, the system parameters and the derivative order are embedded in the proposed algorithm to enhance the security. Such an algorithm is detailed in terms of security analyses, including correlation analysis, information entropy analysis, run statistic analysis, mean-variance gray value analysis, and key sensitivity analysis. The experimental results demonstrate that the proposed image encryption scheme has the advantages of large key space and high security for practical image encryption.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61173183,61672124,61370145,and 11501064)the Password Theory Project of the 13th Five-Year Plan National Cryptography Development Fund,China(Grant No.MMJJ20170203)+1 种基金the China Postdoctoral Science Foundation(Grant No.2016M590850)the Scientific and Technological Research Program of Chongqing Municipal Education Commission,China(Grant No.KJ1500605)
文摘Based on the Fisher–Yatess scrambling and DNA coding technology, a chaotical image encryption method is proposed. First, the SHA-3 algorithm is used to calculate the hash value of the initial password, which is used as the initial value of the chaotic system. Second, the chaotic sequence and Fisher–Yatess scrambling are used to scramble the plaintext,and a sorting scrambling algorithm is used for secondary scrambling. Then, the chaotic sequence and DNA coding rules are used to change the plaintext pixel values, which makes the ciphertext more random and resistant to attacks, and thus ensures that the encrypted ciphertext is more secure. Finally, we add plaintext statistics for pixel-level diffusion to ensure plaintext sensitivity. The experimental results and security analysis show that the new algorithm has a good encryption effect and speed, and can also resist common attacks.
基金the National Natural Science Foundation of China，the State Key Program of National Natural Science of China，the Major Research Plan of the National Natural Science Foundation of China，Major State Basic Research Development Program of China (973 Program)，the Hubei Natural Science Foundation of China
文摘The emergence of quantum computer will threaten the security of existing public-key cryptosystems, including the Diffie Hellman key exchange protocol, encryption scheme and etc, and it makes the study of resistant quantum cryptography very urgent. This motivate us to design a new key exchange protocol and eneryption scheme in this paper. Firstly, some acknowledged mathematical problems was introduced, such as ergodic matrix problem and tensor decomposition problem, the two problems have been proved to NPC hard. From the computational complexity prospective, NPC problems have been considered that there is no polynomial-time quantum algorithm to solve them. From the algebraic structures prospective, non-commutative cryptography has been considered to resist quantum. The matrix and tensor operator we adopted also satisfied with this non-commutative algebraic structures, so they can be used as candidate problems for resisting quantum from perspective of computational complexity theory and algebraic structures. Secondly, a new problem was constructed based on the introduced problems in this paper, then a key exchange protocol and a public key encryption scheme were proposed based on it. Finally the security analysis, efficiency, recommended parameters, performance evaluation and etc. were also been given. The two schemes has the following characteristics, provable security,security bits can be scalable, to achieve high efficiency, quantum resistance, and etc.
文摘Attribute-based encryption is drawing more attention with its inherent attractive properties which are potential to be widely used in the newly developing cloud computing. However, one of the main obstacles for its application is how to revoke the attributes of the users, though some ABE schemes have realized revocation, they mostly focused on the user revocation that revokes the user＇s whole attributes, or attribute revocation under the indirect revocation model such that all the users＇ private keys will be affected by the revocation. In this paper, we define the model of CP-ABE supporting the attribute revocation under the direct revocation model, in which the revocation list is embed in the ciphertext and none of the users＇ private keys will be affected by the revocation process. Then we propose a generic construction, and prove its security with the decision q-BDHE assumption.
