Complexity of Injective Homomorphisms to Small Tournaments, and of Injective Oriented Colourings

Several possible definitions of local injectivity for a homomorphism of an oriented graph G to an oriented graph H are considered. In each case, we determine the complexity of deciding whether there exists such a homomorphism when G is given and H is a fixed tournament on three or fewer vertices. Each possible definition leads to a locally-injective oriented colouring problem. A dichotomy theorem is proved in each case.

Research on Data Privacy Protection Algorithm with Homomorphism Mechanism Based on Redundant Slice Technology in Wireless Sensor Networks

Wireless transmission method in wireless sensor networks has put forward higher requirements for private protection technology. According to the packet loss problem of private protection algorithm based on slice technology, this paper proposes the data private protection algorithm with redundancy mechanism, which ensures privacy by privacy homomorphism mechanism and guarantees redundancy by carrying hidden data. Moreover,it selects the routing tree generated by CTP(Collection Tree Protocol) as routing path for data transmission. By dividing at the source node, it adds the hidden information and also the privacy homomorphism. At the same time,the information feedback tree is established between the destination node and the source node. In addition, the destination node immediately sends the packet loss information and the encryption key via the information feedback tree to the source node. As a result,it improves the reliability and privacy of data transmission and ensures the data redundancy.

ON INDUCED GROUP HOMOMORPHISMS

Ａｌｒｉｎｇｓｉｎｔｈｉｓｐａｐｅｒａｒｅａｓｓｏｃｉａｔｉｖｅｗｉｔｈｉｄｅｎ－ｔｉｔｙ，ａｎｄａｌｍｏｄｕｌｅｓｌｅｆｔｕｎｉｔａｌ．Ｒｅｃａｌｔｈａｔｇｉｖ－ｅｎａｎｙｒｉｎｇｈｏｍｏｍｏｒｐｈｉｓｍｆ∶Ｒ→Ｓ，ｔｈｅｒｅｉｓａｎｉｎｄｕｃｅｄ...

STABILITY AND SUPERSTABILITY OF JORDAN HOMOMORPHISMS AND JORDAN DERIVATIONS ON BANACH ALGEBRAS AND C~＊-ALGEBRAS： A FIXED POINT APPROACH

Using fixed point methods, we prove the Hyers–Ulam–Rassias stability and superstability of Jordan homomorphisms （Jordan ＊-homomorphisms）, and Jordan derivations （Jordan ＊-derivations） on Banach algebras （C＊-algebras） for the generalized Jensen–type functional equationwhere r is a fixed positive real number in （1, ∞）.

A HYBRID FIXED POINT RESULT FOR LIPSCHITZ HOMOMORPHISMS ON QUASI-BANACH ALGEBRAS

We shall generalize the results of [9] about characterization of isomorphisms on quasi-Banach algebras by providing integral type conditions. Also, we shall give some new results in this way and finally, give a result about hybrid fixed point of two homomorphisms on quasi-Banach algebras.

HOMOMORPHISMS BETWEEN MULTIPLICATIVE SEMIGROUPS OF MATRICES OVER FIELDS

Suppose F is a field, and n, p are integers with 1 ≤ p 〈 n. Let Mn（F） be the multiplicative semigroup of all n × n matrices over F, and let M^Pn（F） be its subsemigroup consisting of all matrices with rank p at most. Assume that F and R are subsemigroups of Mn（F） such that F M^Pn（F）. A map f ： F→R is called a homomorphism if f（AB） = f（A）f（B） for any A, B ∈F. In particular, f is called an endomorphism if F = R. The structure of all homomorphisms from F to R （respectively, all endomorphisms of Mn（F）） is described.

On Homomorphism of Valuation Algebras

In this paper, firstly, a necessary condition and a sufficient condition for an isomorphism between two semiring-induced valuation algebras to exist are presented respectively. Then a general valuation homomorphism based on different domains is defined, and the corresponding homomorphism theorem of valuation algebra is proved.

Applications of Homomorphism on the Structure of Semigroups

