Related papers: Homomorphic encryption and some black box attacks

Recently, an image block encryption algorithm was proposed based on some well-known chaotic maps. The authors claim that the encryption algorithm achieves enough security level and high encryption speed at the same time. In this paper, we…

In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…

We present a conceptual framework for extending homomorphic encryption beyond arithmetic or Boolean operations into the domain of intuitionistic logic proofs and, by the Curry-Howard correspondence, into the domain of typed functional…

This work addresses the homotopical analysis of enveloping operads in a general cofibrantly generated symmetric monoidal model category. We show the potential of this analysis by obtaining, in a uniform way, several central results…

Algebraic operads provide a powerful tool to understand the homotopy theory of the types of (co)algebras they encode. So far, the principal results and methods that this theory provides were only available in characteristic zero. The reason…

The nonrecursive Bernstein-Vazirani algorithm was the first quantum algorithm to show a superpolynomial improvement over the corresponding best classical algorithm. Here we define a class of circuits that solve a particular case of this…

In this paper we find some necessary and sufficient conditions for a Banach algebra to be amenable or weakly amenable, by applying the homomorphisms on Banach algebras.

Cryptography is the discipline that allows securing of the exchange of information. In this internship, we will focus on a certain branch of this discipline, secure computation in a network. The main goal of this internship, illustrated in…

This survey provides an elementary introduction to operads and to their applications in homotopical algebra. The aim is to explain how the notion of an operad was prompted by the necessity to have an algebraic object which encodes higher…

The widespread deployment of products powered by machine learning models is raising concerns around data privacy and information security worldwide. To address this issue, Federated Learning was first proposed as a privacy-preserving…

We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in…

We define homological matrices, construct examples of one-dimension restricted homological quantum field theories, and show a relationship between the two theories.

This paper studies the formal deformations of differential algebra morphisms. As a consequence, we develop a cohomology theory of differential algebra morphisms to interpret the lower degree cohomology groups as formal deformations. Then,…

This is an expository article about operads in homotopy theory written as a chapter for an upcoming book. It concentrates on what the author views as the basic topics in the homotopy theory of operadic algebras: the definition of operads,…

Many deployed learned models are black boxes: given input, returns output. Internal information about the model, such as the architecture, optimisation procedure, or training data, is not disclosed explicitly as it might contain proprietary…

In this paper we consider the description of homomorphic and fully homomorphic ciphers in the $p$-adic model of encryption. This model describes a wide class of ciphers, but certainly not all. Homomorphic and fully homomorphic ciphers are…

Federated learning based on homomorphic encryption has received widespread attention due to its high security and enhanced protection of user data privacy. However, the characteristics of encrypted computation lead to three challenging…

In this paper, we consider the problem of how to establish algebraic structures on nearness approximation spaces. Essentially, our approach is to define the nearness ring, nearness ideal and nearness ring of all weak cosets by considering…

Fully Homomorphic Encryption (FHE) is seeing increasing real-world deployment to protect data in use by allowing computation over encrypted data. However, the same malleability that enables homomorphic computations also raises integrity…

A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical…