We consider multi-party computation (MPC) in a hierarchical setting, where participants have different capabilities depending on their position in the hierarchy. First, we give necessary conditions for multiplication of secrets in a hierarchical threshold linear secret sharing scheme (LSSS). Starting with known ideal constructions, we then propose a modified scheme with improved multiplication ...

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].

In the year 1971, W. G. Lister [14] introduced the notion of ternary ring. Later in the year 2014, J. R. Castillo and Jocelyn S. ParaderoVilela [2] introduced the notion of krasner ternary hyperring. In [6] we introduce the notion of multiplicative ternary hyperring. In this paper we study prime hyperideals in a multiplicative ternary hyperring. We obtain some Characterizations of prime hyperid...

Several notions of multiplicativity are introduced for forms of degree d ≥ 3 over a field of characteristic 0 or greater than d. Examples of multiplicative and strongly multiplicative forms of higher degree are given. Conditions restricting the structure of a strongly multiplicative form are found.

For the Fr'{e}chet algebras $(A, (p_k))$ and $(B, (q_k))$ and $n in mathbb{N}$, $ngeq 2$, a linear map $T:A rightarrow B$ is called textit{almost $n$-multiplicative}, with respect to $(p_k)$ and $(q_k)$, if there exists $varepsilongeq 0$ such that$$q_k(Ta_1a_2cdots a_n-Ta_1Ta_2cdots Ta_n)leq varepsilon p_k(a_1) p_k(a_2)cdots p_k(a_n),$$for each $kin mathbb{N}$ and $a_1, a_2, ldots, a_nin A$. Th...

martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. in this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.