Results 271 to 280 of about 8,525 (297)
Some of the next articles are maybe not open access.
2023
We study a problem that is algebraic in nature but has certain applications in graph theory. It can be seen as a generalization of the joint spectral radius. Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, both with nonnegative coefficients and entries, among an exponential number of ways to combine ...
openaire +1 more source
We study a problem that is algebraic in nature but has certain applications in graph theory. It can be seen as a generalization of the joint spectral radius. Given a bilinear map $*:\mathbb R^d\times\mathbb R^d\to\mathbb R^d$ and a vector $s\in\mathbb R^d$, both with nonnegative coefficients and entries, among an exponential number of ways to combine ...
openaire +1 more source
Cocharacters of Bilinear Mappings and Graded Matrices
Algebras and Representation Theory, 2012Let \(M_k(F)\) be the algebra of \(k\times k\) matrices over a field \(F\) of characteristic zero. Let \(G\) be any group, consider \(M_k(F)\) with the elementary grading induced by the \(k\)-tuple \((1,\ldots,1,g)\), where \(g\in G\), \(g^2\neq 1\). Then the graded identities of \(M_k(F)\) depending only on variables of homogeneous degrees \(g\) and \(
Aquè, Stefania, Giambruno, Antonio
openaire +1 more source
On surjective bilinear mappings
Journal of Soviet Mathematics, 1992See the review in Zbl 0742.15014.
openaire +1 more source
Cryptography Based on Bilinear Maps
2006The bilinear mapping technique that uses the (Weil and Tate) pairings over elliptic (or hyperelliptic) curves represents a great breakthrough in cryptography. This paper surveys this new trend in cryptography, and emphasizes the design of efficient cryptographic primitives that are provably secure in the standard model (i.e., without the random oracle ...
openaire +1 more source
Towards Ideal Self-bilinear Map
Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018Bilinear maps (also called pairings) have been used for constructing various kinds of cryptographic primitives including (but not limited to) short signatures, identity-based encryption, attribute-based encryption, and non-interactive zero-knowledge proof systems.
openaire +1 more source
Arithmetic Garbling from Bilinear Maps
2019We consider the problem of garbling arithmetic circuits and present a garbling scheme for inner-product predicates over exponentially large fields. Our construction stems from a generic transformation from predicate encryption which makes only blackbox calls to the underlying primitive.
Nils Fleischhacker +2 more
openaire +3 more sources
The theory of models of bilinear mappings
Siberian Mathematical Journal, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Definable invariants of bilinear mappings
Siberian Mathematical Journal, 1990Elementary theories of bilinear mappings are studied. The interest in these questions is explained by the fact that different model-theoretic problems of algebra reduce largely to the corresponding problems for bilinear mappings. Bilinear mappings in rings arise most naturally --- the multiplication operation itself generates them.
openaire +1 more source
Implementing broadcast encryption scheme using bilinear map and group characteristic
Wuhan University Journal of Natural Sciences, 2006Jin Libiao, Libiao Jin, Jianzeng Li
exaly