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.展开更多
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.展开更多
Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is ...Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.展开更多
As the use of cloud storage for various services increases,the amount of private personal information along with data stored in the cloud storage is also increasing.To remotely use the data stored on the cloud storage...As the use of cloud storage for various services increases,the amount of private personal information along with data stored in the cloud storage is also increasing.To remotely use the data stored on the cloud storage,the data to be stored needs to be encrypted for this reason.Since“searchable encryption”is enable to search on the encrypted data without any decryption,it is one of convenient solutions for secure data management.A public key encryption with keyword search(for short,PEKS)is one of searchable encryptions.Abdalla et al.firstly defined IND-CCA security for PEKS to enhance it’s security and proposed consistent IND-CCA secure PEKS based on the“robust”ANO-CCA secure identity-based encryption(IBE).In this paper,we propose two generic constructions of consistent IND-CCA secure PEKS combining(1)a hierarchical identity based encryption(for short,HIBE)and a signature scheme or(2)a HIBE,an encapsulation,and a message authentication code(for short,MAC)scheme.Our generic constructions identify that HIBE requires the security of a signature or a MAC as well as the weaker“ANO-CPA security(resp.,IND-CPA security)”of HIBE than“ANOCCA security(resp.,IND-CCA security)”of IBE required in for achieving IND-CCA secure(resp.,consistent)PEKS.Finally,we prove that our generic constructions satisfy IND-CCA security and consistency under the security models.展开更多
Military image encryption plays a vital role in ensuring the secure transmission of sensitive visual information from unauthorized access.This paper proposes a new Tri-independent keying method for encrypting military...Military image encryption plays a vital role in ensuring the secure transmission of sensitive visual information from unauthorized access.This paper proposes a new Tri-independent keying method for encrypting military images.The proposed encryption method is based on multilevel security stages of pixel-level scrambling,bitlevel manipulation,and block-level shuffling operations.For having a vast key space,the input password is hashed by the Secure Hash Algorithm 256-bit(SHA-256)for generating independently deterministic keys used in the multilevel stages.A piecewise pixel-level scrambling function is introduced to perform a dual flipping process controlled with an adaptive key for obscuring the spatial relationships between the adjacent pixels.Adynamicmasking scheme is presented for conducting a bit-level manipulation based on distinct keys that change over image regions,providing completely different encryption results on identical regions.To handle the global correlation between large-scale patterns,a chaotic index-map system is employed for shuffling image regions randomly across the image domain based on a logistic map seeded with a private key.Experimental results on a dataset of military images show the effectiveness of the proposed encryption method in producing excellent quantitative and qualitative results.The proposed method obtains uniform histogram distributions,high entropy values around the ideal(≈8 bits),Number of Pixel Change Rate(NPCR)values above 99.5%,and low Peak Signal-to-Noise Ratio(PSNR)over all encrypted images.This validates the robustness of the proposed method against cryptanalytic attacks,verifying its ability to serve as a practical basis for secure image transmission in defense systems.展开更多
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.展开更多
With the rapid development of intelligent electronic and military equipment,multifunctional flexible materials that integrat electromagnetic interference(EMI)shielding,temperature sensing,and information encryption ar...With the rapid development of intelligent electronic and military equipment,multifunctional flexible materials that integrat electromagnetic interference(EMI)shielding,temperature sensing,and information encryption are urgently required.This study presents a bio-inspired hierarchical composite foam fabricated using supercritical nitrogen foaming technology.This material exhibits a honeycomb structure,with pore cell sizes controllable within a range of 30–92μm by regulating the filler.The carbon fiber felt(CFf)provides efficient reflection of electromagnetic waves,while the chloroprene rubber/carbon fiber/carbon black foam facilitates both wave absorption and temperature monitoring through its optimized conductive network.This synergistic mechanism results in an EMI shielding effectiveness(SE)of 60.06 d B with excellent temperature sensing performance(The temperature coefficient of resistance(TCR)is-2.642%/℃)in the 24–70℃ range.Notably,the material has a thermal conductivity of up to 0.159 W/(m·K),and the bio-inspired layered design enables information encryption,demonstrating the material's potential for secure communication applications.The foam also has tensile properties of up to 5.13 MPa and a tear strength of 33.02 N/mm.This biomimetic design overcomes the traditional limitations of flexible materials and provides a transformative solution for next-generation applications such as flexible electronics,aerospace systems and military equipment,which urgently need integrated electromagnetic protection,thermal management and information security.展开更多
The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently...The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently,the protection of sensitive data has become increasingly critical.Regardless of the complexity of the encryption algorithm used,a robust and highly secure encryption key is essential,with randomness and key space being crucial factors.This paper proposes a new Robust Deoxyribonucleic Acid(RDNA)nucleotide-based encryption method.The RDNA encryption method leverages the unique properties of DNA nucleotides,including their inherent randomness and extensive key space,to generate a highly secure encryption key.By employing transposition and substitution operations,the RDNA method ensures significant diffusion and confusion in the encrypted images.Additionally,it utilises a pseudorandom generation technique based on the random sequence of nucleotides in the DNA secret key.The performance of the RDNA encryption method is evaluated through various statistical and visual tests,and compared against established encryption methods such as 3DES,AES,and a DNA-based method.Experimental results demonstrate that the RDNA encryption method outperforms its rivals in the literature,and achieves superior performance in terms of information entropy,avalanche effect,encryption execution time,and correlation reduction,while maintaining competitive values for NMAE,PSNR,NPCR,and UACI.The high degree of randomness and sensitivity to key changes inherent in the RDNA method offers enhanced security,making it highly resistant to brute force and differential attacks.展开更多
Elliptic curve(EC)based cryptosystems gained more attention due to enhanced security than the existing public key cryptosystems.A substitution box(S-box)plays a vital role in securing modern symmetric key cryptosystem...Elliptic curve(EC)based cryptosystems gained more attention due to enhanced security than the existing public key cryptosystems.A substitution box(S-box)plays a vital role in securing modern symmetric key cryptosystems.However,the recently developed EC based algorithms usually trade off between computational efficiency and security,necessitating the design of a new algorithm with the desired cryptographic strength.To address these shortcomings,this paper proposes a new scheme based onMordell elliptic curve(MEC)over the complex field for generating distinct,dynamic,and highly uncorrelated S-boxes.Furthermore,we count the exact number of the obtained S-boxes,and demonstrate that the permuted version of the presented S-box is statistically optimal.The nonsingularity of the presented algorithm and the injectivity of the resultant output are explored.Rigorous theoretical analysis and experimental results demonstrate that the proposedmethod is highly effective in generating a large number of dynamic S-boxes with adequate cryptographic properties,surpassing current state-of-the-art S-box generation algorithms in terms of security.Apart fromthis,the generated S-box is benchmarked using side-channel attacks,and its performance is compared with highly nonlinear S-boxes,demonstrating comparable results.In addition,we present an application of our proposed S-box generator by incorporating it into an image encryption technique.The encrypted and decrypted images are tested by employing extensive standard security metrics,including the Number of Pixel Change Rate,the Unified Average Changing Intensity,information entropy,correlation coefficient,and histogram analysis.Moreover,the analysis is extended beyond conventional metrics to validate the new method using advanced tests,such as the NIST statistical test suite,robustness analysis,and noise and cropping attacks.Experimental outcomes show that the presented algorithm strengthens the existing encryption scheme against various well-known cryptographic attacks.展开更多
This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals noth...This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.展开更多
Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the relat...Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the related master secret keyis widely utilized to construct cryp-paper, we introduce the concept ofand the identity secret key can beupdated securely. Then, we instantiate this primitive based on lattices in the standard model. Moreover, we introduce anapplication of this new primitive by giving a generic construction of leakage-resilient public-key encryption schemes withanonymity. This construction can be considered as the integration of the bounded-retrieval model and the continual leakagemodel. Compared with the existing leakage-resilient schemes, our construction not only is more efficient but also can resistmuch more key leakage.展开更多
Public-key cryptosystems for quantum messages are considered from two aspects:public-key encryption and public-key authentication.Firstly,we propose a general construction of quantum public-key encryption scheme,and t...Public-key cryptosystems for quantum messages are considered from two aspects:public-key encryption and public-key authentication.Firstly,we propose a general construction of quantum public-key encryption scheme,and then construct an informationtheoretic secure instance.Then,we propose a quantum public-key authentication scheme,which can protect the integrity of quantum messages.This scheme can both encrypt and authenticate quantum messages.It is information-theoretic secure with regard to encryption,and the success probability of tampering decreases exponentially with the security parameter with regard to authentication.Compared with classical public-key cryptosystems,one private-key in our schemes corresponds to an exponential number of public-keys,and every quantum public-key used by the sender is an unknown quantum state to the sender.展开更多
This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of ...This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption, the third version of knowledge of exponent assumption （KEA3）. Under assumptions of KEA3, a decision Diffie-Hellman （DDH） and a variant of target collision resistance （TCRv）, the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack （IND-CCA2）. This scheme is as efficient as Damgard ElGamal （DEG） scheme when it makes use of a well-known algorithm for product of exponentiations. The DEG scheme is recently proved IND-CCA1 secure by Bellare and Palacio in ASIACRYPT 2004 under another strong assumption. In addition to our IND-CCA2 secured scheme, we also believe that the security proof procedure itself provides a well insight for ElGamal-based encryption schemes which are secure in real world.展开更多
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.展开更多
Data security is crucial for improving the confidentiality,integrity,and authenticity of the image content.Maintaining these security factors poses significant challenges,particularly in healthcare,business,and social...Data security is crucial for improving the confidentiality,integrity,and authenticity of the image content.Maintaining these security factors poses significant challenges,particularly in healthcare,business,and social media sectors,where information security and personal privacy are paramount.The cryptography concept introduces a solution to these challenges.This paper proposes an innovative hybrid image encryption algorithm capable of encrypting several types of images.The technique merges the Tiny Encryption Algorithm(TEA)and Rivest-Shamir-Adleman(RSA)algorithms called(TEA-RSA).The performance of this algorithm is promising in terms of cost and complexity,an encryption time which is below 10ms was recorded.It is implied by correlation coefficient analysis that after encryption there is a notable decrease in pixel correlation,therefore making it effective at disguising pixel relationships via obfuscation.Moreover,our technique achieved the highest Normalized Pixel Cross-Correlation(NPCC),Number of Pixel Change Rate(NPCR)value over 99%consistent,and a Unified Average Changing Intensity(UACI)value which stands at around 33.86 thereby making it insensitive to statistical attacks hence leading to massive alteration of pixel values and intensities.These make clear the resistance of this process to any sort of hacking attempt whatsoever that might want unauthorized access into its domain.It is important to note that the integrity of images is well preserved throughout encryption as well as decryption stages in line with these low decryption times are clear indications.These results collectively indicate that the algorithm is effective in ensuring secure and efficient image encryption while maintaining the overall integrity and quality of the encrypted images.The proposed hybrid approach has been investigated against cryptoanalysis such as Cyphertext-only attacks,Known-plaintext attacks,Chosen-plaintext attacks,and Chosen-ciphertext attacks.Moreover,the proposed approach explains a good achievement against cropping and differential attacks.展开更多
This paper introduces a novel lightweight colour image encryption algorithm,specifically designed for resource-constrained environments such as Internet of Things(IoT)devices.As IoT systems become increasingly prevale...This paper introduces a novel lightweight colour image encryption algorithm,specifically designed for resource-constrained environments such as Internet of Things(IoT)devices.As IoT systems become increasingly prevalent,secure and efficient data transmission becomes crucial.The proposed algorithm addresses this need by offering a robust yet resource-efficient solution for image encryption.Traditional image encryption relies on confusion and diffusion steps.These stages are generally implemented linearly,but this work introduces a new RSP(Random Strip Peeling)algorithm for the confusion step,which disrupts linearity in the lightweight category by using two different sequences generated by the 1D Tent Map with varying initial conditions.The diffusion stage then employs an XOR matrix generated by the Logistic Map.Different evaluation metrics,such as entropy analysis,key sensitivity,statistical and differential attacks resistance,and robustness analysis demonstrate the proposed algorithm's lightweight,robust,and efficient.The proposed encryption scheme achieved average metric values of 99.6056 for NPCR,33.4397 for UACI,and 7.9914 for information entropy in the SIPI image dataset.It also exhibits a time complexity of O(2×M×N)for an image of size M×N.展开更多
In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems ...In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems proliferate,cryptographic approaches that provide robust security while minimizing computing overhead,energy consumption,and memory usage are becoming increasingly essential.This study examines lightweight encryption techniques utilizing chaotic maps to ensure secure data transmission.Two algorithms are proposed,both employing the Logistic map;the first approach utilizes two logistic chaotic maps,while the second algorithm employs a single logistic chaotic map.Algorithm 1,including a two-stage mechanism that uses chaotic maps for both transposition and key generation,is distinguished by its robustness,guaranteeing a secure encryption method.The second techniqueutilized a single logistic chaoticmapeliminating the secondchaoticmapdecreases computing complexity while maintaining security.The efficacy of both algorithms was evaluated by subjecting them to NIST randomness tests following testing on text files of varying sizes.The findings demonstrate that the double chaotic map method regularly achieves elevated unpredictability and resilience.Conversely,the singular chaotic algorithm markedly lowers the duration necessary for encryption and decryption.These data suggest that while both algorithms are effective,their choice may be contingent upon specific security and processing speed requirements in practical applications.展开更多
As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be t...As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.展开更多
With the rapid development of information technology,data security issues have received increasing attention.Data encryption and decryption technology,as a key means of ensuring data security,plays an important role i...With the rapid development of information technology,data security issues have received increasing attention.Data encryption and decryption technology,as a key means of ensuring data security,plays an important role in multiple fields such as communication security,data storage,and data recovery.This article explores the fundamental principles and interrelationships of data encryption and decryption,examines the strengths,weaknesses,and applicability of symmetric,asymmetric,and hybrid encryption algorithms,and introduces key application scenarios for data encryption and decryption technology.It examines the challenges and corresponding countermeasures related to encryption algorithm security,key management,and encryption-decryption performance.Finally,it analyzes the development trends and future prospects of data encryption and decryption technology.This article provides a systematic understanding of data encryption and decryption techniques,which has good reference value for software designers.展开更多
Data compression plays a vital role in datamanagement and information theory by reducing redundancy.However,it lacks built-in security features such as secret keys or password-based access control,leaving sensitive da...Data compression plays a vital role in datamanagement and information theory by reducing redundancy.However,it lacks built-in security features such as secret keys or password-based access control,leaving sensitive data vulnerable to unauthorized access and misuse.With the exponential growth of digital data,robust security measures are essential.Data encryption,a widely used approach,ensures data confidentiality by making it unreadable and unalterable through secret key control.Despite their individual benefits,both require significant computational resources.Additionally,performing them separately for the same data increases complexity and processing time.Recognizing the need for integrated approaches that balance compression ratios and security levels,this research proposes an integrated data compression and encryption algorithm,named IDCE,for enhanced security and efficiency.Thealgorithmoperates on 128-bit block sizes and a 256-bit secret key length.It combines Huffman coding for compression and a Tent map for encryption.Additionally,an iterative Arnold cat map further enhances cryptographic confusion properties.Experimental analysis validates the effectiveness of the proposed algorithm,showcasing competitive performance in terms of compression ratio,security,and overall efficiency when compared to prior algorithms in the field.展开更多
基金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.
基金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 973 State Key Project of China (No.G1999035803)the National Natural Science Foundation of China (No.69931010).
文摘Investigated the properties of LUCas sequence(LUC), the paper proposed a new variant of (probabilistic) public-key encryption scheme. Security analysis of the proposed encryption schemes shows that its one-wayness is equivalent to partial LUC discrete logarithm problem in ZN, and for the proposed probabilistic encryption scheme, its semantic security is equivalent to decisional LUC Diffie-Hellman problem in ZN. At last, the efficiency of the proposed schemes is briefly analyzed.
文摘As the use of cloud storage for various services increases,the amount of private personal information along with data stored in the cloud storage is also increasing.To remotely use the data stored on the cloud storage,the data to be stored needs to be encrypted for this reason.Since“searchable encryption”is enable to search on the encrypted data without any decryption,it is one of convenient solutions for secure data management.A public key encryption with keyword search(for short,PEKS)is one of searchable encryptions.Abdalla et al.firstly defined IND-CCA security for PEKS to enhance it’s security and proposed consistent IND-CCA secure PEKS based on the“robust”ANO-CCA secure identity-based encryption(IBE).In this paper,we propose two generic constructions of consistent IND-CCA secure PEKS combining(1)a hierarchical identity based encryption(for short,HIBE)and a signature scheme or(2)a HIBE,an encapsulation,and a message authentication code(for short,MAC)scheme.Our generic constructions identify that HIBE requires the security of a signature or a MAC as well as the weaker“ANO-CPA security(resp.,IND-CPA security)”of HIBE than“ANOCCA security(resp.,IND-CCA security)”of IBE required in for achieving IND-CCA secure(resp.,consistent)PEKS.Finally,we prove that our generic constructions satisfy IND-CCA security and consistency under the security models.
文摘Military image encryption plays a vital role in ensuring the secure transmission of sensitive visual information from unauthorized access.This paper proposes a new Tri-independent keying method for encrypting military images.The proposed encryption method is based on multilevel security stages of pixel-level scrambling,bitlevel manipulation,and block-level shuffling operations.For having a vast key space,the input password is hashed by the Secure Hash Algorithm 256-bit(SHA-256)for generating independently deterministic keys used in the multilevel stages.A piecewise pixel-level scrambling function is introduced to perform a dual flipping process controlled with an adaptive key for obscuring the spatial relationships between the adjacent pixels.Adynamicmasking scheme is presented for conducting a bit-level manipulation based on distinct keys that change over image regions,providing completely different encryption results on identical regions.To handle the global correlation between large-scale patterns,a chaotic index-map system is employed for shuffling image regions randomly across the image domain based on a logistic map seeded with a private key.Experimental results on a dataset of military images show the effectiveness of the proposed encryption method in producing excellent quantitative and qualitative results.The proposed method obtains uniform histogram distributions,high entropy values around the ideal(≈8 bits),Number of Pixel Change Rate(NPCR)values above 99.5%,and low Peak Signal-to-Noise Ratio(PSNR)over all encrypted images.This validates the robustness of the proposed method against cryptanalytic attacks,verifying its ability to serve as a practical basis for secure image transmission in defense systems.
基金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.
基金financially supported by the Natural Science Foundation of Shandong Province(No.ZR2024QE446)。
文摘With the rapid development of intelligent electronic and military equipment,multifunctional flexible materials that integrat electromagnetic interference(EMI)shielding,temperature sensing,and information encryption are urgently required.This study presents a bio-inspired hierarchical composite foam fabricated using supercritical nitrogen foaming technology.This material exhibits a honeycomb structure,with pore cell sizes controllable within a range of 30–92μm by regulating the filler.The carbon fiber felt(CFf)provides efficient reflection of electromagnetic waves,while the chloroprene rubber/carbon fiber/carbon black foam facilitates both wave absorption and temperature monitoring through its optimized conductive network.This synergistic mechanism results in an EMI shielding effectiveness(SE)of 60.06 d B with excellent temperature sensing performance(The temperature coefficient of resistance(TCR)is-2.642%/℃)in the 24–70℃ range.Notably,the material has a thermal conductivity of up to 0.159 W/(m·K),and the bio-inspired layered design enables information encryption,demonstrating the material's potential for secure communication applications.The foam also has tensile properties of up to 5.13 MPa and a tear strength of 33.02 N/mm.This biomimetic design overcomes the traditional limitations of flexible materials and provides a transformative solution for next-generation applications such as flexible electronics,aerospace systems and military equipment,which urgently need integrated electromagnetic protection,thermal management and information security.
文摘The advent of 5G technology has significantly enhanced the transmission of images over networks,expanding data accessibility and exposure across various applications in digital technology and social media.Consequently,the protection of sensitive data has become increasingly critical.Regardless of the complexity of the encryption algorithm used,a robust and highly secure encryption key is essential,with randomness and key space being crucial factors.This paper proposes a new Robust Deoxyribonucleic Acid(RDNA)nucleotide-based encryption method.The RDNA encryption method leverages the unique properties of DNA nucleotides,including their inherent randomness and extensive key space,to generate a highly secure encryption key.By employing transposition and substitution operations,the RDNA method ensures significant diffusion and confusion in the encrypted images.Additionally,it utilises a pseudorandom generation technique based on the random sequence of nucleotides in the DNA secret key.The performance of the RDNA encryption method is evaluated through various statistical and visual tests,and compared against established encryption methods such as 3DES,AES,and a DNA-based method.Experimental results demonstrate that the RDNA encryption method outperforms its rivals in the literature,and achieves superior performance in terms of information entropy,avalanche effect,encryption execution time,and correlation reduction,while maintaining competitive values for NMAE,PSNR,NPCR,and UACI.The high degree of randomness and sensitivity to key changes inherent in the RDNA method offers enhanced security,making it highly resistant to brute force and differential attacks.
文摘Elliptic curve(EC)based cryptosystems gained more attention due to enhanced security than the existing public key cryptosystems.A substitution box(S-box)plays a vital role in securing modern symmetric key cryptosystems.However,the recently developed EC based algorithms usually trade off between computational efficiency and security,necessitating the design of a new algorithm with the desired cryptographic strength.To address these shortcomings,this paper proposes a new scheme based onMordell elliptic curve(MEC)over the complex field for generating distinct,dynamic,and highly uncorrelated S-boxes.Furthermore,we count the exact number of the obtained S-boxes,and demonstrate that the permuted version of the presented S-box is statistically optimal.The nonsingularity of the presented algorithm and the injectivity of the resultant output are explored.Rigorous theoretical analysis and experimental results demonstrate that the proposedmethod is highly effective in generating a large number of dynamic S-boxes with adequate cryptographic properties,surpassing current state-of-the-art S-box generation algorithms in terms of security.Apart fromthis,the generated S-box is benchmarked using side-channel attacks,and its performance is compared with highly nonlinear S-boxes,demonstrating comparable results.In addition,we present an application of our proposed S-box generator by incorporating it into an image encryption technique.The encrypted and decrypted images are tested by employing extensive standard security metrics,including the Number of Pixel Change Rate,the Unified Average Changing Intensity,information entropy,correlation coefficient,and histogram analysis.Moreover,the analysis is extended beyond conventional metrics to validate the new method using advanced tests,such as the NIST statistical test suite,robustness analysis,and noise and cropping attacks.Experimental outcomes show that the presented algorithm strengthens the existing encryption scheme against various well-known cryptographic attacks.
基金National Key Research and Development Program of China(2021YFB3101402)National Natural Science Foundation of China(62202294)。
文摘This study constructs a function-private inner-product predicate encryption(FP-IPPE)and achieves standard enhanced function privacy.The enhanced function privacy guarantees that a predicate secret key skf reveals nothing about the predicate f,as long as f is drawn from an evasive distribution with sufficient entropy.The proposed scheme extends the group-based public-key function-private predicate encryption(FP-PE)for“small superset predicates”proposed by Bartusek et al.(Asiacrypt 19),to the setting of inner-product predicates.This is the first construction of public-key FP-PE with enhanced function privacy security beyond the equality predicates,which is previously proposed by Boneh et al.(CRYPTO 13).The proposed construction relies on bilinear groups,and the security is proved in the generic bilinear group model.
基金This work was supported by the National Key Research and Development Program of China under Grant No. 2017YFt30802000, the National Natural Science Foundation of China under Grant Nos. 61802241, 61772326, 61572303, 61872229, 61802242, and 61602290, the National Natural Science Foundation of China for International Young Scientists under Grant No. 61750110528, the National Cryp-tographv Development Fund during the 13th Five-Year Plan Period of China under Grant Nos. MMJJ20170216 and MMJJ20180217, the Foundation of State Key Laboratory of Information Security of China under Grant No. 2017-MS-03, and the Fundamental Re- search Funds for the Central Universities of China under Grant Nos. GK201603084, GK201702004, GK201603092, GK201603093, and GK201703062.
文摘Identity-based hash proof system is a basic and important primitive. Ittographic schemes and protocols that are secure against key-leakage attacks. In thisupdatable identity-based hash proof system, in which the related master secret keyis widely utilized to construct cryp-paper, we introduce the concept ofand the identity secret key can beupdated securely. Then, we instantiate this primitive based on lattices in the standard model. Moreover, we introduce anapplication of this new primitive by giving a generic construction of leakage-resilient public-key encryption schemes withanonymity. This construction can be considered as the integration of the bounded-retrieval model and the continual leakagemodel. Compared with the existing leakage-resilient schemes, our construction not only is more efficient but also can resistmuch more key leakage.
基金supported by the National Natural Science Foundation of China (Grant No. 61173157)Strategy Pilot Project of Chinese Academy of Sciences (Grant No. Sub-project XD06010702)IIE’s Cryptography Research Project
文摘Public-key cryptosystems for quantum messages are considered from two aspects:public-key encryption and public-key authentication.Firstly,we propose a general construction of quantum public-key encryption scheme,and then construct an informationtheoretic secure instance.Then,we propose a quantum public-key authentication scheme,which can protect the integrity of quantum messages.This scheme can both encrypt and authenticate quantum messages.It is information-theoretic secure with regard to encryption,and the success probability of tampering decreases exponentially with the security parameter with regard to authentication.Compared with classical public-key cryptosystems,one private-key in our schemes corresponds to an exponential number of public-keys,and every quantum public-key used by the sender is an unknown quantum state to the sender.
基金Supported by the National Grand Fundamental Research 973 Program of Chine under Grant No. 1999035803 and the National Natural Science Foundation of China under Grant No. 60473027. The authors would like to thank Dr. Qian-Hong Wu from Wollongong Univ. and Dr. Zheng-Tao Jiang from Xidian Univ. for their fruitful discussions. We also take the opportunity to appreciate valuable comments from editors and reviewers.
文摘This paper proposes a new public-key encryption scheme which removes one element from the public-key tuple of the original Cramer-Shoup scheme. As a result, a ciphertext is not a quadruple but a triple at the cost of a strong assumption, the third version of knowledge of exponent assumption （KEA3）. Under assumptions of KEA3, a decision Diffie-Hellman （DDH） and a variant of target collision resistance （TCRv）, the new scheme is proved secure against indistinguishable adaptive chosen ciphertext attack （IND-CCA2）. This scheme is as efficient as Damgard ElGamal （DEG） scheme when it makes use of a well-known algorithm for product of exponentiations. The DEG scheme is recently proved IND-CCA1 secure by Bellare and Palacio in ASIACRYPT 2004 under another strong assumption. In addition to our IND-CCA2 secured scheme, we also believe that the security proof procedure itself provides a well insight for ElGamal-based encryption schemes which are secure in real world.
文摘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.
文摘Data security is crucial for improving the confidentiality,integrity,and authenticity of the image content.Maintaining these security factors poses significant challenges,particularly in healthcare,business,and social media sectors,where information security and personal privacy are paramount.The cryptography concept introduces a solution to these challenges.This paper proposes an innovative hybrid image encryption algorithm capable of encrypting several types of images.The technique merges the Tiny Encryption Algorithm(TEA)and Rivest-Shamir-Adleman(RSA)algorithms called(TEA-RSA).The performance of this algorithm is promising in terms of cost and complexity,an encryption time which is below 10ms was recorded.It is implied by correlation coefficient analysis that after encryption there is a notable decrease in pixel correlation,therefore making it effective at disguising pixel relationships via obfuscation.Moreover,our technique achieved the highest Normalized Pixel Cross-Correlation(NPCC),Number of Pixel Change Rate(NPCR)value over 99%consistent,and a Unified Average Changing Intensity(UACI)value which stands at around 33.86 thereby making it insensitive to statistical attacks hence leading to massive alteration of pixel values and intensities.These make clear the resistance of this process to any sort of hacking attempt whatsoever that might want unauthorized access into its domain.It is important to note that the integrity of images is well preserved throughout encryption as well as decryption stages in line with these low decryption times are clear indications.These results collectively indicate that the algorithm is effective in ensuring secure and efficient image encryption while maintaining the overall integrity and quality of the encrypted images.The proposed hybrid approach has been investigated against cryptoanalysis such as Cyphertext-only attacks,Known-plaintext attacks,Chosen-plaintext attacks,and Chosen-ciphertext attacks.Moreover,the proposed approach explains a good achievement against cropping and differential attacks.
基金Türkiye Bilimsel ve Teknolojik Arastırma Kurumu。
文摘This paper introduces a novel lightweight colour image encryption algorithm,specifically designed for resource-constrained environments such as Internet of Things(IoT)devices.As IoT systems become increasingly prevalent,secure and efficient data transmission becomes crucial.The proposed algorithm addresses this need by offering a robust yet resource-efficient solution for image encryption.Traditional image encryption relies on confusion and diffusion steps.These stages are generally implemented linearly,but this work introduces a new RSP(Random Strip Peeling)algorithm for the confusion step,which disrupts linearity in the lightweight category by using two different sequences generated by the 1D Tent Map with varying initial conditions.The diffusion stage then employs an XOR matrix generated by the Logistic Map.Different evaluation metrics,such as entropy analysis,key sensitivity,statistical and differential attacks resistance,and robustness analysis demonstrate the proposed algorithm's lightweight,robust,and efficient.The proposed encryption scheme achieved average metric values of 99.6056 for NPCR,33.4397 for UACI,and 7.9914 for information entropy in the SIPI image dataset.It also exhibits a time complexity of O(2×M×N)for an image of size M×N.
文摘In secure communications,lightweight encryption has become crucial,particularly for resource-constrained applications such as embedded devices,wireless sensor networks,and the Internet of Things(IoT).As these systems proliferate,cryptographic approaches that provide robust security while minimizing computing overhead,energy consumption,and memory usage are becoming increasingly essential.This study examines lightweight encryption techniques utilizing chaotic maps to ensure secure data transmission.Two algorithms are proposed,both employing the Logistic map;the first approach utilizes two logistic chaotic maps,while the second algorithm employs a single logistic chaotic map.Algorithm 1,including a two-stage mechanism that uses chaotic maps for both transposition and key generation,is distinguished by its robustness,guaranteeing a secure encryption method.The second techniqueutilized a single logistic chaoticmapeliminating the secondchaoticmapdecreases computing complexity while maintaining security.The efficacy of both algorithms was evaluated by subjecting them to NIST randomness tests following testing on text files of varying sizes.The findings demonstrate that the double chaotic map method regularly achieves elevated unpredictability and resilience.Conversely,the singular chaotic algorithm markedly lowers the duration necessary for encryption and decryption.These data suggest that while both algorithms are effective,their choice may be contingent upon specific security and processing speed requirements in practical applications.
基金funded by National Science and Technology Council,Taiwan,grant numbers are 110-2401-H-002-094-MY2 and 112-2221-E-130-001.
文摘As data analysis often incurs significant communication and computational costs,these tasks are increasingly outsourced to cloud computing platforms.However,this introduces privacy concerns,as sensitive data must be transmitted to and processed by untrusted parties.To address this,fully homomorphic encryption(FHE)has emerged as a promising solution for privacy-preserving Machine-Learning-as-a-Service(MLaaS),enabling computation on encrypted data without revealing the plaintext.Nevertheless,FHE remains computationally expensive.As a result,approximate homomorphic encryption(AHE)schemes,such as CKKS,have attracted attention due to their efficiency.In our previous work,we proposed RP-OKC,a CKKS-based clustering scheme implemented via TenSEAL.However,errors inherent to CKKS operations—termed CKKS-errors—can affect the accuracy of the result after decryption.Since these errors can be mitigated through post-decryption rounding,we propose a data pre-scaling technique to increase the number of significant digits and reduce CKKS-errors.Furthermore,we introduce an Operation-Error-Estimation(OEE)table that quantifies upper-bound error estimates for various CKKS operations.This table enables error-aware decryption correction,ensuring alignment between encrypted and plaintext results.We validate our method on K-means clustering using the Kaggle Customer Segmentation dataset.Experimental results confirm that the proposed scheme enhances the accuracy and reliability of privacy-preserving data analysis in cloud environments.
文摘With the rapid development of information technology,data security issues have received increasing attention.Data encryption and decryption technology,as a key means of ensuring data security,plays an important role in multiple fields such as communication security,data storage,and data recovery.This article explores the fundamental principles and interrelationships of data encryption and decryption,examines the strengths,weaknesses,and applicability of symmetric,asymmetric,and hybrid encryption algorithms,and introduces key application scenarios for data encryption and decryption technology.It examines the challenges and corresponding countermeasures related to encryption algorithm security,key management,and encryption-decryption performance.Finally,it analyzes the development trends and future prospects of data encryption and decryption technology.This article provides a systematic understanding of data encryption and decryption techniques,which has good reference value for software designers.
基金the Deanship of Graduate Studies and Scientific Research at Qassim University for financial support(QU-APC-2025).
文摘Data compression plays a vital role in datamanagement and information theory by reducing redundancy.However,it lacks built-in security features such as secret keys or password-based access control,leaving sensitive data vulnerable to unauthorized access and misuse.With the exponential growth of digital data,robust security measures are essential.Data encryption,a widely used approach,ensures data confidentiality by making it unreadable and unalterable through secret key control.Despite their individual benefits,both require significant computational resources.Additionally,performing them separately for the same data increases complexity and processing time.Recognizing the need for integrated approaches that balance compression ratios and security levels,this research proposes an integrated data compression and encryption algorithm,named IDCE,for enhanced security and efficiency.Thealgorithmoperates on 128-bit block sizes and a 256-bit secret key length.It combines Huffman coding for compression and a Tent map for encryption.Additionally,an iterative Arnold cat map further enhances cryptographic confusion properties.Experimental analysis validates the effectiveness of the proposed algorithm,showcasing competitive performance in terms of compression ratio,security,and overall efficiency when compared to prior algorithms in the field.
