«bilinear map»
۱۰۰۳ نتیجه$n$-factorization Property of Bilinear Mappings
In this paper, we define a new concept of factorization for a bounded bilinear mapping $f:Xtimes Yto Z$, depended on a natural number $n$ and a cardinal number $kappa$; which is called $n$-factorization property of level $kappa$. Then we study the relation between $n$-factorizati
Arens regularity of bilinear maps and Banach modules actions
Let $X$, $Y$ and $Z$ be Banach spaces and $f:X\times Y \longrightarrow Z$ a bounded bilinear map. In this paper we study the relation between Arens regularity of $f$ and the reflexivity of $Y$. We also give some conditions under which the Arens regularity of a Banach algebra $A$
arens regularity of bilinear maps and banach modules actions
let $x$, $y$ and $z$ be banach spaces and $f:xtimes y longrightarrow z$ a bounded bilinear map. in this paper we study the relation between arens regularity of $f$ and the reflexivity of $y$. we also give some conditions under which the arens regularity of a banach
Self-bilinear Map from One Way Encoding System and Indistinguishability Obfuscation
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 wi
A Note on Self-bilinear Maps
Cryptographic protocols depend on the hardness of some computational problems for their security. Joux briefly summarized known relations between assumptions related bilinear map in a sense that if one problem can be solved easily, then another problem can be solved within a poly
A Key-Policy Attribute-based Encryption Scheme for General Circuit from Bilinear Maps
By access structure and attribute set, attribute-based encryption realizes fine-grained access control and one to many encryption. The expression of access structure directly decides the application range of one scheme and the general circuit reaches the best form. Since the safe
Bilinear maps and convolutions
Let X,Y, Z be Banach spaces and let u : X×Y → Z be a bounded bilinear map. Given a locally compact abelian group G , and two functions f ∈ L(G,X) and g ∈ L(G,Y ), we define the u -convolution of f and g as the Z -valued function f ∗u g(t) = ∫ G u(f(t− s), g(s))dμG(s) where dμG st
Two-Input Functional Encryption for Inner Products from Bilinear Maps
Functional encryption is a new paradigm of public-key encryption that allows a user to compute f (x) on encrypted data CT (x) with a private key SK f to finely control the revealed information. Multi-input functional encryption is an important extension of (single-input) function
More Efficient Secure Outsourcing Methods for Bilinear Maps
Bilinear maps are popular cryptographic primitives which have been commonly used in various modern cryptographic protocols. However, the cost of computation for bilinear maps is expensive because of their realization using variants of Weil and Tate pairings of elliptic curves. Du
The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions
Over the past decade bilinear maps have been used to build a large variety of cryptosystems. In addition to new functionality, we have concurrently seen the emergence of many strong assumptions. In this work, we explore how to build bilinear map cryptosystems under progressively