By utilizing homomorphisms and -strong semilattice of semigroups, we show that the Green (*,~)-relation H*,~ is a regular band congruence on a r-ample semigroup if and only if it is a G-strong semilattice of completely J*,^-simple semigroups. The result generalizes Petrich’s result on completely regular semigroups with Green’s relation H a normal band congruence or a regular band congruence from the round of regular semigroups to the round of r-ample semigroups.

A Local Characterization of Lie Homomorphisms of Nest Algebras

In this paper,linear maps preserving Lie products at zero points on nest algebras are studied.It is proved that every linear map preserving Lie products at zero points on any finite nest algebra is a Lie homomorphism.As an application,the form of a linear bijection preserving Lie products at zero points between two finite nest algebras is obtained.

The Maximum Size of an Edge Cut and Graph Homomorphisms

For a graph G, let b(G)=max﹛|D|: Dis an edge cut of G﹜ . For graphs G and H, a map Ψ: V(G)→V(H) is a graph homomorphism if for each e=uv∈E(G), Ψ(u)Ψ(v)∈E(H). In 1979, Erd?s proved by probabilistic methods that for p ≥ 2 with if there is a graph homomorphism from G onto Kp then b(G)≥f(p)|E(G)| In this paper, we obtained the best possible lower bounds of b(G) for graphs G with a graph homomorphism onto a Kneser graph or a circulant graph and we characterized the graphs G reaching the lower bounds when G is an edge maximal graph with a graph homomorphism onto a complete graph, or onto an odd cycle.

Homomorphism Key Agreement Based on RSA

This paper reviews the basic content of key management, points out the limitation of the existing key agreement protocols. It introduces RSA public key cryptosystems in detail and homomorphie encryption scheme in the integer ring. The homomorphism key agreement based on RSA is presented. Compared with Diffie-Hellman protocol, its operation speed is more quickly; Compared with key agreement protocol based on password, it has better security. The protocol can use the public key of RSA to create the contributory, forward secrecy the session key. Finally, the security of the protocol is proved by BAN logic.

Conformal Triple Derivations and Triple Homomorphisms of Lie Conformal Algebras

Let R be a finite Lie conformal algebra.We investigate the conformal deriva-tion algebra CDer(R),conformal triple derivation algebra CTDer(R)and generalized con-formal triple derivation algebra GCTDer(R),focusing mainly on the connections among these derivation algebras.We also give a complete classification of(generalized)con-formal triple derivation algebras on all finite simple Lie conformal algebras.In partic-ular,CTDer(R)=CDer(R),where R is a finite simple Lie conformal algebra.But for GCDer(R),we obtain a conclusion that is closely related to CDer(R).Finally,we introduce the definition of a triple homomorphism of Lie conformal algebras.Triple homomorphisms of all finite simple Lie conformal algebras are also characterized.

A Characterization of Homomorphisms Between Banach Algebras

We show that every unital invertibility preserving linear map from a von Neumann algebra onto a semi-simple Banach algebra is a Jordan homomorphism;this gives an affirmative answer to a problem of Kaplansky for all von Neumann algebras.For a unital linear map Φ from a semi-simple complex Banach algebra onto another,we also show that the following statements are equivalent:(1) Φ is an homomorphism;(2)Φ is completely invertibility preserving;(3)Φ is 2-invertibility preserving.

Derivations as Homomorphisms or Anti-homomorphisms on Lie Ideals

Let R be a 2-torsion free prime ring, Z the center of R, and U a nonzero Lie ideal of R. If d is a derivation of R which acts as a homomorphism or an anti-homomorphism on U, then either d = 0 or U lohtein in Z. This result improves a theorem of Asma, Rehman, and Shakir.

Federated Learning Model for Auto Insurance Rate Setting Based on Tweedie Distribution

