Processing math: 90%
Research article Special Issues

Novel efficient lattice-based IBE schemes with CPK for fog computing

  • The data security of fog computing is a key problem for the Internet of things. Identity-based encryption (IBE) from lattices is extremely suitable for fog computing. It is able to not only simplify certificate management, but also resist quantum attacks. In this paper, firstly, we construct a novel efficient lattice-based IBE scheme with Combined Public Key (CPK) technique by keeping from consumptive trapdoor generation algorithm and preimage sampling algorithm, which is required by the existing lattice-based IBE schemes based on learning with errors (LWE). In addition, its key storage cost is lower and it is IND-ID-CPA secure in the random oracle model. Furthermore, based on this, an enhanced lattice-based IBE scheme with IND-ID-CCA security is developed by employing strong one-time signature. Our schemes only need O(n3/log n) additions of vectors, while the existing schemes need at least O(n3) of additions and multiplications in Setup and Extract phase.

    Citation: Yanfeng Shi, Shuo Qiu, Jiqiang Liu, Tinghuai Ma. Novel efficient lattice-based IBE schemes with CPK for fog computing[J]. Mathematical Biosciences and Engineering, 2020, 17(6): 8105-8122. doi: 10.3934/mbe.2020411

    Related Papers:

    [1] Alessandra De Luca, Veronica Felli . Unique continuation from the edge of a crack. Mathematics in Engineering, 2021, 3(3): 1-40. doi: 10.3934/mine.2021023
    [2] M. M. Bhatti, Efstathios E. Michaelides . Oldroyd 6-constant Electro-magneto-hydrodynamic fluid flow through parallel micro-plates with heat transfer using Darcy-Brinkman-Forchheimer model: A parametric investigation. Mathematics in Engineering, 2023, 5(3): 1-19. doi: 10.3934/mine.2023051
    [3] Franco Flandoli, Eliseo Luongo . Heat diffusion in a channel under white noise modeling of turbulence. Mathematics in Engineering, 2022, 4(4): 1-21. doi: 10.3934/mine.2022034
    [4] Giacomo Ascione, Daniele Castorina, Giovanni Catino, Carlo Mantegazza . A matrix Harnack inequality for semilinear heat equations. Mathematics in Engineering, 2023, 5(1): 1-15. doi: 10.3934/mine.2023003
    [5] Massimiliano Giona, Luigi Pucci . Hyperbolic heat/mass transport and stochastic modelling - Three simple problems. Mathematics in Engineering, 2019, 1(2): 224-251. doi: 10.3934/mine.2019.2.224
    [6] Youchan Kim, Seungjin Ryu, Pilsoo Shin . Approximation of elliptic and parabolic equations with Dirichlet boundary conditions. Mathematics in Engineering, 2023, 5(4): 1-43. doi: 10.3934/mine.2023079
    [7] Mario Pulvirenti . On the particle approximation to stationary solutions of the Boltzmann equation. Mathematics in Engineering, 2019, 1(4): 699-714. doi: 10.3934/mine.2019.4.699
    [8] Anoumou Attiogbe, Mouhamed Moustapha Fall, El Hadji Abdoulaye Thiam . Nonlocal diffusion of smooth sets. Mathematics in Engineering, 2022, 4(2): 1-22. doi: 10.3934/mine.2022009
    [9] Boumediene Abdellaoui, Ireneo Peral, Ana Primo . A note on the Fujita exponent in fractional heat equation involving the Hardy potential. Mathematics in Engineering, 2020, 2(4): 639-656. doi: 10.3934/mine.2020029
    [10] Carmen Cortázar, Fernando Quirós, Noemí Wolanski . Decay/growth rates for inhomogeneous heat equations with memory. The case of large dimensions. Mathematics in Engineering, 2022, 4(3): 1-17. doi: 10.3934/mine.2022022
  • The data security of fog computing is a key problem for the Internet of things. Identity-based encryption (IBE) from lattices is extremely suitable for fog computing. It is able to not only simplify certificate management, but also resist quantum attacks. In this paper, firstly, we construct a novel efficient lattice-based IBE scheme with Combined Public Key (CPK) technique by keeping from consumptive trapdoor generation algorithm and preimage sampling algorithm, which is required by the existing lattice-based IBE schemes based on learning with errors (LWE). In addition, its key storage cost is lower and it is IND-ID-CPA secure in the random oracle model. Furthermore, based on this, an enhanced lattice-based IBE scheme with IND-ID-CCA security is developed by employing strong one-time signature. Our schemes only need O(n3/log n) additions of vectors, while the existing schemes need at least O(n3) of additions and multiplications in Setup and Extract phase.


    Cloaking using transformation optics (changes of variables) was introduced by Pendry, Schurig and Smith [30] for the Maxwell system and by Leonhardt [16] in the geometric optics setting. These authors used a singular change of variables, which blows up a point into a cloaked region. The same transformation had been used to establish (singular) non-uniqueness in Calderon's problem in [10]. To avoid using the singular structure, various regularized schemes have been proposed. One of them was suggested by Kohn, Shen, Vogelius and Weinstein [11], where instead of a point, a small ball of radius ε is blown up to the cloaked region. Approximate cloaking for acoustic waves has been studied in the quasistatic regime [11,26], the time harmonic regime [12,19,27,20], and the time regime [28,29], and approximate cloaking for electromagnetic waves has been studied in the time harmonic regime [4,14,24], see also the references therein. Finite energy solutions for the singular scheme have been studied extensively [9,32,33]. There are also other ways to achieve cloaking effects, such as the use of plasmonic coating [2], active exterior sources [31], complementary media [13,22], or via localized resonance [23] (see also [17,21]).

    The goal of this paper is to investigate approximate cloaking for the heat equation using transformation optics. Thermal cloaking via transformation optics was initiated by Guenneau, Amra and Venante [8]. Craster, Guenneau, Hutridurga and Pavliotis [6] investigate the approximate cloaking for the heat equation using the approximate scheme in the spirit of [11]. They show that for the time large enough, the largeness depends on ε, the degree of visibility is of the order εd (d=2,3) for sources that are independent of time. Their analysis is first based on the fact that as time goes to infinity, the solutions converge to the stationary states and then uses known results on approximate cloaking in the quasistatic regime [11,26].

    In this paper, we show that approximate cloaking is achieved at any positive time and established the degree of invisibility of order ε in three dimensions and |lnε|1 in two dimensions. Our results hold for a general source that depends on both time and space variables, and our estimates depend only on the range of the materials inside the cloaked region. The degree of visibility obtained herein is optimal due to the fact that a finite time interval is considered (compare with [6]). The analysis in this paper is of frequency type via Fourier transform with respect to time. This approach is robust and can be used in different context. A technical issue is on the blow up of the fundamental solution of the Helmholtz type equations in two dimensions in the low frequency regime. We emphasize that even though our setting is in a bounded domain, we employs Fourier transform in time instead of eigenmodes decomposition. This has the advantage that one can put the non-perturbed system and the cloaking system in the same context.

    We next describe the problem in more detail and state the main result. Our starting point is the regularization scheme [11] in which a transformation blows up a small ball Bε (0<ε<1/2) instead of a point into the cloaked region B1 in Rd (d=2,3). Here and in what follows, for r>0, Br denotes the ball centered at the origin and of radius r in Rd. Our assumption on the geometry of the cloaked region is mainly to simplify the notations. Concerning the transformation, we consider the map Fε:RdRd defined by

    Fε(x)={x in RdB2,(22ε2ε+|x|2ε)x|x| in B2Bε,xε in Bε. (1.1)

    In what follows, we use the standard notations

    FA(y)=F(x)A(x)FT(x)|detF(x)|,Fρ(y)=ρ(x)|detF(x)|,x=F1(y), (1.2)

    for the "pushforward" of a symmetric, matrix-valued function A, and a scalar function ρ, by the diffeomorphism F, and I denotes the identity matrix. The cloaking device in the region B2B1 constructed from the transformation technique is given by

    (FεI,Fε1) in B2B1, (1.3)

    a pair of a matrix-valued function and a function that characterize the material properties in B2B1. Physically, this is the pair of the thermal diffusivity and the mass density of the material.

    Let Ω with B2ΩRd (d=2,3)* be a bounded region for which the heat flow is considered. Suppose that the medium outside B2 (the cloaking device and the cloaked region) is homogeneous so that it is characterized by the pair (I,1), and the cloaked region B1 is characterized by a pair (aO,ρO) where aO is a matrix-valued function and ρO is a real function, both defined in B1. The medium in Ω is then given by

    *The notation DΩ means that the closure of D is a subset of Ω.

    (Ac,ρc)={(I,1) in ΩB2,(FεI,Fε1) in B2B1,(aO,ρO) in B1. (1.4)

    In what follows, we make the usual assumption that aO is symmetric and uniformly elliptic and ρO is a positive function bounded above and below by positive constants, i.e., for a.e. xB1,

    Λ1|ξ|2aO(x)ξ,ξΛ|ξ|2 for all ξRd, (1.5)

    and

    Λ1ρO(x)Λ, (1.6)

    for some Λ1. Given a function fL1((0,+),L2(Ω)) and an initial condition u0L2(Ω), in the medium characterzied by (Ac,ρc), one obtains a unique weak solution ucL2((0,);H1(Ω)) C([0,+);L2(Ω)) of the system

    {t(ρcuc)div(Acuc)=f in (0,+)×Ω,uc=0 on (0,+)×Ω,uc(t=0,)=u0 in Ω, (1.7)

    and in the homogeneneous medium characterized by (I,1), one gets a unique weak solution uL2((0,);H1(Ω))C([0,+);L2(Ω)) of the system

    {tuΔu=f in (0,+)×Ω,uc=0 on (0,+)×Ω,uc(t=0,)=u0 in Ω. (1.8)

    The approximate cloaking meaning of the scheme (1.4) is given in the following result:

    Theorem 1.1. Let u0L2(Ω) and fL1((0,+);L2(Ω)) be such that suppu0,suppf(t,)ΩB2 for t>0. Assume that uc and u are the solution of (1.7) and (1.8) respectively. Then, for 0<ε<1/2,

    uc(t,)u(t,)H1(ΩB2)Ce(ε,d)(fL1((0,+);L2(Ω))+u0L2(Ω)),

    for some positive constant C depending on Λ but independent of f, u0, and ε, where

    e(ε,d)={εif d=3,|lnε|1if d=2.

    As a consequence of Theorem 1.1, limε0uc(t,)=u(t,) in (0,+)×(ΩB2) for all f with compact support outside (0,+)×B2 and for all u0 with compact support outside B2. One therefore cannot detect the difference between (Ac,ρc) and (I,1) as ε0 by observation of uc outside B2: Cloaking is achieved for observers outside B2 in the limit as ε0.

    We now briefly describe the idea of the proof. The starting point of the analysis is the invariance of the heat equations under a change of variables which we now state.

    Lemma 1.1. Let d2, T>0, Ω be a bounded open subset of Rd of class C1, and let A be an elliptic symmetric matrix-valued function, and ρ be a bounded, measurable function defined on Ω bounded above and below by positive constants. Let F:ΩΩ be bijective such that F and F1 are Lipschitz, detF>c for a.e. xΩ for some c>0, and F(x)=x near Ω. Let fL1((0,T);L2(Ω)) and u0L2(Ω). Then uL2((0,T);H10(Ω))C([0,T);L2(Ω)) is the weak solution of

    {t(ρu)div(Au)=fin ΩT,u=0on (0,T)×Ω,u(0,)=u0in Ω, (1.9)

    if and only if v(t,):=u(t,)F1L2((0,T);H10(Ω))C([0,T);L2(Ω)) is the weak solution of

    {t(Fρv)div(FAv)=Ffin ΩT,u=0on (0,T)×Ω,v(0,)=u0F1in Ω. (1.10)

    Recall that F is defined in (1.2). In this paper, we use the following standard definition of weak solutions:

    Definition 1.1. Let d2 and T>0. We say a function

    uL2((0,T);H10(Ω))C([0,T);L2(Ω))

    is a weak solution to (1.9) if u(0,)=u0 in Ω and u satisfies

    ddtΩρu(t,)φ+ΩAu(t,)φ=Ωf(t,)φ in (0,T), (1.11)

    in the distributional sense for all φH10(Ω).

    The existence and uniqueness of weak solutions are standard, see, e.g., [1] (in fact, in [1], f is assumed in L2((0,T);L2(Ω)), however, the conclusion holds also for fL1((0,T);L2(Ω)) with a similar proof, see, e.g., [25]). The proof of Lemma 1.1 is similar to that of the Helmholtz equation, see, e.g., [12] (see also [6] for a parabolic version).

    We now return to the idea of the proof of Theorem 1.1. Set

    uε(t,)=uc(t,)F1ε for t(0,+).

    Then uε is the unique solution of the system

    {t(ρεuε)div(Aεuε)=f in (0,+)×Ω,uε=0 on (0,+)×Ω,uε(t=0,)=u0 in Ω, (1.12)

    where

    (Aε,ρε)={(I,1) in ΩBε,(ε2daO(/ε),εdρO(/ε)) in Bε. (1.13)

    Moreover,

    ucu=uεu in (0,+)×(ΩB2).

    In comparing the coefficients of the systems verified by u and uε, the analysis can be derived from the study of the effect of a small inclusion Bε. The case in which finite isotropic materials contain inside the small inclusion was investigated in [3] (see also [5] for a related context). The analysis in [3] partly involved the polarization tensor information and took the advantage of the fact that the coefficients inside the small inclusion are finite. In the cloaking context, Craster et al. [6] derived an estimate of the order εd for a time larger than a threshold one. Their analysis is based on long time behavior of solutions to parabolic equations and estimates for the degree of visibility of the conducting problem, see [11,26], hence the threshold time goes to infinity as ε0.

    In this paper, to overcome the blow up of the coefficients inside the small inclusion and to achieve the cloaking effect at any positive time, we follow the approach of Nguyen and Vogelius in [28]. The idea is to derive appropriate estimates for the effect of small inclusions in the time domain from the ones in the frequency domain using the Fourier transform with respect to time. Due to the dissipative nature of the heat equation, the problem in the frequency for the heat equation is more stable than the one corresponding to the acoustic waves, see, e.g., [27,28], and the analysis is somehow easier to handle in the high frequency regime. After using a standard blow-up argument, a technical point in the analysis is to obtain an estimate for the solutions of the equation Δv+iωε2v=0 in RdB1 (ω>0) at the distance of the order 1/ε in which the dependence on ε and ω are explicit (see Lemma 2.2). Due to the blow up of the fundamental solution in two dimensions, the analysis requires new ideas. We emphasize that even though our setting is in a bounded domain with zero Dirichlet boundary condition, we employs Fourier transform in time instead of eigenmodes decomposition as in [6] to put both systems of uε and u in the same context.

    To implement the analysis in the frequency domain, let us introduce the Fourier transform with respect to time t:

    ˆφ(k,x)=Rφ(t,x)eiktdt for kR, (2.1)

    for φL2((,+),L2(Rd)). Extending u,uc, uρ and f by 0 for t<0, and considering the Fourier with respect to time at the frequency ω>0, we obtain

    Δˆu+iωˆu=(ˆf+u0) in Ω,

    and

    div(Aεˆuε)+iωρεˆuε=(ˆf+u0) in Ω,

    where

    (Aε,ρε)={(I,1) in ΩBε,(ε2daO(/ε),εdρO(/ε)) in Bε.

    The main ingredient in the proof of Theorem 1.1 is the following:

    Proposition 2.1. Let ω>0, 0<ε<1/2, and let gL2(Ω) with suppgΩB2. Assume that v,vεH1(Ω) are respectively the unique solution of the systems

    {Δv+iωv=gin Ω,v=0on Ω,

    and

    {div(Aεvε)+iωρεvε=gin Ω,vε=0on Ω.

    We have

    vεvH1(ΩB2)Ce(ε,ω,d)(1+ω1/2)gL2(Ω), (2.2)

    for some positive constant C independent of ε, ω and g. Here

    e(ε,ω,3)=εeω1/2/4, (2.3)

    and

    e(ε,ω,2)={eω1/2/4/|lnε|if ω1/2,lnω/ln(ωε)if 0<ω<1/2. (2.4)

    The rest of this section is divided into three subsections. In the first subsection, we present several lemmas used in the proof of Proposition 2.1. The proofs of Proposition 2.1 and Theorem 1.1 are then given in the second and the third subsections, respectively.

    In this subsection, we state and prove several useful lemmas used in the proof of Proposition 2.1. Throughout, DB1 denotes a smooth, bounded, open subset of Rd such that RdD is connected, and ν denotes the unit normal vector field on D, directed into RdD.

    The first result is the following simple one:

    Lemma 2.1. Let d=2,3, k>0, and let vH1(RdD) be such that Δv+ikv=0 in RdD. We have, for R>2,

    vH1(BRD)CR(1+k)vH1/2(D), (2.5)

    for some positive constants CR independent of k and v.

    Proof. Multiplying the equation by ˉv (the conjugate of v) and integrating by parts, we have

    RdD|v|2ikRdD|v|2=Dνvˉv.

    This implies

    RdD|v|2+kRdD|v|2CνvH1/2(D)vH1/2(D). (2.6)

    Here and in what follows, C denotes a positive constant independent of v and k. Since Δv=ikv in B2D, by the trace theory, see, e.g., [7,Theorem 2.5], we have

    νvH1/2(D)C(vL2(B2D)+ΔvL2(B2D))C(vL2(B2D)+kvL2(B2D)). (2.7)

    Combining (2.6) and (2.7) yields

    RdD|v|2+kRdD|v|2C(1+k)v2H1/2(D). (2.8)

    The conclusion follows when k1.

    Next, consider the case 0<k<1. In the case where d=3, the conclusion is a direct consequence of (2.8) and the Hardy inequality (see, e.g., [18,Lemma 2.5.7]):

    R3D|v|2|x|2CR3D|v|2. (2.9)

    We next consider the case where d=2. One just needs to show

    BRD|v|2Cv2H1/2(D). (2.10)

    By the Hardy inequality (see, e.g., [18,Lemma 2.5.7]),

    R2D|v|2|x|2ln(2+|x|)2C(R2D|v|2+B2D|v|2), (2.11)

    it suffices to prove (2.10) for R=2 by contradiction. Suppose that there exists a sequence (kn)0 and a sequence (vn)H1(R2D) such that

    Δvn+iknvn=0 in R2D,vnL2(B2D)=1, and limn+vnH1/2(D)=0.

    Denote

    W1(R2D)={uL1loc(R2D);u(x)ln(2+|x|)1+|x|2L2(R2D) and uL2(R2D)}.

    By (2.8) and (2.11), one might assume that vn converges to v weakly in H1loc(R2D) and strongly in L2(B2D). Moreover, vW1(R2D) and v satisfies

    Δv=0 in R2D,v=0 on D, (2.12)

    and

    vL2(B2D)=1. (2.13)

    From (2.12), we have v=0 in R2D (see, e.g., [18]) which contradicts (2.13). The proof is complete.

    We also have

    Lemma 2.2. Let d=2,3, ω>0, 0<ε<1/2, and let vH1(RdD) be a solution of Δv+iωε2v=0 in RdD. We have, for 3/2<|x|<R,

    |v(x/ε)|Ce(ε,ω,d)vH1/2(D), (2.14)

    for some positive constant C=CR independent of ε, ω and v.

    Recall that e(ε,ω,d) is given in (2.3) and (2.4).

    Proof. By the trace theory and the regularity theory of elliptic equations, we have

    vL2(B2)+vL2(B2)CvH2(B5/2B3/2)C(1+ω1/2ε)vH1(B3B1). (2.15)

    It follows from Lemma 2.1 that

    vL2(B2)+vL2(B2)C(1+ω3/2)vH1/2(D). (2.16)

    Here and in what follows in this proof, C denotes a positive constant depending only on R and D.

    The representation formula gives

    v(x)=B2(G(x,y)rv(y)ryG(x,y)v(y))dy for xRdˉB2, (2.17)

    where =eiπ/4εω1/2, and, for xy,

    G(x,y)=ei|xy|4π|xy| if d=3 and G(x,y)=i4H(1)0(|xy|) if d=2.

    Here H(1)0 is the Hankel function of the first kind of order 0. Recall, see, e.g., [15,Chapter 5], that

    H(1)0(z)=2iπln|z|2+1+2iγπ+O(|z|2log|z|) as z0,z(,0], (2.18)

    and

    H(1)0(z)=2πzei(z+π4)(1+O(|z|1))z,z(,0]. (2.19)

    We now consider the case d=3. We have, for 3/2<|x|<R and yB2,

    |ei|x/εy||e22ω1/2|xεy|eω1/2|x|/3.

    It follows that, for 3/2<|x|<R and yB2,

    |G(x/ε,y)|Cεe3ω1/2/10. (2.20)

    Similarly, one has, for 3/2<|x|<R and yB2,

    |ryG(x/ε,y)|C(ε2ω1/2|x|+ε2|x|2)eω1/2|x|/3Cεe3ω1/2/10. (2.21)

    Combining (2.17), (2.20) and (2.21) yields

    |v(x/ε)|Cεe3ω1/2/10(vL2(B2)+vL2(B2)) for 3/2<|x|<R.

    We derive from (2.16) that

    |v(x/ε)|Cεeω1/2/4vH1/2(D) for 3/2<|x|<R;

    which is the conclusion in the case d=3.

    We next deal with the case where d=2 and ω>ε2/4, which is equivalent to ||>1/2. From (2.19), we derive that, for 3/2<|x|<R and yB2,

    |G(x/ε,y)|Cω1/4e3ω1/2/10 and |ryG(x/ε,y)|Cεω1/4e3ω1/2/10. (2.22)

    Using (2.16) and combining (2.17) and (2.22), we obtain, since ω>ε2/4,

    |v(x/ε)|Cεeω1/2/4vH1/2(D) for 3/2<|x|<R,

    which gives the conclusion in this case.

    We finally deal with the case where d=2 and 0<ω<ε2/4, which is equivalent to ||<1/2. From (2.17), we obtain, for xB4,

    v(x)=B2([G(x,y)G(x,0)]rv(y)ryG(x,y)v(y))dy+B2G(x,0)rv(y)dy. (2.23)

    Since d=2, we have

    vL(B5B3)CvH2(B5B3)CvH2(B5B2)C(1+ω1/2)vH1(B6B1).

    It follows from Lemma 2.1 and the trace theory that

    vL(B5B3)+vL2(B2)+vL2(B2)C(1+ω3/2)vH1/2(D). (2.24)

    Since, by (2.18),

    |yG(x,y)|C for xB4 and yB2

    and

    |G(x,0)|C|ln||| for xB4,

    we derive from (2.23) and (2.24) that

    |B2rv(y)dy|C(1+ω3/2)|ln|||vH1/2(D). (2.25)

    Again using (2.17), we get, for 3/2<|x|<R,

    v(x/ε)=B2([G(x/ε,y)G(x/ε,0)]rv(y)ryG(x/ε,y)v(y))dy+B2G(x/ε,0)rv(y)dy. (2.26)

    Since, by (2.18), for 0<ω<1/2,

    |G(x/ε,0)|C|lnω| and |yG(x/ε,y)|Cε for 3/2<|x|<R,yB2,

    and, by (2.19), for 1/2<ω<ε2/4,

    |G(x/ε,0)|Cω1/4e3ω1/2/10 and |yG(x/ε,y)|Cεω1/4e3ω1/2/10 for 3/2<|x|<R,yB2,

    we derive from (2.24), (2.25) and (2.26) that, for 3/2<|x|<R,

    |v(x/ε)|{C|lnω||ln|||vH1/2(D) if 0<ω<1/2,Cω3/2e3ω1/2/10|ln|||vH1/2(D) if 1/2<ω<ε2/4,

    which yields the conclusion in the case 0<ω<ε2/4. The proof is complete.

    In this proof, C denotes a positive constant depending only on Ω and Λ. Multiplying the equation of vε by ˉvε and integrating in Ω, we derive that

    ΩAεvε,vε+ωΩρε|vε|2Cg2L2(Ω). (2.27)

    Here we used Poincaré's inequality

    vεL2(Ω)CvεL2(Ω).

    It follows from (2.27) that

    vε(ε)2H1/2(B1)Cvε(ε)2H1(B1)CBε1εd2|vε|2+1εd|vε|2C(1+ω1)g2L2(Ω). (2.28)

    Similarly, using the equation for v and Poincaré's inequality, we get

    vH1(Ω)CgL2(Ω). (2.29)

    Since Δv+iωv=0 in B2, using Caccioppolli's inequality, we have

    vH3(B1)CvH2(B3/2)CvH1(B2)CgL2(Ω). (2.30)

    By Sobolev embedding, as d3,

    vW1,(B1)CvH3(B1). (2.31)

    It follows that

    v(ε)H1/2(B1)Cv(ε)H1(B1)CvW1,(B1)CgL2(Ω). (2.32)

    Set

    wε=vεv in ΩBε.

    Then wεH1(ΩBε) and satisfies

    {Δwε+iωwε=0 in ΩBε,wε=vεv on Bε,wε=0 on Ω. (2.33)

    Let ˜wεH1(RdBε) be the unique solution of the system

    {Δ˜wε+iω˜wε=0 in RdBε,˜wε=wε on Bε, (2.34)

    and set

    ˜Wε=˜wε(ε) in RdB1.

    Then \widetilde W_{\varepsilon} \in H^1(\mathbb{R}^d \setminus B_{1}) is the unique solution of the system

    \begin{equation} \left\{ \begin{array}{cl} \Delta \widetilde W_{\varepsilon} + i \omega \varepsilon^2 \widetilde W_{\varepsilon} = 0 & \mbox{ in } \mathbb{R}^d \setminus B_{1}, \\[6pt] \widetilde W_{\varepsilon} = w_\varepsilon (\varepsilon \, \cdot \, ) & \mbox{ on } \partial B_{1}. \end{array}\right. \end{equation} (2.35)

    Fix r_0 > 2 such that \Omega \subset B_{r_0} . By Lemma 2.2, we have, for 1 \le |x| < r_0 , that

    \begin{equation*} | \widetilde W_{\varepsilon} (x / \varepsilon)| \le C e(\varepsilon, \omega, d) \|w_\varepsilon (\varepsilon \, \cdot \, ) \|_{H^{1/2}(\partial B_1)}, \end{equation*}

    which yields, for x \in B_{r_0} \setminus B_{1} , that

    \begin{equation*} | \widetilde w_{\varepsilon}(x)| \le C e(\varepsilon, \omega, d) \|w_\varepsilon (\varepsilon \, \cdot \, ) \|_{H^{1/2}(\partial B_1)}. \end{equation*}

    Since \Delta \widetilde w_{\varepsilon} + i \omega \widetilde w_{\varepsilon} = 0 in B_{r_0} \setminus B_{1} , it follows from Caccioppoli's inequality that

    \begin{equation} \| \widetilde w_{\varepsilon} \|_{H^1(B_2 \setminus B_{3/2})} \le C e(\varepsilon, \omega, d) \|w_\varepsilon (\varepsilon \, \cdot \, ) \|_{H^{1/2}(\partial B_1)}. \end{equation} (2.36)

    Fix \varphi \in C^2(\mathbb{R}^d) such that \varphi = 1 in B_{3/2} and \varphi = 0 in \mathbb{R}^d \setminus B_2 , and set

    \chi_{\varepsilon} = w_{\varepsilon} - \varphi \widetilde w_{\varepsilon} \mbox{ in } \Omega \setminus B_\varepsilon.

    Then \chi_{\varepsilon}\in H^1_0(\Omega \setminus B_\varepsilon) and satisfies

    \begin{equation*} \Delta \chi_{\varepsilon} +i\omega \chi_{\varepsilon} = -\Delta \varphi \widetilde w_{\varepsilon} - 2\nabla \varphi \cdot \nabla \widetilde w_{\varepsilon} \mbox{ in } \Omega\setminus B_\varepsilon. \end{equation*}

    Multiplying the equation of \chi_{\varepsilon} by \bar \chi_{\varepsilon} and integrating by parts, we obtain, by Poincaré's inequality,

    \begin{equation} \| \chi_{\varepsilon} \|_{H^1(\Omega \setminus B_\varepsilon)}\le C \| \widetilde w_{\varepsilon} \|_{H^1(B_2 \setminus B_{3/2})}. \end{equation} (2.37)

    Combining (2.36) and (2.37) yields

    \begin{equation} \| w_{\varepsilon} \|_{H^1(\Omega \setminus B_2)} \le C e(\varepsilon, \omega, d) \|w_\varepsilon (\varepsilon \, \cdot \, ) \|_{H^{1/2}(\partial B_1)}. \end{equation} (2.38)

    The conclusion now follows from (2.28) and (2.32).

    Let v_\varepsilon = u_\varepsilon - u . Using the fact that v_\varepsilon is real, by the inversion theorem and Minkowski's inequality, we have, for t > 0 ,

    \begin{align} \|v_\varepsilon(t, \cdot) \|_{L^2(\Omega \setminus B_2)} \le C \int_0^\infty \|\hat{v}_\varepsilon (\omega, \cdot) \|_{L^2(\Omega \setminus B_2) } \, d \omega. \end{align} (2.39)

    Using Proposition 2.1, we get

    \begin{align*} \int_0^\infty \|\hat{v}_\varepsilon (\omega, \cdot) \|_{L^2(\Omega \setminus B_2) } \, d \omega &\le C \int_0^\infty (1+\omega^{-1/2})e(\varepsilon, \omega, d)\| \hat{f}(\omega)+u_0\|_{L^2(\Omega \setminus B_2) } \, d \omega \\[6pt] & \le C \mbox{esssup}_{\omega \gt 0} \|\hat{f}(\omega)+u_0\|_{L^2(\Omega \setminus B_2) } \int_0^\infty (1+\omega^{-1/2})e(\varepsilon, \omega, d) \, d \omega \\[6pt] & \le Ce(\varepsilon, d) \big(\|f\|_{L^1\big( (0, + \infty); L^2(\Omega) \big)} +\|u_0\|_{L^2(\Omega)} \big). \end{align*}

    It follows from (2.39) that, for t > 0 ,

    \begin{align*} \|v_\varepsilon(t, \cdot) \|_{L^2(\Omega \setminus B_2)} \le Ce(\varepsilon, d) \big(\|f\|_{L^1\big( (0, + \infty); L^2(\Omega) \big)} +\|u_0\|_{L^2(\Omega)} \big). \end{align*}

    Similarly, we have, for t > 0 ,

    \begin{equation*} \|\nabla v_\varepsilon(t, \cdot) \|_{L^2(\Omega \setminus B_2)} \le Ce (\varepsilon, d) \big(\|f\|_{L^1\big( (0, + \infty); L^2(\Omega) \big)} +\|u_0\|_{L^2(\Omega)} \big). \end{equation*}

    The conclusion follows.

    The second author is funded by the Vietnam National Foundation for Science and Technology Development (NAFOSTED) under grant number 101.02-2015.21.

    The authors declare no conflict of interest in this paper.



    [1] M. Alloghani, M. M. Alani, D. Al-Jumeily, T. Baker, J. Mustafina, A. Hussain, et al., A systematic review on the status and progress of homomorphic encryption technologies, J. Inf. Secur. Appl., 48 (2019), 102362.
    [2] B. A. Al-Maytami, P. Fan, A. J. Hussain, T. Baker, P. Liatsis, An efficient queries processing model based on multi broadcast searchable keywords encryption (mbske), Ad Hoc Networks, 98 (2020), 102028.
    [3] J. Lei, D. Li, Z. Pan, Z. Sun, S. Kwong, C. Hou, Fast intra prediction based on content property analysis for low complexity hevc-based screen content coding, IEEE Trans. Broadcast., 63 (2017), 48-58. doi: 10.1109/TBC.2016.2623241
    [4] Z. Pan, X. Yi, Y. Zhang, B. Jeon and S. Kwong, Efficient in-loop filtering based on enhanced deep convolutional neural networks for hevc, IEEE Transactions on Image Processing, 29 (2020), 5352-5366. doi: 10.1109/TIP.2020.2982534
    [5] Z. Pan, X. Yi, Y. Zhang, H. Yuan, F. L. Wang, S. Kwong, Frame-level bit allocation optimization based on video content characteristics for hevc, ACM Trans. Multimedia Comput. Commun. Appl., 16 (2020), 1-20.
    [6] P. Sun, B. Chen, S. Han, H. Shi, Z. Yang, X. Li, An evolutionary task offloading schema for edge computing, in International Conference on Big Data and Security, Springer, 2019.
    [7] Y. Tu, Q. Su, Y. Geng, Enabling secure and efficient data sharing and integrity auditing for cloudassisted industrial control system, in International Conference on Big Data and Security, Springer, 2019.
    [8] S. AlHamed, M. AlRodhaan, Y. Tian, Privacy preservation of future trajectory using dummy rotation algorithm in fog computing, in International Conference on Big Data and Security, Springer, 2019.
    [9] Z. Lv, K. Huang, Y. Wang, R. Tao, G. Wu, J. Zhang, et al., Distributed differential privacy protection system for personalized recommendation, in International Conference on Big Data and Security, Springer, 2019.
    [10] T. Ma, Q. Liu, J. Cao, Y. Tian, A. Al-Dhelaan, M. Al-Rodhaan, Lgiem: Global and local node influence based community detection, Future Gener. Comput. Syst., 105 (2020), 533-546. doi: 10.1016/j.future.2019.12.022
    [11] Y. Tian, B. Song, M. Al Rodhaan, C. R. Huang, M. A. Al-Dhelaan, A. Al-Dhelaan, et al., A stochastic location privacy protection scheme for edge computing, Math. Biosci. Eng., 17 (2020), 2636-2649.
    [12] W. Wang, W. Zhang, Z. Jin, K. Sun, R. Zou, C. Huang, et al., A novel location privacy protection scheme with generative adversarial network, in International Conference on Big Data and Security, Springer, 2019.
    [13] K. Gu, N. Wu, B. Yin, W. Jia, Secure data query framework for cloud and fog computing, IEEE Trans. Network Serv. Manage., 17 (2019), 332-345.
    [14] S. Kunal, A. Saha, R. Amin, An overview of cloud-fog computing: Architectures, applications with security challenges, Secur. Privacy, 2 (2019), e72.
    [15] A. Shamir, Identity-based cryptosystems and signature schemes, in Workshop on the theory and application of cryptographic techniques, Springer, 1984.
    [16] D. Boneh, M. Franklin, Identity-based encryption from the weil pairing, in Annual international cryptology conference, Springer, 2001.
    [17] T. Baker, M. Asim, á. MacDermott, F. Iqbal, F. Kamoun, B. Shah, et al., A secure fog-based platform for scada-based iot critical infrastructure, Software Pract. Exp., 50 (2020), 503-518.
    [18] Y. Lian, X. Wei, Lightweight identity authentication scheme based on ibc identity cryptograph, in International Conference on Big Data and Security, Springer, 2019.
    [19] Y. Shi, S. Qiu, J. Liu, An efficient lattice-based ibe scheme using combined public key, in International Conference on Big Data and Security, Springer, 2019.
    [20] X. Wei, Y. Lian, Research on identity-based cryptograph and its application in power iot, in International Conference on Big Data and Security, Springer, 2019.
    [21] D. Micciancio, O. Regev, Worst-case to average-case reductions based on gaussian measures, SIAM J. Comput., 37 (2007), 267-302. doi: 10.1137/S0097539705447360
    [22] C. Gentry, C. Peikert, V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, in Proceedings of the fortieth annual ACM symposium on Theory of computing, ACM, 2008.
    [23] S. Agrawal, D. Boneh, X. Boyen, Efficient lattice (h) ibe in the standard model, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2010.
    [24] P. Bert, P. A. Fouque, A. Roux-Langlois, M. Sabt, Practical implementation of ring-sis/lwe based signature and ibe, in International Conference on Post-Quantum Cryptography, Springer, 2018.
    [25] A. Takayasu, Y. Watanabe, Lattice-based revocable identity-based encryption with bounded decryption key exposure resistance, in Australasian Conference on Information Security and Privacy, Springer, 2017.
    [26] S. Yamada, Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2016.
    [27] Q. Ye, M. Hu, W. Gao, Y. Tang, A novel hierarchical identity-based encryption scheme from lattices, in International Conference on Cloud Computing and Security, Springer, 2018.
    [28] L. Zhang, Q. Wu, Adaptively secure hierarchical identity-based encryption over lattice, in International Conference on Network and System Security, Springer, 2017.
    [29] D. Micciancio, C. Peikert, Trapdoors for lattices: Simpler, tighter, faster, smaller, in Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 2012.
    [30] E. Fujisaki, T. Okamoto, Secure integration of asymmetric and symmetric encryption schemes, J. Cryptology, 26 (2013), 80-101. doi: 10.1007/s00145-011-9114-1
    [31] J. Hong, B. Liu, Q. Sun, F. Li, A combined public-key scheme in the case of attribute-based for wireless body area networks, Wireless Networks, 25 (2019), 845-859. doi: 10.1007/s11276-017-1597-8
    [32] H. Meng, Z. Chen, J. Hu, Z. Guan, Establish the intrinsic binding in naming space for future internet using combined public key, in Proceedings of the 11th International Conference on Future Internet Technologies, ACM, 2016.
    [33] W. Tang, X. Nan, Z. Chen, Combined public key cryptosystem, in Proceedings of International Conference on Software, Telecommunications and Computer Networks (SoftCOM04), 2004.
    [34] O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM, 56 (2009), 34.
    [35] D. Micciancio, O. Regev, Lattice-based cryptography, Post-quantum cryptography. Springer, Berlin, Heidelberg, 2009. 147-191.
    [36] S. D. Gordon, J. Katz, V. Vaikuntanathan, A group signature scheme from lattice assumptions, in International Conference on the Theory and Application of Cryptology and Information Security, Springer, 2010.
    [37] D. Boneh, R. Canetti, S. Halevi, J. Katz, Chosen-ciphertext security from identity-based encryption, SIAM J. Comput., 36 (2006), 1301-1328.
  • This article has been cited by:

    1. Lauri Oksanen, Mikko Salo, Inverse problems in imaging and engineering science, 2020, 2, 2640-3501, 287, 10.3934/mine.2020014
    2. Hoai-Minh Nguyen, Loc X. Tran, Approximate Cloaking for Time-dependent Maxwell Equations via Transformation Optics, 2019, 51, 0036-1410, 4142, 10.1137/18M1232395
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(3684) PDF downloads(84) Cited by(1)

Figures and Tables

Tables(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog