arXiv subjects

Pierre-Alain Jacqmin

Publications and source records attributed to Pierre-Alain Jacqmin.

11 recordsLinked to original sources

arXiv2026

Cryptanalysis of four arbitrated quantum signature schemes

Arbitrated quantum signature (AQS) schemes aim at ensuring the authenticity of a message with the help of an arbitrator. Moreover, they aim at preventing repudiation, both from a sender that denies the origin of a message, and from a receiver who disavows its reception. Such protocols use quantum communication and are often designed to protect quantum messages. In this paper, we study four recently submitted AQS schemes and propose attacks on their security. Firstly, we look at Zhang, Sun, Zhang and Jia's AQS scheme which aims at signing quantum messages with chained CNOT encryption. We show that the sender can repudiate her messages and make false allegation of reception. Moreover, we show that a dishonest receiver can forge signatures. Secondly, we analyse Ding, Xin, Yang and Sang's AQS protocol to sign classical messages based on GHZ states. We show that both the sender and the receiver have simple repudiation strategies. Thirdly, we study Lu, Li, Yu and Han's AQS scheme that uses controlled teleportation to protect quantum messages. We expose forgeries, false allegation attacks and the possibility of repudiation by both parties. Fourthly, we focus on the AQS scheme by Zhang, Xin, Sun, Li and Li designed to sign classical messages without entangled states. We show that one can disavow the reception of messages, and that information-theoretic security is not achieved for other security goals.

quant-ph↗

arXiv2024

Partial algebras and implications of (weak) matrix properties

Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications $M\Rightarrow N$ between them. We show here that this algorithm reduces to construct a partial term corresponding to $N$ from a partial term corresponding to $M$. Moreover, we prove that this is further equivalent to the corresponding implication between the weak versions of these properties, i.e., the one where only strong monomorphisms are considered instead of all monomorphisms.

math.CT↗

arXiv2024

A syntactic characterization of weakly Mal'tsev varieties

The notion of a weakly Mal'tsev category, as it was introduced in 2008 by the third author, is a generalization of the classical notion of a Mal'tsev category. It is well-known that a variety of universal algebras is a Mal'tsev category if and only if its theory admits a Mal'tsev term. In the main theorem of this paper, we prove a syntactic characterization of the varieties that are weakly Mal'tsev categories. We apply our result to the variety of distributive lattices which was known to be a weakly Mal'tsev category before. By a result of Z. Janelidze and the third author, a finitely complete category is weakly Mal'tsev if and only if any internal strong reflexive relation is an equivalence relation. In the last part of this paper, we give a syntactic characterization of those varieties in which any regular reflexive relation is an equivalence relation.

math.CT↗

arXiv2024

A note on the atomicity of arithmeticity

The main aim of this note is to show that, in the regular context, every matrix property in the sense of Z. Janelidze either implies the Mal'tsev property, or is implied by the majority property. When the regular category is arithmetical, i.e., both Mal'tsev and a majority category, then we show that satisfies every non-trivial matrix property.

math.CT↗

arXiv2022

Matrix taxonomy and Bourn localization

In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to include matrix properties involving pointedness of a category, such as the properties of a category to be unital, strongly unital or subtractive, for example. Moreover, this extended algorithm can also be used to determine whether a given matrix property is the Bourn localization of another, thus leading to new characterizations of Mal'tsev, majority and arithmetical categories. Using a computer implementation of our algorithm, we can display all such properties given by matrices of fixed dimensions, grouped according to their Bourn localizations, as well as the implications between them.

math.CT↗

arXiv2022

When a matrix condition implies the Mal'tsev property

Matrix conditions extend linear Mal'tsev conditions from Universal Algebra to exactness properties in Category Theory. Some can be stated in the finitely complete context while, in general, they can only be stated for regular categories. We study when such a matrix condition implies the Mal'tsev property. Our main results assert that, for both types of matrices, this implication is equivalent to the corresponding implication restricted to the context of varieties of universal algebras.

math.CT↗

arXiv2022

The matrix taxonomy of finitely complete categories

This paper is concerned with the taxonomy of finitely complete categories, based on 'matrix properties' - these are a particular type of exactness properties that can be represented by integer matrices. In particular, the main result of the paper gives an algorithm for deciding whether a conjunction of such properties implies another such property. Computer implementation of this algorithm allows one to peer into the complex structure of the poset of `matrix classes', i.e., the poset of all collections of finitely complete categories determined by matrix properties. Among elements of this poset are the collections of Mal'tsev categories, majority categories, (finitely complete) arithmetical categories, as well as finitely complete extensions of various classes of varieties defined by a special type of Mal'tsev conditions found in the literature.

math.CT↗

arXiv2020

On stability of exactness properties under the pro-completion

In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to exactness properties proposed in this paper, which is based on the theory of sketches. Our stability theorem has applications in proving theorems that establish links between exactness properties, as well as in establishing embedding (representation) theorems for classes of categories defined by exactness properties.

math.CT↗

arXiv2019

On the naturalness of Mal'tsev categories

Mal'tsev categories turned out to be a central concept in categorical algebra. On one hand, the simplicity and the beauty of the notion is revealed through a lot of characterizations of different flavour. Depending on the context, one can define Mal'tsev categories as those for which `any reflexive relation is an equivalence'; `any relation is difunctional'; `the composition of equivalence relations on a same object is commutative'; `each fibre of the fibration of points is unital' or `the forgetful functor from internal groupoids to reflexive graphs is saturated on subobjects'. For a variety of universal algebras, these are also equivalent to the existence in its algebraic theory of a Mal'tsev operation, i.e. a ternary operation $p(x,y,z)$ satisfying the axioms $p(x,x,y)=y$ and $p(x,y,y)=x$. On the other hand, Mal'tsev categories have been shown to be the right context in which to develop the theory of centrality of equivalence relations, Baer sums of extensions, and some homological lemmas such as the denormalized $3 \times 3$ Lemma, whose validity in a regular category is equivalent to the weaker `Goursat property', which has also turned out to be of wide interest.

math.CT↗

arXiv2018

Finiteness spaces and generalized power series

We consider Ribenboim's construction of rings of generalized power series. Ribenboim's construction makes use of a special class of partially ordered monoids and a special class of their subsets. While the restrictions he imposes might seem conceptually unclear, we demonstrate that they are precisely the appropriate conditions to represent such monoids as internal monoids in an appropriate category of Ehrhard's finiteness spaces. Ehrhard introduced finiteness spaces as the objects of a categorical model of classical linear logic, where a set is equipped with a class of subsets to be thought of as finitary. Morphisms are relations preserving the finitary structure. The notion of finitary subset allows for a sharper analysis of computational structure than is available in the relational model. For example, fixed point operators fail to be finitary. In the present work, we take morphisms to be partial functions preserving the finitary structure rather than relations. The resulting category is symmetric monoidal closed, complete and cocomplete. Any pair of an internal monoid in this category and a ring induces a ring of generalized power series by an extension of the Ribenboim construction based on Ehrhard's notion of linearization of a finiteness space. We thus further generalize Ribenboim's constructions. We give several examples of rings which arise from this construction, including the ring of Puiseux series and the ring of formal power series generated by a free monoid.

math.CT↗

arXiv2017

An embedding theorem for regular Mal'tsev categories

In this paper, we obtain a non-abelian analogue of Lubkin's embedding theorem for abelian categories. Our theorem faithfully embeds any small regular Mal'tsev category $\mathbb{C}$ in an $n$-th power of a particular locally finitely presentable regular Mal'tsev category. The embedding preserves and reflects finite limits, isomorphisms and regular epimorphisms, as in the case of Barr's embedding theorem for regular categories. Furthermore, we show that we can take $n$ to be the (cardinal) number of subobjects of the terminal object in $\mathbb{C}$.

math.CT↗