نتایج جستجو برای: bilinear mappings
تعداد نتایج: 29936 فیلتر نتایج به سال:
In this study, we introduce the classes of $phi$-strongly pseudocontractive mappings in the intermediate sense and generalized $Phi$-pseudocontractive mappings in the intermediate sense and prove the existence of fixed points for those maps. The results generalise the results of several authors in literature including Xiang [Chang He Xiang, Fixed point theorem for generalized $Phi$-pseudocontra...
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is determined by bilinear control systems, and whose discrete transitions are triggered externally. The proposed characterization provides necessary and sufficient conditions for observability and spanreachability in ter...
The bilinear map whose domain and range are identical is called self-bilinear map. Once such kind of bilinear map exists, the multilinear map can be constructed easily by using self bilinear map as a component. Yamakawa et al. have introduced the first secure self-bilinear map with auxiliary information based on the integer factoring assumption in Crypto 2014. Inspired by their work, we find th...
Attribute-based encryption (ABE) is a technique used to encrypt data, it has the flexibility of access control, high security, and resistance collusion attacks, especially in cloud security protection. However, large number bilinear mappings are ABE, calculation pairing time-consuming. So there problem low efficiency. On other hand, decryption key not uniquely associated with personal identific...
In this paper, we study the convex combinations of harmonic mappings obtained by shearing a class of slit conformal mappings. Sufficient conditions for the convex combinations of harmonic mappings of this family to be univalent and convex in the horizontal direction are derived. Several examples of univalent harmonic mappings constructed by using these methods are presented to illustrate...
In many pairing-based cryptosystems, the secret keys are elements of bilinear groups. For safeguarding such secret keys or decrypting or signing in a threshold manner, Verifiable Secret Sharing (VSS) in bilinear groups is required. In this paper, we show a method of verifiably sharing a random secret in a bilinear group. Our method is simple and practical. It can be regarded as a generalisation...
L p estimates for non smooth bilinear Littlewood-Paley square functions on R. Abstract In this work, some non smooth bilinear analogues of linear Littlewood-Paley square functions on the real line are studied. Mainly we prove boundedness-properties in Lebesgue spaces for them. Let us consider the function φn satisfying c φn(ξ) = 1 [n,n+1] (ξ) and consider the bilinear operator Sn(f, g)(x) := R ...
Bilinear operators are investigated in the context of Sobolev spaces and various techniques useful in the study of their boundedness properties are developed. In particular, several classes of symbols for bilinear operators beyond the so called CoifmanMeyer class are considered. Some of the Sobolev space estimates obtained apply to both the bilinear Hilbert transform and its singular multiplier...
At Eurocrypt 2010, Freeman proposed a transformation from pairing-based schemes in composite-order bilinear groups to equivalent ones in prime-order bilinear groups. His transformation can be applied to pairing-based cryptosystems exploiting only one of two properties of composite-order bilinear groups: cancelling and projecting. At Asiacrypt 2010, Meiklejohn, Shacham, and Freeman showed that p...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید