Research on θ -Intuitionistic Fuzzy Homomorphism Theory

Fuzzy homomorphism is an important research content of fuzzy group theory, different fuzzy mappings will produce different fuzzy homomorphisms. In this paper, the fuzzy homomorphism of groups is generalized. Firstly, the θ-intuitionistic fuzzy mapping is defined, and the θ-intuitionistic fuzzy homomorphism of groups is obtained. The properties of intuitionistic fuzzy subgroups and intuitionistic fuzzy normal subgroups are studied under the θ-intuitionistic fuzzy homomorphism of groups, and the fundamental theorem of θ-intuitionistic fuzzy homomorphism is proved.

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.

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.

FL-EASGD:Federated Learning Privacy Security Method Based on Homomorphic Encryption

Federated learning ensures data privacy and security by sharing models among multiple computing nodes instead of plaintext data.However,there is still a potential risk of privacy leakage,for example,attackers can obtain the original data through model inference attacks.Therefore,safeguarding the privacy of model parameters becomes crucial.One proposed solution involves incorporating homomorphic encryption algorithms into the federated learning process.However,the existing federated learning privacy protection scheme based on homomorphic encryption will greatly reduce the efficiency and robustness when there are performance differences between parties or abnormal nodes.To solve the above problems,this paper proposes a privacy protection scheme named Federated Learning-Elastic Averaging Stochastic Gradient Descent(FL-EASGD)based on a fully homomorphic encryption algorithm.First,this paper introduces the homomorphic encryption algorithm into the FL-EASGD scheme to preventmodel plaintext leakage and realize privacy security in the process ofmodel aggregation.Second,this paper designs a robust model aggregation algorithm by adding time variables and constraint coefficients,which ensures the accuracy of model prediction while solving performance differences such as computation speed and node anomalies such as downtime of each participant.In addition,the scheme in this paper preserves the independent exploration of the local model by the nodes of each party,making the model more applicable to the local data distribution.Finally,experimental analysis shows that when there are abnormalities in the participants,the efficiency and accuracy of the whole protocol are not significantly affected.

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.

The Homomorphism and Isomorphism on Hypergroup

Basing on the papers from [1] to [4], this paper gives some further research,mainly solves the following problems:(1) It proved that several theorems of subgroup which have been raised to the hypergroup are still true.(2) It proved that the isomorphous relationship of the bottomgroups which guid to the hypergroup can still keep such relationship.(3) It proved that the basic isomorphous Theorem and the homogenous Theorem of the bottomgroup which raise to the hypergroup are still true.(4) It point out that when the isomorphous bottomgroups have been raised to the hypergroup,the conditions which form the isomorphism should be lessened.

Exact Sequence and Commutative Diagrams of Semimodule Homomorphism

Throught the introduction of the concept * exact sequence,we set up several satisfied results of commutative diagrams of semimodule homomorphism.

ON INDUCED GROUP HOMOMORPHISMS

In this paper, the induced group homomorphism was studied. It is proved that for any ideal I of a ring R contained in J(R), K 0(π):K 0(R)→K 0(R/I) is isomorphic if and only if K 0(π) + is a semigroup isomorphism; characterizations are given for the semilocal rings being semiperfect.

ALMOST HOMOMORPHISMS BETWEEN UNITAL C^＊-ALGEBRAS： A FIXED POINT APPROACH

Let A, B be two unital C^＊-algebras. By using fixed pint methods, we prove that every almost unital almost linear mapping h ： A →B which satisfies h（2^nuy） = h（2^nu）h（y） for all u ∈ U（A）, all y ∈ A, and all n = 0,1,2,..., is a homomorphism. Also, we establish the generalized Hyers-Ulam-Rassias stability of ,-homomorphisms on unital C^＊-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.

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.

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, ∞）.

Quantum homomorphic broadcast multi-signature based on homomorphic aggregation

Quantum multi-signature has attracted extensive attention since it was put forward.Beside its own improvement,related research is often combined with other quantum signature.However,this type of quantum signature has one thing in common,that is,the generation and verification of signature depend heavily on the shared classical secret key.In order to increase the reliability of signature,the homomorphic aggregation technique is applied to quantum multi-signature,and then we propose a quantum homomorphic multi-signature protocol.Unlike previous quantum multi-signature protocols,this protocol utilizes homomorphic properties to complete signature generation and verification.In the signature generation phase,entanglement swapping is introduced,so that the individual signatures of multiple users are aggregated into a new multi-signature.The original quantum state is signed by the shared secret key to realize the verification of the signature in the verification phase.The signature process satisfies the homomorphic property,which can improve the reliability of the signature.

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.

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.

Multi-Source Data Privacy Protection Method Based on Homomorphic Encryption and Blockchain

Multi-Source data plays an important role in the evolution of media convergence.Its fusion processing enables the further mining of data and utilization of data value and broadens the path for the sharing and dissemination of media data.However,it also faces serious problems in terms of protecting user and data privacy.Many privacy protectionmethods have been proposed to solve the problemof privacy leakage during the process of data sharing,but they suffer fromtwo flaws:1)the lack of algorithmic frameworks for specific scenarios such as dynamic datasets in the media domain;2)the inability to solve the problem of the high computational complexity of ciphertext in multi-source data privacy protection,resulting in long encryption and decryption times.In this paper,we propose a multi-source data privacy protection method based on homomorphic encryption and blockchain technology,which solves the privacy protection problem ofmulti-source heterogeneous data in the dissemination ofmedia and reduces ciphertext processing time.We deployed the proposedmethod on theHyperledger platformfor testing and compared it with the privacy protection schemes based on k-anonymity and differential privacy.The experimental results showthat the key generation,encryption,and decryption times of the proposedmethod are lower than those in data privacy protection methods based on k-anonymity technology and differential privacy technology.This significantly reduces the processing time ofmulti-source data,which gives it potential for use in many applications.

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.

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 Linear Homomorphic Proxy Signature Scheme Based on Blockchain for Internet of Things

The mushroom growth of IoT has been accompanied by the generation of massive amounts of data.Subject to the limited storage and computing capabilities ofmost IoT devices,a growing number of institutions and organizations outsource their data computing tasks to cloud servers to obtain efficient and accurate computation while avoiding the cost of local data computing.One of the most important challenges facing outsourcing computing is how to ensure the correctness of computation results.Linearly homomorphic proxy signature(LHPS)is a desirable solution to ensure the reliability of outsourcing computing in the case of authorized signing right.Blockchain has the characteristics of tamper-proof and traceability,and is a new technology to solve data security.However,as far as we know,constructions of LHPS have been few and far between.In addition,the existing LHPS scheme does not focus on homomorphic unforgeability and does not use blockchain technology.Herein,we improve the security model of the LHPS scheme,and the usual existential forgery and homomorphic existential forgery of two types of adversaries are considered.Under the new model,we present a blockchain-based LHPS scheme.The security analysis shows that under the adaptive chosen message attack,the unforgeability of the proposed scheme can be reduced to the CDH hard assumption,while achieving the usual and homomorphic existential unforgeability.Moreover,comparedwith the previous LHPS scheme,the performance analysis shows that our scheme has the same key size and comparable computational overhead,but has higher security.