Cloud services,favored by many enterprises due to their high flexibility and easy operation,are widely used for data storage and processing.However,the high latency,together with transmission overheads of the cloud ar...Cloud services,favored by many enterprises due to their high flexibility and easy operation,are widely used for data storage and processing.However,the high latency,together with transmission overheads of the cloud architecture,makes it difficult to quickly respond to the demands of IoT applications and local computation.To make up for these deficiencies in the cloud,fog computing has emerged as a critical role in the IoT applications.It decentralizes the computing power to various lower nodes close to data sources,so as to achieve the goal of low latency and distributed processing.With the data being frequently exchanged and shared between multiple nodes,it becomes a challenge to authorize data securely and efficiently while protecting user privacy.To address this challenge,proxy re-encryption(PRE)schemes provide a feasible way allowing an intermediary proxy node to re-encrypt ciphertext designated for different authorized data requesters without compromising any plaintext information.Since the proxy is viewed as a semi-trusted party,it should be taken to prevent malicious behaviors and reduce the risk of data leakage when implementing PRE schemes.This paper proposes a new fog-assisted identity-based PRE scheme supporting anonymous key generation,equality test,and user revocation to fulfill various IoT application requirements.Specifically,in a traditional identity-based public key architecture,the key escrow problem and the necessity of a secure channel are major security concerns.We utilize an anonymous key generation technique to solve these problems.The equality test functionality further enables a cloud server to inspect whether two candidate trapdoors contain an identical keyword.In particular,the proposed scheme realizes fine-grained user-level authorization while maintaining strong key confidentiality.To revoke an invalid user identity,we add a revocation list to the system flows to restrict access privileges without increasing additional computation cost.To ensure security,it is shown that our system meets the security notion of IND-PrID-CCA and OW-ID-CCA under the Decisional Bilinear Diffie-Hellman(DBDH)assumption.展开更多
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.展开更多
The rapid development of brain-like neural networks and secure data transmission technologies has placed greater demands on highly complex neural network systems and highly secure encryption methods.To this end,the pa...The rapid development of brain-like neural networks and secure data transmission technologies has placed greater demands on highly complex neural network systems and highly secure encryption methods.To this end,the paper proposes a novel high-dimensional memristor synapse-coupled hyperchaotic neural network by using the designed memristor as the synapse to connect an inertial neuron(IN)and a Hopfield neural network(HNN).By using numerical tools including bifurcation plots,phase plots,and basins of attraction,it is found that the dynamics of this system are closely related to the memristor coupling strength,self-connection synaptic weights,and inter-connection synaptic weights,and it can exhibit excellent hyperchaotic behaviors and coexisting multi-stable patterns.Through PSIM circuit simulations,the complex dynamics of the coupled IN-HNN system are verified.Furthermore,a DNA-encoded encryption algorithm is given,which utilizes generated hyperchaotic sequences to achieve encoding,operation,and decoding of DNA.The results show that this algorithm possesses strong robustness against statistical attacks,differential attacks,and noise interference,and can effectively resist known/selected plaintext attacks.This work will provide new ideas for the modeling of large-scale brainlike neural networks and high-security image encryption.展开更多
Dear Editor,This letter studies the problem of stealthy attacks targeting stochastic event-based estimation,alongside proposing measures for their mitigation.A general attack framework is introduced,and the correspond...Dear Editor,This letter studies the problem of stealthy attacks targeting stochastic event-based estimation,alongside proposing measures for their mitigation.A general attack framework is introduced,and the corresponding stealthiness condition is analyzed.To enhance system security,we advocate for a single-dimensional encryption method,showing that securing a singular data element is sufficient to shield the system from the perils of stealthy attacks.展开更多
This paper describes two identity-based broadcast encryption （IBBE） schemes for mobile ad hoc networks. The first scheme proposed achieves sub-linear size cipertexts and the second scheme achieves O（1）- size ciphe...This paper describes two identity-based broadcast encryption （IBBE） schemes for mobile ad hoc networks. The first scheme proposed achieves sub-linear size cipertexts and the second scheme achieves O（1）- size ciphertexts. Furthermore, when the public keys are transmitted, the two schemes have short transmissions and achieve O（1） user storage cost, which are important for a mobile ad hoc network. Finally, the proposed schemes are provable security under the decision generalized bilinear Diffi-Hellman （GBDH） assumption in the random oracles model.展开更多
An identity-based encryption(IBE) was studied with non-interactively opening property that the plain text of a ciphertext can be revealed without affecting the security of the encryption system.Two kinds of non-intera...An identity-based encryption(IBE) was studied with non-interactively opening property that the plain text of a ciphertext can be revealed without affecting the security of the encryption system.Two kinds of non-interactive opening properties for IBE schemes were defined along with a concrete scheme in each case.展开更多
In this paper,we show how to use the dual techniques in the subgroups to give a secure identity-based broadcast encryption(IBBE) scheme with constant-size ciphertexts. Our scheme achieves the full security(adaptive se...In this paper,we show how to use the dual techniques in the subgroups to give a secure identity-based broadcast encryption(IBBE) scheme with constant-size ciphertexts. Our scheme achieves the full security(adaptive security) under three static(i.e. non q-based) assumptions. It is worth noting that only recently Waters gives a short ciphertext broadcast encryption system that is even adaptively secure under the simple assumptions. One feature of our methodology is that it is relatively simple to leverage our techniques to get adaptive security.展开更多
The theory of quadratic residues plays an important role in cryptography.In 2001,Cocks developed an identity-based encryption(IBE)scheme based on quadratic residues,resolving Shamir’s 17-year-old open problem.However...The theory of quadratic residues plays an important role in cryptography.In 2001,Cocks developed an identity-based encryption(IBE)scheme based on quadratic residues,resolving Shamir’s 17-year-old open problem.However,a notable drawback of Cocks’scheme is the significant expansion of the ciphertext,and some of its limitations have been addressed in subsequent research.Recently,Cotan and Teşeleanu highlighted that previous studies on Cocks’scheme relied on a trial-and-error method based on Jacobi symbols to generate the necessary parameters for the encryption process.They enhanced the encryption speed of Cocks’scheme by eliminating this trialand-error method.Based on security analysis,this study concludes that the security of Cotan-Teşeleanu’s proposal cannot be directly derived from the security of the original Cocks’scheme.Furthermore,by adopting the Cotan-Teşeleanu method and introducing an additional variable as a public element,this study develops a similar enhancement scheme that not only accelerates the encryption speed but also provides security equivalent to the original Cocks’scheme.展开更多
Public key encryption scheme with keyword search （PEKS） enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any infor- mation about the encrypted data without the trapdoor...Public key encryption scheme with keyword search （PEKS） enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any infor- mation about the encrypted data without the trapdoor corresponding to the keyword. The PEKS is useful to keep the management of large data storages secure such as those in a cloud. In this paper, to protect against quantum computer attacks, we present a lattice-based identity-based encryption scheme with key- word search. We have proved that our scheme can achieve ciphertext indistinguishability in the random oracle model, and our scheme can also achieve trapdoor security. In particular, our scheme can designate a unique tester to test and return the search results, therefore it does not need a secure channel. To the best of our knowledge, our scheme is the first iden- tity-based encryption scheme with keyword search from lattice assumption.展开更多
Internet of Things(IoT),which provides the solution of connecting things and devices,has increasingly developed as vital tools to realize intelligent life.Generally,source-limited IoT sensors outsource their data to t...Internet of Things(IoT),which provides the solution of connecting things and devices,has increasingly developed as vital tools to realize intelligent life.Generally,source-limited IoT sensors outsource their data to the cloud,which arises the concerns that the transmission of IoT data is happening without appropriate consideration of the profound security challenges involved.Though encryption technology can guarantee the confidentiality of private data,it hinders the usability of data.Searchable encryption(SE)has been proposed to achieve secure data sharing and searching.However,most of existing SE schemes are designed under conventional hardness assumptions and may be vulnerable to the adversary with quantum computers.Moreover,the untrusted cloud server may perform an unfaithful search execution.To address these problems,in this paper,we propose the first verifiable identity-based keyword search(VIBKS)scheme from lattice.In particular,a lattice-based delegation algorithm is adopted to help the data user to verify both the correctness and the integrity of the search results.Besides,in order to reduce the communication overhead,we refer to the identity-based mechanism.We conduct rigorous proof to demonstrate that the proposed VIBKS scheme is ciphertext indistinguishable secure against the semi-honestbut-curious adversary.In addition,we give the detailed computation and communication complexity of our VIBKS and conduct a series of experiments to validate its efficiency performance.展开更多
To give concurrent consideration both the efficiency and the security(intensity of intractable problem) in the standard model,a chosen ciphertext secure identity-based broadcast encryption is proposed.Against the chos...To give concurrent consideration both the efficiency and the security(intensity of intractable problem) in the standard model,a chosen ciphertext secure identity-based broadcast encryption is proposed.Against the chosen ciphertext security model,by using identity(ID) sequence and adding additional information in ciphertext,the self-adaptive chosen identity security(the full security) and the chosen ciphertext security are gained simultaneously.The reduction of scheme's security is the decisional bilinear Diffie-Hellman(BDH) intractable assumption,and the proof of security shows that the proposed scheme is indistinguishable against adaptive chosen ciphertext attacks in the standard model under the decisional BDH intractable assumption.So the security level is improved,and it is suitable for higher security environment.展开更多
To design an efficient protocol for sharing the encrypted lock keys in the renting house system,we introduce a new notion called time-and identitybased proxy reencryption(TIPRE)and the blockchain platform.Our CPA secu...To design an efficient protocol for sharing the encrypted lock keys in the renting house system,we introduce a new notion called time-and identitybased proxy reencryption(TIPRE)and the blockchain platform.Our CPA secure TIPRE scheme is constructed from Green et al.’s identity-based proxy reencryption scheme by adding the time property.In every time period,a time stamp authority generates a public key embedded with the current time stamp for each user.In our protocol for the renting house system,the TIPRE scheme is the primary building block,and the blockchain platform serves instead of a trusted third party,such as a real estate agency between landlords and tenants.The TIPRE scheme allows the landlord to change the lock key at each time period for safety.The blockchain platform allows the landlords and tenants to directly interact,and all of the interactions are recorded in the blockchain database to provide the desired security requirements,such as nonrepudiation and unforgeability.Finally,we provide the secure analysis of our protocol and test its performance by implementing it in the MacBook Pro and the Intel Edison development platforms.展开更多
An identity-based proxy re-encryption scheme(IB-PRE)allows a semi-trusted proxy to convert an encryption under one identity to another without revealing the underlying message.Due to the fact that the proxy was semi-t...An identity-based proxy re-encryption scheme(IB-PRE)allows a semi-trusted proxy to convert an encryption under one identity to another without revealing the underlying message.Due to the fact that the proxy was semi-trusted,it should place as little trust as necessary to allow it to perform the translations.In some applications such as distributed file system,it demands the adversary cannot identify the sender and recipient’s identities.However,none of the exiting IB-PRE schemes satisfy this requirement.In this work,we first define the security model of key-private IB-PRE.Finally,we propose the first key-private IB-PRE scheme.Our scheme is chosen plaintext secure(CPA)and collusion resistant in the standard model.展开更多
This paper proposes an identity-based encryption scheme with the help of bilinear pairings, where the identity information of a user functions as the user＇s public key. The advantage of an identity-based public key s...This paper proposes an identity-based encryption scheme with the help of bilinear pairings, where the identity information of a user functions as the user＇s public key. The advantage of an identity-based public key system is that it can avoid public key certificates and certificate management. Our identity-based encryption scheme enjoys short ciphertexts and provable security against chosen-ciphertext attack （CCA）.展开更多
In ACM'CCS 2009,Camenisch,et al.proposed the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the ...In ACM'CCS 2009,Camenisch,et al.proposed the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated set.Namely,AC-OT achieves access control policy for conjunction of attributes.Essentially,the functionality of AC-OT is equivalent to the sim-plified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by queries.On one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each item.On the other hand,any AC-OT can be realized by an AC-OT-SV.In this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption(IBE) with Anonymous Key Issuing(AKI) is given which is just a direct application to AC-OT-SV.By comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.展开更多
Broadcast encryption (BE) allows a sender to broadcast its message to a set of receivers in a single ciphertext. However, in broadcast encryption scheme, ciphertext length is always related to the size of the receiver...Broadcast encryption (BE) allows a sender to broadcast its message to a set of receivers in a single ciphertext. However, in broadcast encryption scheme, ciphertext length is always related to the size of the receiver set. Thus, how to improve the communication of broadcast encryption is a big issue. In this paper, we proposed an identity-based homomorphic broadcast encryption scheme which supports an external entity to directly calculate ciphertexts and get a new ciphertext which is the corresponding result of the operation on plaintexts without decrypting them. The correctness and security proofs of our scheme were formally proved. Finally, we implemented our scheme in a simulation environment and the experiment results showed that our scheme is efficient for practical applications.展开更多
基金supported in part by the National Science and Technology Council of Taiwan under the contract numbers NSTC 114-2221-E-019-055-MY2 and NSTC 114-2221-E-019-069.
文摘Cloud services,favored by many enterprises due to their high flexibility and easy operation,are widely used for data storage and processing.However,the high latency,together with transmission overheads of the cloud architecture,makes it difficult to quickly respond to the demands of IoT applications and local computation.To make up for these deficiencies in the cloud,fog computing has emerged as a critical role in the IoT applications.It decentralizes the computing power to various lower nodes close to data sources,so as to achieve the goal of low latency and distributed processing.With the data being frequently exchanged and shared between multiple nodes,it becomes a challenge to authorize data securely and efficiently while protecting user privacy.To address this challenge,proxy re-encryption(PRE)schemes provide a feasible way allowing an intermediary proxy node to re-encrypt ciphertext designated for different authorized data requesters without compromising any plaintext information.Since the proxy is viewed as a semi-trusted party,it should be taken to prevent malicious behaviors and reduce the risk of data leakage when implementing PRE schemes.This paper proposes a new fog-assisted identity-based PRE scheme supporting anonymous key generation,equality test,and user revocation to fulfill various IoT application requirements.Specifically,in a traditional identity-based public key architecture,the key escrow problem and the necessity of a secure channel are major security concerns.We utilize an anonymous key generation technique to solve these problems.The equality test functionality further enables a cloud server to inspect whether two candidate trapdoors contain an identical keyword.In particular,the proposed scheme realizes fine-grained user-level authorization while maintaining strong key confidentiality.To revoke an invalid user identity,we add a revocation list to the system flows to restrict access privileges without increasing additional computation cost.To ensure security,it is shown that our system meets the security notion of IND-PrID-CCA and OW-ID-CCA under the Decisional Bilinear Diffie-Hellman(DBDH)assumption.
文摘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.
基金Project supported by the Training Plan of Young Backbone Teachers in Universities of Henan Province(Grant No.2023GGJS142)the Key Scientific Research of Colleges and Universities in Henan Province,China(Grant No.25A120009)+1 种基金Changzhou Leading Innovative Talent Introduction and Cultivation Project(Grant No.CQ20240102)Changzhou Applied Basic Research Program(Grant No.CJ20253065)。
文摘The rapid development of brain-like neural networks and secure data transmission technologies has placed greater demands on highly complex neural network systems and highly secure encryption methods.To this end,the paper proposes a novel high-dimensional memristor synapse-coupled hyperchaotic neural network by using the designed memristor as the synapse to connect an inertial neuron(IN)and a Hopfield neural network(HNN).By using numerical tools including bifurcation plots,phase plots,and basins of attraction,it is found that the dynamics of this system are closely related to the memristor coupling strength,self-connection synaptic weights,and inter-connection synaptic weights,and it can exhibit excellent hyperchaotic behaviors and coexisting multi-stable patterns.Through PSIM circuit simulations,the complex dynamics of the coupled IN-HNN system are verified.Furthermore,a DNA-encoded encryption algorithm is given,which utilizes generated hyperchaotic sequences to achieve encoding,operation,and decoding of DNA.The results show that this algorithm possesses strong robustness against statistical attacks,differential attacks,and noise interference,and can effectively resist known/selected plaintext attacks.This work will provide new ideas for the modeling of large-scale brainlike neural networks and high-security image encryption.
基金supported by the National Natural Science Foundation of China(62303353,62273030,62573320)。
文摘Dear Editor,This letter studies the problem of stealthy attacks targeting stochastic event-based estimation,alongside proposing measures for their mitigation.A general attack framework is introduced,and the corresponding stealthiness condition is analyzed.To enhance system security,we advocate for a single-dimensional encryption method,showing that securing a singular data element is sufficient to shield the system from the perils of stealthy attacks.
基金the National Natural Science Foundation of China (Nos. 60673072, 60803149)the National Basic Research Program (973) of China(No. 2007CB311201)
文摘This paper describes two identity-based broadcast encryption （IBBE） schemes for mobile ad hoc networks. The first scheme proposed achieves sub-linear size cipertexts and the second scheme achieves O（1）- size ciphertexts. Furthermore, when the public keys are transmitted, the two schemes have short transmissions and achieve O（1） user storage cost, which are important for a mobile ad hoc network. Finally, the proposed schemes are provable security under the decision generalized bilinear Diffi-Hellman （GBDH） assumption in the random oracles model.
文摘An identity-based encryption(IBE) was studied with non-interactively opening property that the plain text of a ciphertext can be revealed without affecting the security of the encryption system.Two kinds of non-interactive opening properties for IBE schemes were defined along with a concrete scheme in each case.
基金supported by the Nature Science Foundation of China under grant 60970119, 60803149the National Basic Research Program of China(973) under grant 2007CB311201
文摘In this paper,we show how to use the dual techniques in the subgroups to give a secure identity-based broadcast encryption(IBBE) scheme with constant-size ciphertexts. Our scheme achieves the full security(adaptive security) under three static(i.e. non q-based) assumptions. It is worth noting that only recently Waters gives a short ciphertext broadcast encryption system that is even adaptively secure under the simple assumptions. One feature of our methodology is that it is relatively simple to leverage our techniques to get adaptive security.
基金Rising-Star Program of Shanghai 2023 Science and Technology Innovation Action Plan(Yangfan Special Project),China(No.23YF1401000)Fundamental Research Funds for the Central Universities,China(No.2232022D-25)。
文摘The theory of quadratic residues plays an important role in cryptography.In 2001,Cocks developed an identity-based encryption(IBE)scheme based on quadratic residues,resolving Shamir’s 17-year-old open problem.However,a notable drawback of Cocks’scheme is the significant expansion of the ciphertext,and some of its limitations have been addressed in subsequent research.Recently,Cotan and Teşeleanu highlighted that previous studies on Cocks’scheme relied on a trial-and-error method based on Jacobi symbols to generate the necessary parameters for the encryption process.They enhanced the encryption speed of Cocks’scheme by eliminating this trialand-error method.Based on security analysis,this study concludes that the security of Cotan-Teşeleanu’s proposal cannot be directly derived from the security of the original Cocks’scheme.Furthermore,by adopting the Cotan-Teşeleanu method and introducing an additional variable as a public element,this study develops a similar enhancement scheme that not only accelerates the encryption speed but also provides security equivalent to the original Cocks’scheme.
基金supported by the National Natural Science Foundation of China (No.61370203)China Postdoctoral Science Foundation Funded Project (No.2017M623008)+1 种基金Scientific Research Starting Project of SWPU (No.2017QHZ023)State Scholarship Foundation of China Scholarship Council (No.201708515149)
文摘Public key encryption scheme with keyword search （PEKS） enables us to search the encrypted data in a cloud server with a keyword, and no one can obtain any infor- mation about the encrypted data without the trapdoor corresponding to the keyword. The PEKS is useful to keep the management of large data storages secure such as those in a cloud. In this paper, to protect against quantum computer attacks, we present a lattice-based identity-based encryption scheme with key- word search. We have proved that our scheme can achieve ciphertext indistinguishability in the random oracle model, and our scheme can also achieve trapdoor security. In particular, our scheme can designate a unique tester to test and return the search results, therefore it does not need a secure channel. To the best of our knowledge, our scheme is the first iden- tity-based encryption scheme with keyword search from lattice assumption.
基金supported by the National Natural Science Foundation of China(No:62072240)the National Key Research and Development Program of China(No.2020YFB1804604).
文摘Internet of Things(IoT),which provides the solution of connecting things and devices,has increasingly developed as vital tools to realize intelligent life.Generally,source-limited IoT sensors outsource their data to the cloud,which arises the concerns that the transmission of IoT data is happening without appropriate consideration of the profound security challenges involved.Though encryption technology can guarantee the confidentiality of private data,it hinders the usability of data.Searchable encryption(SE)has been proposed to achieve secure data sharing and searching.However,most of existing SE schemes are designed under conventional hardness assumptions and may be vulnerable to the adversary with quantum computers.Moreover,the untrusted cloud server may perform an unfaithful search execution.To address these problems,in this paper,we propose the first verifiable identity-based keyword search(VIBKS)scheme from lattice.In particular,a lattice-based delegation algorithm is adopted to help the data user to verify both the correctness and the integrity of the search results.Besides,in order to reduce the communication overhead,we refer to the identity-based mechanism.We conduct rigorous proof to demonstrate that the proposed VIBKS scheme is ciphertext indistinguishable secure against the semi-honestbut-curious adversary.In addition,we give the detailed computation and communication complexity of our VIBKS and conduct a series of experiments to validate its efficiency performance.
基金the National Natural Science Foundation of China (No.60970119)the National Basic Research Program (973) of China (No.2007CB311201)
文摘To give concurrent consideration both the efficiency and the security(intensity of intractable problem) in the standard model,a chosen ciphertext secure identity-based broadcast encryption is proposed.Against the chosen ciphertext security model,by using identity(ID) sequence and adding additional information in ciphertext,the self-adaptive chosen identity security(the full security) and the chosen ciphertext security are gained simultaneously.The reduction of scheme's security is the decisional bilinear Diffie-Hellman(BDH) intractable assumption,and the proof of security shows that the proposed scheme is indistinguishable against adaptive chosen ciphertext attacks in the standard model under the decisional BDH intractable assumption.So the security level is improved,and it is suitable for higher security environment.
基金This research is partially supported by the National Natural Science Foundation of China under Grant Nos.61672016the Jiangsu Qing Lan Project,the Six Talent Peaks Project in Jiangsu Province under Grant RJFW-010the Guangxi Key Laboratory of Cryptography and Information Security under Grant GCIS201815.
文摘To design an efficient protocol for sharing the encrypted lock keys in the renting house system,we introduce a new notion called time-and identitybased proxy reencryption(TIPRE)and the blockchain platform.Our CPA secure TIPRE scheme is constructed from Green et al.’s identity-based proxy reencryption scheme by adding the time property.In every time period,a time stamp authority generates a public key embedded with the current time stamp for each user.In our protocol for the renting house system,the TIPRE scheme is the primary building block,and the blockchain platform serves instead of a trusted third party,such as a real estate agency between landlords and tenants.The TIPRE scheme allows the landlord to change the lock key at each time period for safety.The blockchain platform allows the landlords and tenants to directly interact,and all of the interactions are recorded in the blockchain database to provide the desired security requirements,such as nonrepudiation and unforgeability.Finally,we provide the secure analysis of our protocol and test its performance by implementing it in the MacBook Pro and the Intel Edison development platforms.
基金This work is supported by the National Natural Science Foundation of China(Nos.61702236,61672270,61602216,61872181)Changzhou Sci&Tech Program(Grant No.CJ20179027).
文摘An identity-based proxy re-encryption scheme(IB-PRE)allows a semi-trusted proxy to convert an encryption under one identity to another without revealing the underlying message.Due to the fact that the proxy was semi-trusted,it should place as little trust as necessary to allow it to perform the translations.In some applications such as distributed file system,it demands the adversary cannot identify the sender and recipient’s identities.However,none of the exiting IB-PRE schemes satisfy this requirement.In this work,we first define the security model of key-private IB-PRE.Finally,we propose the first key-private IB-PRE scheme.Our scheme is chosen plaintext secure(CPA)and collusion resistant in the standard model.
基金the National Natural Science Foundation of China(Nos.60673077,60873229)
文摘This paper proposes an identity-based encryption scheme with the help of bilinear pairings, where the identity information of a user functions as the user＇s public key. The advantage of an identity-based public key system is that it can avoid public key certificates and certificate management. Our identity-based encryption scheme enjoys short ciphertexts and provable security against chosen-ciphertext attack （CCA）.
文摘In ACM'CCS 2009,Camenisch,et al.proposed the Oblivious Transfer with Access Control(AC-OT) in which each item is associated with an attribute set and can only be available,on request,to the users who have all the attributes in the associated set.Namely,AC-OT achieves access control policy for conjunction of attributes.Essentially,the functionality of AC-OT is equivalent to the sim-plified version that we call AC-OT-SV:for each item,one attribute is associated with it,and it is requested that only the users who possess the associated attribute can obtain the item by queries.On one hand,AC-OT-SV is a special case of AC-OT when there is just one associated attribute with each item.On the other hand,any AC-OT can be realized by an AC-OT-SV.In this paper,we first present a concrete AC-OT-SV protocol which is proved to be secure in the model defined by Camenisch,et al..Then from the protocol,interestingly,a concrete Identity-Based Encryption(IBE) with Anonymous Key Issuing(AKI) is given which is just a direct application to AC-OT-SV.By comparison,we show that the AKI protocol we present is more efficient in communications than that proposed by Chow.
文摘Broadcast encryption (BE) allows a sender to broadcast its message to a set of receivers in a single ciphertext. However, in broadcast encryption scheme, ciphertext length is always related to the size of the receiver set. Thus, how to improve the communication of broadcast encryption is a big issue. In this paper, we proposed an identity-based homomorphic broadcast encryption scheme which supports an external entity to directly calculate ciphertexts and get a new ciphertext which is the corresponding result of the operation on plaintexts without decrypting them. The correctness and security proofs of our scheme were formally proved. Finally, we implemented our scheme in a simulation environment and the experiment results showed that our scheme is efficient for practical applications.
