in this paper. (1) we determine the complex-valued solutions of the following variant of van vleck's functional equation $$int_{s}f(sigma(y)xt)dmu(t)-int_{s}f(xyt)dmu(t) = 2f(x)f(y), ;x,yin s,$$ where $s$ is a semigroup, $sigma$ is an involutive morphism of $s$, and $mu$ is a complex measure that is linear combinations of dirac measures $(delta_{z_{i}})_{iin i}$, such that for all $iin i$,...

LetX be a set with a binary operation ◦ such that, for each x, y, z ∈ X, either x ◦y ◦z x ◦z ◦y, or z◦ x◦y x◦ z◦y . We show the superstability of the functional equation g x◦y g x g y . More explicitly, if ε ≥ 0 and f : X → C satisfies |f x ◦ y − f x f y | ≤ ε for each x, y ∈ X, then f x ◦ y f x f y for all x, y ∈ X, or |f x | ≤ 1 √1 4ε /2 for all x ∈ X. In the latter case, the constant 1 √ 1 4...

We obtain the superstability of the Pexiderized multiplicative functional equation fxy gxhy and investigate the stability of this equation in the following form: 1/1 ψx, y ≤ fxy/gxhy ≤ 1 ψx, y.

An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classiied retrieval of exac...

An additive and multiplicative privacy homomorphism is an encryption function mapping addition and multiplication of cleartext data into two operations on encrypted data. One such privacy homomorphism is introduced which has the novel property of seeming secure against a known-cleartext attack. An application to multilevel statistical computation is presented, namely classified retrieval of exa...

In this paper we provide a new scheme to securely forward the message in wireless mobile ad hoc networks (MANETs) by using existing homomorphic encryption schemes. This scheme is an alternative for threshold cryptography (TC) in MANETs to securely forward the message. By using homomorphic encryption schemes we remove the computational cost associated with Lagrange Interpolation scheme used in T...

We find the universal module w(M) for functions (that need not be invariants) of finite matroids, defined on a minor-closed class M and with values in any module L over any commutative and unitary ring, that satisfy a parametrized deletion-contraction identity, F (M) = δeF (M r e) + γeF (M/e), when e is neither a loop nor a coloop. (F is called a (parametrized) weak Tutte function.) Within the ...