Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been ...Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.展开更多
To numerically solve the initial-boundary value problem of the Korteweg-de Vries equation,an equivalent coupled system of nonlinear equations is obtained by the method of reduction of order.Then,a difference scheme is...To numerically solve the initial-boundary value problem of the Korteweg-de Vries equation,an equivalent coupled system of nonlinear equations is obtained by the method of reduction of order.Then,a difference scheme is constructed for the system.The new variable introduced can be separated from the difference scheme to obtain another difference scheme containing only the original variable.The energy method is applied to the theoretical analysis of the difference scheme.Results show that the difference scheme is uniquely solvable and satisfies the energy conservation law corresponding to the original problem.Moreover,the difference scheme converges when the step ratio satisfies a constraint condition,and the temporal and spatial convergence orders are both two.Numerical examples verify the convergence order and the invariant of the difference scheme.Furthermore,the step ratio constraint is unnecessary for the convergence of the difference scheme.Compared with a known two-level nonlinear difference scheme,the proposed difference scheme has more advantages in numerical calculation.展开更多
A group of asymmetric difference schemes to approach the Korteweg-de Vries (KdV) equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segme...A group of asymmetric difference schemes to approach the Korteweg-de Vries (KdV) equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.展开更多
A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify h...A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.展开更多
In order to simulate a linear stochastic oscillator with additive noise,improved nonstandard optimal(INSOPT) schemes are derived utilizing the nonstandard finite difference(NSFD)technique and the improvement technique...In order to simulate a linear stochastic oscillator with additive noise,improved nonstandard optimal(INSOPT) schemes are derived utilizing the nonstandard finite difference(NSFD)technique and the improvement technique.These proposed schemes reproduce long time features of the oscillator solution exactly.Their abilities in preserving the symplecticity,the linear growth property of the second moment and the oscillation property of the solution of the stochastic oscillator system on long time interval are studied.It can be shown that the component { x_n}_(n≥1) of the INSOPT schemes switch signs infinitely many times as n →∞,almost surely.Further,the mean-square convergence order of 1 is obtained for these INSOPT schemes.Finally,numerical experiments illustrate intuitively the results obtained in this paper.展开更多
In this paper a singularly perturbed linear second order hyperbolic problem with zeroth order reduced equation is discussed. Firstly, an energy inequality of the solution and an estimate of the remainder term of the a...In this paper a singularly perturbed linear second order hyperbolic problem with zeroth order reduced equation is discussed. Firstly, an energy inequality of the solution and an estimate of the remainder term of the asymptotic solution are given. Then an exponentially fitted difference scheme is developed in an equidistant mesh. Finally, uniform convergence in small parameter is proved in the sense of discrete energy norm.展开更多
In this paper, combining the idea of difference method and finite element method, we construct a difference scheme for a self-adjoint problem in conservation form. Its solution uniformly converges to that of the origi...In this paper, combining the idea of difference method and finite element method, we construct a difference scheme for a self-adjoint problem in conservation form. Its solution uniformly converges to that of the original differential equation problem with order h3.展开更多
为解决医疗云平台共享个人健康档案(personal health record,PHR)存在的隐私泄露和加解密效率不理想的问题,以医疗云平台中帕金森病患者的转诊场景为例,提出了一种基于线性秘密共享的改进密文属性代理重加密方案(improved linear secret...为解决医疗云平台共享个人健康档案(personal health record,PHR)存在的隐私泄露和加解密效率不理想的问题,以医疗云平台中帕金森病患者的转诊场景为例,提出了一种基于线性秘密共享的改进密文属性代理重加密方案(improved linear secret sharing based ciphertext attribute proxy re-encryption scheme,LCPS)。该方案利用线性秘密共享技术来隐藏访问策略中的隐私属性,降低因访问策略暴露引发的隐私泄露风险;该方案还对代理重加密算法进行改进,通过减少复杂的双线性运算,提高了加解密效率。结果表明,LCPS在加解密方面的表现要优于其他方案。在判定性q-BDHE(q-decisional bilinear Diffie-Hellman exponent)困难假设下具有选择明文攻击时的不可区分性(indistinguishability under chosen-plaintext attack,IND-CPA)。该方案具有可移植性,同样适用于医疗云中其他病症转诊时的个人健康档案安全共享。展开更多
Linear Least Squares(LLS) problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics...Linear Least Squares(LLS) problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm(SAIA) is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.展开更多
Chaos synchronization of systems with perturbations was investigated.A generic nonlinear control scheme to realize chaos synchronization of systems was proposed.This control scheme is flexible and practicable,and give...Chaos synchronization of systems with perturbations was investigated.A generic nonlinear control scheme to realize chaos synchronization of systems was proposed.This control scheme is flexible and practicable,and gives more freedom in designing controllers in order to achieve some desired performance.With the aid of Lyapunov stability theorem and partial stability theory,two cases were presented:1) Chaos synchronization of the system without perturbation or with vanishing perturbations;2) The boundness of the error state for the system with nonvanishing perturbations satisfying some conditions.Finally,several simulations for Lorenz system were provided to verify the effectiveness and feasibility of our method.Compared numerically with the existing results of linear feedback control scheme,the results are sharper than the existing ones.展开更多
基金The project is provided funding by the Natural Science Foundation of China(Nos.62272124,2022YFB2701400)the Science and Technology Program of Guizhou Province(No.[2020]5017)+3 种基金the Research Project of Guizhou University for Talent Introduction(No.[2020]61)the Cultivation Project of Guizhou University(No.[2019]56)the Open Fund of Key Laboratory of Advanced Manufacturing Technology,Ministry of Education,GZUAMT2021KF[01]the Postgraduate Innovation Program in Guizhou Province(No.YJSKYJJ[2021]028).
文摘Cloud-based services have powerful storage functions and can provide accurate computation.However,the question of how to guarantee cloud-based services access control and achieve data sharing security has always been a research highlight.Although the attribute-based proxy re-encryption(ABPRE)schemes based on number theory can solve this problem,it is still difficult to resist quantum attacks and have limited expression capabilities.To address these issues,we present a novel linear secret sharing schemes(LSSS)matrix-based ABPRE scheme with the fine-grained policy on the lattice in the research.Additionally,to detect the activities of illegal proxies,homomorphic signature(HS)technology is introduced to realize the verifiability of re-encryption.Moreover,the non-interactivity,unidirectionality,proxy transparency,multi-use,and anti-quantum attack characteristics of our system are all advantageous.Besides,it can efficiently prevent the loss of processing power brought on by repetitive authorisation and can enable precise and safe data sharing in the cloud.Furthermore,under the standard model,the proposed learning with errors(LWE)-based scheme was proven to be IND-sCPA secure.
基金The National Natural Science Foundation of China(No.11671081).
文摘To numerically solve the initial-boundary value problem of the Korteweg-de Vries equation,an equivalent coupled system of nonlinear equations is obtained by the method of reduction of order.Then,a difference scheme is constructed for the system.The new variable introduced can be separated from the difference scheme to obtain another difference scheme containing only the original variable.The energy method is applied to the theoretical analysis of the difference scheme.Results show that the difference scheme is uniquely solvable and satisfies the energy conservation law corresponding to the original problem.Moreover,the difference scheme converges when the step ratio satisfies a constraint condition,and the temporal and spatial convergence orders are both two.Numerical examples verify the convergence order and the invariant of the difference scheme.Furthermore,the step ratio constraint is unnecessary for the convergence of the difference scheme.Compared with a known two-level nonlinear difference scheme,the proposed difference scheme has more advantages in numerical calculation.
基金Project supported by the National Natural Science Foundation of China(No.10671113)the Natural Science Foundation of Shandong Province of China(No.Y2003A04)
文摘A group of asymmetric difference schemes to approach the Korteweg-de Vries (KdV) equation is given here. According to such schemes, the full explicit difference scheme and the full implicit one, an alternating segment explicit-implicit difference scheme for solving the KdV equation is constructed. The scheme is linear unconditionally stable by the analysis of linearization procedure, and is used directly on the parallel computer. The numerical experiments show that the method has high accuracy.
文摘A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.
基金National Natural Science Foundation of China(No.11571373)
文摘In order to simulate a linear stochastic oscillator with additive noise,improved nonstandard optimal(INSOPT) schemes are derived utilizing the nonstandard finite difference(NSFD)technique and the improvement technique.These proposed schemes reproduce long time features of the oscillator solution exactly.Their abilities in preserving the symplecticity,the linear growth property of the second moment and the oscillation property of the solution of the stochastic oscillator system on long time interval are studied.It can be shown that the component { x_n}_(n≥1) of the INSOPT schemes switch signs infinitely many times as n →∞,almost surely.Further,the mean-square convergence order of 1 is obtained for these INSOPT schemes.Finally,numerical experiments illustrate intuitively the results obtained in this paper.
文摘In this paper a singularly perturbed linear second order hyperbolic problem with zeroth order reduced equation is discussed. Firstly, an energy inequality of the solution and an estimate of the remainder term of the asymptotic solution are given. Then an exponentially fitted difference scheme is developed in an equidistant mesh. Finally, uniform convergence in small parameter is proved in the sense of discrete energy norm.
文摘In this paper, combining the idea of difference method and finite element method, we construct a difference scheme for a self-adjoint problem in conservation form. Its solution uniformly converges to that of the original differential equation problem with order h3.
文摘为解决医疗云平台共享个人健康档案(personal health record,PHR)存在的隐私泄露和加解密效率不理想的问题,以医疗云平台中帕金森病患者的转诊场景为例,提出了一种基于线性秘密共享的改进密文属性代理重加密方案(improved linear secret sharing based ciphertext attribute proxy re-encryption scheme,LCPS)。该方案利用线性秘密共享技术来隐藏访问策略中的隐私属性,降低因访问策略暴露引发的隐私泄露风险;该方案还对代理重加密算法进行改进,通过减少复杂的双线性运算,提高了加解密效率。结果表明,LCPS在加解密方面的表现要优于其他方案。在判定性q-BDHE(q-decisional bilinear Diffie-Hellman exponent)困难假设下具有选择明文攻击时的不可区分性(indistinguishability under chosen-plaintext attack,IND-CPA)。该方案具有可移植性,同样适用于医疗云中其他病症转诊时的个人健康档案安全共享。
基金supported by Open Fund of Engineering Laboratory of Spatial Information Technology of Highway Geological Disaster Early Warning in Hunan Province(Changsha University of Science&Technology,kfj150602)Hunan Province Science and Technology Program Funded Projects,China(2015NK3035)+1 种基金the Land and Resources Department Scientific Research Project of Hunan Province,China(2013-27)the Education Department Scientific Research Project of Hunan Province,China(13C1011)
文摘Linear Least Squares(LLS) problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm(SAIA) is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.
基金Projects(61075065,60774045,U1134108) supported by the National Natural Science Foundation of ChinaProject(20110162110041) supported by the Ph.D Programs Foundation of Ministry of Education of ChinaProject(CX2011B086) supported by Hunan Provincial Innovation Foundation For Postgraduate,China
文摘Chaos synchronization of systems with perturbations was investigated.A generic nonlinear control scheme to realize chaos synchronization of systems was proposed.This control scheme is flexible and practicable,and gives more freedom in designing controllers in order to achieve some desired performance.With the aid of Lyapunov stability theorem and partial stability theory,two cases were presented:1) Chaos synchronization of the system without perturbation or with vanishing perturbations;2) The boundness of the error state for the system with nonvanishing perturbations satisfying some conditions.Finally,several simulations for Lorenz system were provided to verify the effectiveness and feasibility of our method.Compared numerically with the existing results of linear feedback control scheme,the results are sharper than the existing ones.