In the assessment of car insurance claims,the claim rate for car insurance presents a highly skewed probability distribution,which is typically modeled using Tweedie distribution.The traditional approach to obtaining the Tweedie regression model involves training on a centralized dataset,when the data is provided by multiple parties,training a privacy-preserving Tweedie regression model without exchanging raw data becomes a challenge.To address this issue,this study introduces a novel vertical federated learning-based Tweedie regression algorithm for multi-party auto insurance rate setting in data silos.The algorithm can keep sensitive data locally and uses privacy-preserving techniques to achieve intersection operations between the two parties holding the data.After determining which entities are shared,the participants train the model locally using the shared entity data to obtain the local generalized linear model intermediate parameters.The homomorphic encryption algorithms are introduced to interact with and update the model intermediate parameters to collaboratively complete the joint training of the car insurance rate-setting model.Performance tests on two publicly available datasets show that the proposed federated Tweedie regression algorithm can effectively generate Tweedie regression models that leverage the value of data fromboth partieswithout exchanging data.The assessment results of the scheme approach those of the Tweedie regressionmodel learned fromcentralized data,and outperformthe Tweedie regressionmodel learned independently by a single party.

Enhancing IoT Data Security with Lightweight Blockchain and Okamoto Uchiyama Homomorphic Encryption

Blockchain technology has garnered significant attention from global organizations and researchers due to its potential as a solution for centralized system challenges.Concurrently,the Internet of Things(IoT)has revolutionized the Fourth Industrial Revolution by enabling interconnected devices to offer innovative services,ultimately enhancing human lives.This paper presents a new approach utilizing lightweight blockchain technology,effectively reducing the computational burden typically associated with conventional blockchain systems.By integrating this lightweight blockchain with IoT systems,substantial reductions in implementation time and computational complexity can be achieved.Moreover,the paper proposes the utilization of the Okamoto Uchiyama encryption algorithm,renowned for its homomorphic characteristics,to reinforce the privacy and security of IoT-generated data.The integration of homomorphic encryption and blockchain technology establishes a secure and decentralized platformfor storing and analyzing sensitive data of the supply chain data.This platformfacilitates the development of some business models and empowers decentralized applications to perform computations on encrypted data while maintaining data privacy.The results validate the robust security of the proposed system,comparable to standard blockchain implementations,leveraging the distinctive homomorphic attributes of the Okamoto Uchiyama algorithm and the lightweight blockchain paradigm.

A Characterization of Continuous Module Homomorphisms on Random Semi—Normed Modules and Its Applications

In this paper, a characterization of continuous module homomorphisms on random semi-normed modules is first given; then the characterization is further used to show that the Hahn-Banach type of extension theorem is still true for continuous module homomorphisms on random semi-normed modules.

Secure Two-Party Distance Computation Protocol Based on Privacy Homomorphism and Scalar Product in Wireless Sensor Networks

Numerous privacy-preserving issues have emerged along with the fast development of the Internet of Things. In addressing privacy protection problems in Wireless Sensor Networks （WSN）, secure multi-party computation is considered vital, where obtaining the Euclidian distance between two nodes with no disclosure of either side＇s secrets has become the focus of location-privacy-related applications. This paper proposes a novel Privacy-Preserving Scalar Product Protocol （PPSPP） for wireless sensor networks. Based on PPSPP, we then propose a Homomorphic-Encryption-based Euclidean Distance Protocol （HEEDP） without third parties. This protocol can achieve secure distance computation between two sensor nodes. Correctness proofs of PPSPP and HEEDP are provided, followed by security validation and analysis. Performance evaluations via comparisons among similar protocols demonstrate that HEEDP is superior; it is most efficient in terms of both communication and computation on a wide range of data types, especially in wireless sensor networks.

Homomorphisms in Quasi-Banach Algebras Associated with a Pexiderized Cauchy-Jensen Functional Equation

In this paper, we prove the generalized Hyers-Ulam stability of homomorphisms in quasi- Banach algebras associated with the following Pexiderized Jensen functional equation f（x＋y/2＋z）-g（x-y/2＋z）=h（y）.This is applied to investigating homomorphisms between quasi-Banach algebras. The concept of the generalized Hyers-Ulam stability originated from Rassias＇ stability theorem that appeared in his paper： On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc., 72, 297-300 （1978）.

A Type of Shephard Problems for Lp Blaschke-Minkowski Homomorphisms

The Blaschke-Minkowski homomorphisms was defined by Schuster.Recently,Wang extended its concept to Lp version.In this paper,we obtain affirmative and negative forms of the Shephard type problems for Lp geominimal surface areas with respect to the Lp Blaschke-Minkowski homomorphisms.