Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.P...Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.Previous schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing costs.To address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training scheme.Firstly,we design a multi-precision functional encryption computation based on Euclidean division.Second,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced heterogeneity.Finally,we conduct experiments on three datasets.The results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.展开更多
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.展开更多
The medical monitoring system is widely used. In the medical monitoring system, each user only possesses one piece of data logging that participates in statistical computing. Specifically in such a situation, a feasib...The medical monitoring system is widely used. In the medical monitoring system, each user only possesses one piece of data logging that participates in statistical computing. Specifically in such a situation, a feasible solution is to scatter its statistical computing workload to corresponding statistical nodes. Moreover, there are still two problems that should be resolved. One is how the server takes advantage of intermediate results obtained through statistical node aggregation to perform statistical computing. Statistical variable decomposition technique points out the direction for statistical projects. The other problem is how to design an efficient topological structure for statistical computing. In this paper, tree topology was adopted to implement data aggregation to improve aggregation efficiency. And two experiments were done for time consumption of statistical computing which focuses on encrypted data aggregation and encrypted data computing. The first experiment indicates that encrypted data aggregation efficiency of the scheme proposed in this paper is better than that of Drosatos' scheme, and the second indicates that improving computing power of the server or computational efficiency of the functional encryption scheme can shorten the computation time.展开更多
In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every cipherte...In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.展开更多
Federated learning is a distributed learning framework which trains global models by passing model parameters instead of raw data.However,the training mechanism for passing model parameters is still threatened by grad...Federated learning is a distributed learning framework which trains global models by passing model parameters instead of raw data.However,the training mechanism for passing model parameters is still threatened by gradient inversion,inference attacks,etc.With a lightweight encryption overhead,function encryption is a viable secure aggregation technique in federation learning,which is often used in combination with differential privacy.The function encryption in federal learning still has the following problems:a)Traditional function encryption usually requires a trust third party(TTP)to assign the keys.If a TTP colludes with a server,the security aggregation mechanism can be compromised.b)When using differential privacy in combination with function encryption,the evaluation metrics of incentive mechanisms in the traditional federal learning become invisible.In this paper,we propose a hybrid privacy-preserving scheme for federated learning,called Fed-DFE.Specifically,we present a decentralized multi-client function encryption algorithm.It replaces the TTP in traditional function encryption with an interactive key generation algorithm,avoiding the problem of collusion.Then,an embedded incentive mechanism is designed for function encryption.It models the real parameters in federated learning and finds a balance between privacy preservation and model accuracy.Subsequently,we implemented a prototype of Fed-DFE and evaluated the performance of decentralized function encryption algorithm.The experimental results demonstrate the effectiveness and efficiency of our scheme.展开更多
We propose a new fractional two-dimensional triangle function combination discrete chaotic map(2D-TFCDM)with the discrete fractional difference.Moreover,the chaos behaviors of the proposed map are observed and the bif...We propose a new fractional two-dimensional triangle function combination discrete chaotic map(2D-TFCDM)with the discrete fractional difference.Moreover,the chaos behaviors of the proposed map are observed and the bifurcation diagrams,the largest Lyapunov exponent plot,and the phase portraits are derived,respectively.Finally,with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem,we apply the discrete fractional map into color image encryption.After that,the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.展开更多
The paper describes a symmetric encryption algorithm based on bit permutations and using an iterative process combined with a chaotic function. The main advantages of such a cryptosystem is its ability to encrypt secu...The paper describes a symmetric encryption algorithm based on bit permutations and using an iterative process combined with a chaotic function. The main advantages of such a cryptosystem is its ability to encrypt securely bit sequences and assuring confusion, diffusion and indistinguishability properties in the cipher. The algorithm is applied on the image encryption where the plain-image is viewed as binary sequence. The results of statistical analysis about randomness, sensitivity and correlation on the cipher-images show the relevance of the proposed cryptosystem.展开更多
In this study,a new algorithm of fractional beta chaotic maps is proposed to generate chaotic sequences for image encryption.The proposed technique generates multi random sequences by shuffling the image pixel positio...In this study,a new algorithm of fractional beta chaotic maps is proposed to generate chaotic sequences for image encryption.The proposed technique generates multi random sequences by shuffling the image pixel position.This technique is used to blur the pixels connecting the input and encrypted images and to increase the attack resistance.The proposed algorithm makes the encryption process sophisticated by using fractional chaotic maps,which hold the properties of pseudo-randomness.The fractional beta sequences are utilized to alter the image pixels to decryption attacks.The experimental results proved that the proposed image encryption algorithm successfully encrypted and decrypted the images with the same keys.The output findings indicate that our proposed algorithm has good entropy and low correlation coefficients.This translates to enhanced security against different attacks.A MATLAB programming tool was used to implement and assess the image quality measures.A comparison with other image encryption techniques regarding the visual inspection and signal-to-noise ratio is provided.展开更多
A Cramer-Shoup scheme was modified in a variant way. The major advantage with respect to Kurosawa-Desmedt scheme is that it saves a key parameter and produces shorter ciphertext. The proof of security shows that our s...A Cramer-Shoup scheme was modified in a variant way. The major advantage with respect to Kurosawa-Desmedt scheme is that it saves a key parameter and produces shorter ciphertext. The proof of security shows that our scheme can be instantiated with any computational secure key derivation and message authentication functions. Thus it extends the applicability of the Kurosawa-Desmedt scheme and improves its efficiency.展开更多
Data outsourcing has become an industry trend with the popularity of cloud computing.How to search data securely and efficiently has received unprecedented attention.Dynamic Searchable Symmetric Encryption(DSSE)is an ...Data outsourcing has become an industry trend with the popularity of cloud computing.How to search data securely and efficiently has received unprecedented attention.Dynamic Searchable Symmetric Encryption(DSSE)is an effective method to solve this problem,which supports file updates and keyword-based searches over encrypted data.Unfortunately,most existing DSSE schemes have privacy leakages during the addition and deletion phases,thus proposing the concepts of forward and backward privacy.At present,some secure DSSE schemes with forward and backward privacy have been proposed,but most of these DSSE schemes only achieve single-keyword query in the single-client setting,which seriously limits the application in practice.To solve this problem,we propose a multi-client and multikeyword searchable symmetric encryption scheme with forward and backward privacy(MMKFB).Our scheme focuses on the multi-keyword threshold queries in the multi-client setting,which is a new pattern of multi-keyword search realized with the help of additive homomorphism.And performance analysis and experiments demonstrate that our scheme is more practical for use in small and medium size databases.Especially when a large number of files are updated at once,our scheme has advantages over some existing DSSE schemes in terms of computational efficiency and client storage overhead.展开更多
In a function-hiding inner product functional encryption(FH-IPFE)scheme,both secret keys and ciphertexts are associated with vectors.Given a secret key for an n-dimensional vector x,and a ciphertext for an n-dimension...In a function-hiding inner product functional encryption(FH-IPFE)scheme,both secret keys and ciphertexts are associated with vectors.Given a secret key for an n-dimensional vector x,and a ciphertext for an n-dimensional vector y,a decryptor learns the inner product value<x,y>and nothing else about both x and y.FH-IPFE has been shown to be very useful in privacy-preserving computation.In this paper,we first propose a new(secret-key)FH-IPFE scheme and prove it the secure in the generic group model.Compared with the state-of-the-art scheme of Kim et al.,the proposed scheme has comparable performance in decryption and reduces 1)the size of master key from n^(2)to 3n−1,2)the setup complexity from O(n^(3))to O(n),and 3)the encryption and key generation complexities from O(n^(2))to O(nlogn).To the best of our knowledge,this is the most efficient construction based on pairings to date.Moreover,we apply our FH-IPFE scheme to build a fine-grained data sharing system,where data owners store their encrypted data on an untrusted server.Our design supports not only basic database operations but also statistical analyses on encrypted data.To achieve this goal,we also introduce a new security notion,partial-key exposure-resilient simulation-based security(PK-ER-SIM),for FH-IPFE,which enables lightweight clients to securely delegate heavy computations to a powerful server and may be independent of interest.展开更多
Dynamic fluorescent materials capable of stimulus-responsive emission modulation have emerged as pivotal components in next-generation information security systems.This study presents a novel photoresponsive fluoresce...Dynamic fluorescent materials capable of stimulus-responsive emission modulation have emerged as pivotal components in next-generation information security systems.This study presents a novel photoresponsive fluorescent composite system in which spiropyran(SP)was covalently grafted onto naphthalimide-functionalized silica aerogel matrices.These architectures exhibit reversible fluorescence resonance energy transfer between the naphthalimide donors and merocyanine-form of SP acceptors under ultraviolet irradiation,enabling dynamic emission shifting from green(blue)to red.The aggregation-induced emission characteristics of SP were used to engineer a smart material system that can reversibly regulate its distinct red fluorescence by precisely controlling the dispersion of amino groups on naphthalimide-functionalized silica aerogels.This spatial manipulation directly governs the molecular packing state of SP,enabling dynamic fluorescence modulation.A programmable control over the fluorescence chromatic transitions in the composite material was achieved by systematically adjusting the SP grafting densities(1%,2%,and 3%w/w).A unique mode of dynamic information encryption technology was developed by utilizing dynamic fluorescence variations.These materials can substantially enhance information encryption levels due to their precisely adjustable fluorescence properties in response to external stimuli over time.This makes the encryption process even more unpredictable and complex,thereby exponentially increasing the difficulty for unauthorized parties to replicate or decode the encrypted information.展开更多
In the data encryption standard （DES） algorithm, there exist several bit-switching functions, including permutations, expansion, and permuted choices. They are generally presented in the form of matrixes and realize...In the data encryption standard （DES） algorithm, there exist several bit-switching functions, including permutations, expansion, and permuted choices. They are generally presented in the form of matrixes and realized by using table look-up technique in the implementation of the cryptosystem. This paper presents explicit formulas for the initial permutation IP, its inverse IP-1 , the expansion function E, and the permuted choice PC_1. It also gives the program realizations of these functions in C＋＋ applying these formulas. With the advantage of the omission of the storage space for these matrixes and the tedious inputs of tables in the implementations of DES, our experimental results shows that the explicit formulas are useful in some situations, such as wireless sensor networks where the memory capacity is limited, especially when the size of file for encrypting is not too large, preferably smaller than 256KB.展开更多
A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data tran...A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.展开更多
Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted fu...Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages.Inner product encryption(IPE)is a special type of functional encryption where the decryption algorithm,given a ciphertext related to a vector x and a secret key related to a vector y,computes the inner product x·y.In this paper,we construct an efficient private-key functional encryption(FE)for inner product with simulation-based security,which is much stronger than indistinguishability-based security,under the External Decisional Linear assumption in the standard model.Compared with the existing schemes,our construction is faster in encryption and decryption,and the master secret key,secret keys and ciphertexts are shorter.展开更多
To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication sch...To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.展开更多
Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted fu...Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages.Inner product encryption(IPE)is a special type of functional encryption where the decryption algorithm,given a ciphertext related to a vector x and a secret key related to a vector y,computes the inner product x·y.In this paper,we construct an efficient private-key functional encryption(FE)for inner product with simulation-based security,which is much stronger than indistinguishability-based security,under the External Decisional Linear assumption in the standard model.Compared with the existing schemes,our construction is faster in encryption and decryption,and the master secret key,secret keys and ciphertexts are shorter.展开更多
基金supported by Natural Science Foundation of China(Nos.62303126,62362008,author Z.Z,https://www.nsfc.gov.cn/,accessed on 20 December 2024)Major Scientific and Technological Special Project of Guizhou Province([2024]014)+2 种基金Guizhou Provincial Science and Technology Projects(No.ZK[2022]General149) ,author Z.Z,https://kjt.guizhou.gov.cn/,accessed on 20 December 2024)The Open Project of the Key Laboratory of Computing Power Network and Information Security,Ministry of Education under Grant 2023ZD037,author Z.Z,https://www.gzu.edu.cn/,accessed on 20 December 2024)Open Research Project of the State Key Laboratory of Industrial Control Technology,Zhejiang University,China(No.ICT2024B25),author Z.Z,https://www.gzu.edu.cn/,accessed on 20 December 2024).
文摘Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model training.However,dishonest clouds may infer user data,resulting in user data leakage.Previous schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing costs.To address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training scheme.Firstly,we design a multi-precision functional encryption computation based on Euclidean division.Second,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced heterogeneity.Finally,we conduct experiments on three datasets.The results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.
基金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.
基金Supported by the National Natural Science Foundation of China(91112003)
文摘The medical monitoring system is widely used. In the medical monitoring system, each user only possesses one piece of data logging that participates in statistical computing. Specifically in such a situation, a feasible solution is to scatter its statistical computing workload to corresponding statistical nodes. Moreover, there are still two problems that should be resolved. One is how the server takes advantage of intermediate results obtained through statistical node aggregation to perform statistical computing. Statistical variable decomposition technique points out the direction for statistical projects. The other problem is how to design an efficient topological structure for statistical computing. In this paper, tree topology was adopted to implement data aggregation to improve aggregation efficiency. And two experiments were done for time consumption of statistical computing which focuses on encrypted data aggregation and encrypted data computing. The first experiment indicates that encrypted data aggregation efficiency of the scheme proposed in this paper is better than that of Drosatos' scheme, and the second indicates that improving computing power of the server or computational efficiency of the functional encryption scheme can shorten the computation time.
基金supported by the National Science Foundation of China (No.61373040,No.61173137)The Ph.D.Pro-grams Foundation of Ministry of Education of China(20120141110073)Key Project of Natural Science Foundation of Hubei Province (No.2010CDA004)
文摘In cloud,data access control is a crucial way to ensure data security.Functional encryption(FE) is a novel cryptographic primitive supporting fine-grained access control of encrypted data in cloud.In FE,every ciphertext is specified with an access policy,a decryptor can access the data if and only if his secret key matches with the access policy.However,the FE cannot be directly applied to construct access control scheme due to the exposure of the access policy which may contain sensitive information.In this paper,we deal with the policy privacy issue and present a mechanism named multi-authority vector policy(MAVP) which provides hidden and expressive access policy for FE.Firstly,each access policy is encoded as a matrix and decryptors can only obtain the matched result from the matrix in MAVP.Then,we design a novel function encryption scheme based on the multi-authority spatial policy(MAVPFE),which can support privacy-preserving yet non-monotone access policy.Moreover,we greatly improve the efficiency of encryption and decryption in MAVP-FE by shifting the major computation of clients to the outsourced server.Finally,the security and performance analysis show that our MAVP-FE is secure and efficient in practice.
基金This work was supported in part by the National Key R&D Program of China(No.2018YFB2100400)in part by the National Natural Science Foundation of China(No.62002077,61872100)+2 种基金in part by the China Postdoctoral Science Foundation(No.2020M682657)in part by Guangdong Basic and Applied Basic Research Foundation(No.2020A1515110385)in part by Zhejiang Lab(No.2020NF0AB01),in part by Guangzhou Science and Technology Plan Project(202102010440).
文摘Federated learning is a distributed learning framework which trains global models by passing model parameters instead of raw data.However,the training mechanism for passing model parameters is still threatened by gradient inversion,inference attacks,etc.With a lightweight encryption overhead,function encryption is a viable secure aggregation technique in federation learning,which is often used in combination with differential privacy.The function encryption in federal learning still has the following problems:a)Traditional function encryption usually requires a trust third party(TTP)to assign the keys.If a TTP colludes with a server,the security aggregation mechanism can be compromised.b)When using differential privacy in combination with function encryption,the evaluation metrics of incentive mechanisms in the traditional federal learning become invisible.In this paper,we propose a hybrid privacy-preserving scheme for federated learning,called Fed-DFE.Specifically,we present a decentralized multi-client function encryption algorithm.It replaces the TTP in traditional function encryption with an interactive key generation algorithm,avoiding the problem of collusion.Then,an embedded incentive mechanism is designed for function encryption.It models the real parameters in federated learning and finds a balance between privacy preservation and model accuracy.Subsequently,we implemented a prototype of Fed-DFE and evaluated the performance of decentralized function encryption algorithm.The experimental results demonstrate the effectiveness and efficiency of our scheme.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61072147 and 11271008)
文摘We propose a new fractional two-dimensional triangle function combination discrete chaotic map(2D-TFCDM)with the discrete fractional difference.Moreover,the chaos behaviors of the proposed map are observed and the bifurcation diagrams,the largest Lyapunov exponent plot,and the phase portraits are derived,respectively.Finally,with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem,we apply the discrete fractional map into color image encryption.After that,the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.
文摘The paper describes a symmetric encryption algorithm based on bit permutations and using an iterative process combined with a chaotic function. The main advantages of such a cryptosystem is its ability to encrypt securely bit sequences and assuring confusion, diffusion and indistinguishability properties in the cipher. The algorithm is applied on the image encryption where the plain-image is viewed as binary sequence. The results of statistical analysis about randomness, sensitivity and correlation on the cipher-images show the relevance of the proposed cryptosystem.
文摘In this study,a new algorithm of fractional beta chaotic maps is proposed to generate chaotic sequences for image encryption.The proposed technique generates multi random sequences by shuffling the image pixel position.This technique is used to blur the pixels connecting the input and encrypted images and to increase the attack resistance.The proposed algorithm makes the encryption process sophisticated by using fractional chaotic maps,which hold the properties of pseudo-randomness.The fractional beta sequences are utilized to alter the image pixels to decryption attacks.The experimental results proved that the proposed image encryption algorithm successfully encrypted and decrypted the images with the same keys.The output findings indicate that our proposed algorithm has good entropy and low correlation coefficients.This translates to enhanced security against different attacks.A MATLAB programming tool was used to implement and assess the image quality measures.A comparison with other image encryption techniques regarding the visual inspection and signal-to-noise ratio is provided.
基金the National Basic Research Program(973) of China (No 2007CB807903)the National Natural Science Foundation of China (No. 60743006)+1 种基金the Natural Science Foundation of Shandong Province(No. Y2007G15)the Shandong Grant program for Post PH.D (No. 200601002)
文摘A Cramer-Shoup scheme was modified in a variant way. The major advantage with respect to Kurosawa-Desmedt scheme is that it saves a key parameter and produces shorter ciphertext. The proof of security shows that our scheme can be instantiated with any computational secure key derivation and message authentication functions. Thus it extends the applicability of the Kurosawa-Desmedt scheme and improves its efficiency.
基金supports in part by the National Key R&D Program of China(No.2020YFA0712300)in part by the National Natural Science Foundation of China(Grant Nos.62132005 and 62172162).
文摘Data outsourcing has become an industry trend with the popularity of cloud computing.How to search data securely and efficiently has received unprecedented attention.Dynamic Searchable Symmetric Encryption(DSSE)is an effective method to solve this problem,which supports file updates and keyword-based searches over encrypted data.Unfortunately,most existing DSSE schemes have privacy leakages during the addition and deletion phases,thus proposing the concepts of forward and backward privacy.At present,some secure DSSE schemes with forward and backward privacy have been proposed,but most of these DSSE schemes only achieve single-keyword query in the single-client setting,which seriously limits the application in practice.To solve this problem,we propose a multi-client and multikeyword searchable symmetric encryption scheme with forward and backward privacy(MMKFB).Our scheme focuses on the multi-keyword threshold queries in the multi-client setting,which is a new pattern of multi-keyword search realized with the help of additive homomorphism.And performance analysis and experiments demonstrate that our scheme is more practical for use in small and medium size databases.Especially when a large number of files are updated at once,our scheme has advantages over some existing DSSE schemes in terms of computational efficiency and client storage overhead.
基金supported by the National Natural Science Foundation of China under Grant Nos.62202294 and 62272294the National Key Research and Development Program of China under Grant No.2020YFA0712300.
文摘In a function-hiding inner product functional encryption(FH-IPFE)scheme,both secret keys and ciphertexts are associated with vectors.Given a secret key for an n-dimensional vector x,and a ciphertext for an n-dimensional vector y,a decryptor learns the inner product value<x,y>and nothing else about both x and y.FH-IPFE has been shown to be very useful in privacy-preserving computation.In this paper,we first propose a new(secret-key)FH-IPFE scheme and prove it the secure in the generic group model.Compared with the state-of-the-art scheme of Kim et al.,the proposed scheme has comparable performance in decryption and reduces 1)the size of master key from n^(2)to 3n−1,2)the setup complexity from O(n^(3))to O(n),and 3)the encryption and key generation complexities from O(n^(2))to O(nlogn).To the best of our knowledge,this is the most efficient construction based on pairings to date.Moreover,we apply our FH-IPFE scheme to build a fine-grained data sharing system,where data owners store their encrypted data on an untrusted server.Our design supports not only basic database operations but also statistical analyses on encrypted data.To achieve this goal,we also introduce a new security notion,partial-key exposure-resilient simulation-based security(PK-ER-SIM),for FH-IPFE,which enables lightweight clients to securely delegate heavy computations to a powerful server and may be independent of interest.
基金supported by the Zhejiang Sci-Tech University Shengzhou Innovation Research Institute(SYY2.023C000005)the National Natural Science Foundation of China(51803184)。
文摘Dynamic fluorescent materials capable of stimulus-responsive emission modulation have emerged as pivotal components in next-generation information security systems.This study presents a novel photoresponsive fluorescent composite system in which spiropyran(SP)was covalently grafted onto naphthalimide-functionalized silica aerogel matrices.These architectures exhibit reversible fluorescence resonance energy transfer between the naphthalimide donors and merocyanine-form of SP acceptors under ultraviolet irradiation,enabling dynamic emission shifting from green(blue)to red.The aggregation-induced emission characteristics of SP were used to engineer a smart material system that can reversibly regulate its distinct red fluorescence by precisely controlling the dispersion of amino groups on naphthalimide-functionalized silica aerogels.This spatial manipulation directly governs the molecular packing state of SP,enabling dynamic fluorescence modulation.A programmable control over the fluorescence chromatic transitions in the composite material was achieved by systematically adjusting the SP grafting densities(1%,2%,and 3%w/w).A unique mode of dynamic information encryption technology was developed by utilizing dynamic fluorescence variations.These materials can substantially enhance information encryption levels due to their precisely adjustable fluorescence properties in response to external stimuli over time.This makes the encryption process even more unpredictable and complex,thereby exponentially increasing the difficulty for unauthorized parties to replicate or decode the encrypted information.
基金Supported by the National Natural Science Foundation of China (61272045)Natural Science Foundation of Outstanding Youth Team Project of Zhejiang Province (R1090138)Project of the State Key Laboratory of Information Security (Institute of Information Engineering, Chinese Academy of Sciences, Beijing)
文摘In the data encryption standard （DES） algorithm, there exist several bit-switching functions, including permutations, expansion, and permuted choices. They are generally presented in the form of matrixes and realized by using table look-up technique in the implementation of the cryptosystem. This paper presents explicit formulas for the initial permutation IP, its inverse IP-1 , the expansion function E, and the permuted choice PC_1. It also gives the program realizations of these functions in C＋＋ applying these formulas. With the advantage of the omission of the storage space for these matrixes and the tedious inputs of tables in the implementations of DES, our experimental results shows that the explicit formulas are useful in some situations, such as wireless sensor networks where the memory capacity is limited, especially when the size of file for encrypting is not too large, preferably smaller than 256KB.
基金the National Natural Science Foundation of China (Grant No. 61601517)basic and advanced technology research project of Henan Province, China (Grant No. 2014302703)
文摘A round function based on chaos is designed combining Feistel structure’s pseudo-randomness, chaotic system’s parameter sensitivity and image data characteristics. The round function composes of two parts--data transformation based on Feistel(abbreviated as FST) and sampling output based on chaos(abbreviated as SMP). FST bases on Feistel structure and several efficient operations including bitwise xor, permutation and circulating shift. SMP is a chaos based pseudo-random sampling algorithm. It is from theoretical analysis that the round function is a pseudo-random function. The upper bounds of the average maximum differential probability and average maximum linear probability are p^2 and q^2 respectively. Finally, the good pseudo-randomness of the round function is examined with the NIST random test. The design of this round function provides an important cryptographic component for the design of chaotic image encryption algorithm.
基金National Natural Science Foundation of China(61872152)the Major Program of Guangdong Basic and Applied Research(2019B030302008)Science and Technology Program of Guangzhou(201902010081).
文摘Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages.Inner product encryption(IPE)is a special type of functional encryption where the decryption algorithm,given a ciphertext related to a vector x and a secret key related to a vector y,computes the inner product x·y.In this paper,we construct an efficient private-key functional encryption(FE)for inner product with simulation-based security,which is much stronger than indistinguishability-based security,under the External Decisional Linear assumption in the standard model.Compared with the existing schemes,our construction is faster in encryption and decryption,and the master secret key,secret keys and ciphertexts are shorter.
基金Project supported by NSFC(Grant Nos.U1836205,61702040)the Major Scientific and Technological Special Project of Guizhou Province(Grant No.20183001)+2 种基金the Foundation of Guizhou Provincial Key Laboratory of Public Big Data(Grant No.2018BDKFJJ016)the Foundation of State Key Laboratory of Public Big Data(Grant No.2018BDKFJJ018)Beijing Natural Science Foundation(Grant No.4174089).
文摘To ensure the security during the communication,we often adopt different ways to encrypt the messages to resist various attacks.However,with the computing power improving,the existing encryption and authentication schemes are being faced with big challenges.We take the message authentication as an example into a careful consideration.Then,we proposed a new message authentication scheme with the Advanced Encryption Standard as the encryption function and the new quantum Hash function as the authentication function.Firstly,the Advanced Encryption Standard algorithm is used to encrypt the result of the initial message cascading the corresponding Hash values,which ensures that the initial message can resist eavesdropping attack.Secondly,utilizing the new quantum Hash function with quantum walks can be much more secure than traditional classical Hash functions with keeping the common properties,such as one-wayness,resisting different collisions and easy implementation.Based on these two points,the message authentication scheme can be much more secure than previous ones.Finally,it is a new way to design the message authentication scheme,which provides a new thought for other researchers in the future.Our works will contribute to the study on the new encryption and authentication functions and the combination of quantum computing with traditional cryptology in the future.
基金supported by National Natural Science Foundation of China(61872152)the Major Program of Guangdong Basic and Applied Research(2019B030302008)Science and Technology Program of Guangzhou(201902010081).
文摘Functional encryption(FE)is a novel paradigm for encryption scheme which allows tremendous flexibility in accessing encrypted information.In FE,a user can learn specific function of encrypted messages by restricted functional key and reveal nothing else about the messages.Inner product encryption(IPE)is a special type of functional encryption where the decryption algorithm,given a ciphertext related to a vector x and a secret key related to a vector y,computes the inner product x·y.In this paper,we construct an efficient private-key functional encryption(FE)for inner product with simulation-based security,which is much stronger than indistinguishability-based security,under the External Decisional Linear assumption in the standard model.Compared with the existing schemes,our construction is faster in encryption and decryption,and the master secret key,secret keys and ciphertexts are shorter.
