相关论文: Type-Preserving Matrices and Security of Block Cip…

We obtain a finite generating set for the level 2 twist subgroup of the mapping class group of a closed non-orientable surface. The generating set consists of crosscap pushing maps along non-separating two-sided simple loops and squares of…

We consider type inference for guarded recursive data types (GRDTs) -- a recent generalization of algebraic data types. We reduce type inference for GRDTs to unification under a mixed prefix. Thus, we obtain efficient type inference.…

In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…

When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…

We establish that there are non-mixing maps that are mixing on appropriate sequences including sequences $(s_i)$ which satisfy the Rajchman dissociated property. Our examples are based on the staircase rank one construction, $M$-towers…

Predicate encryption is a new type of public key encryption that enables searches on encrypted data. By using predicate encryption, we can search keywords or attributes on encrypted data without decrypting ciphertexts. Hidden vector…

Two fundamental ways to represent a group are as permutations and as matrices. In this paper, we study linear representations of groups that intertwine with a permutation representation. Recently, D'Alconzo and Di Scala investigated how…

We introduce a new privacy model relying on bistochastic matrices, that is, matrices whose components are nonnegative and sum to 1 both row-wise and column-wise. This class of matrices is used to both define privacy guarantees and a tool to…

We provide the first $\mathit{constant}$-$\mathit{round}$ construction of post-quantum non-malleable commitments under the minimal assumption that $\mathit{post}$-$\mathit{quantum}$ $\mathit{one}$-$\mathit{way}$ $\mathit{functions}$ exist.…

Verifiable credentials are a digital analogue of physical credentials. Their authenticity and integrity are protected by means of cryptographic techniques, and they can be presented to verifiers to reveal attributes or even predicates about…

Privacy-Preserving Machine Learning as a Service (PP-MLaaS) enables secure neural network inference by integrating cryptographic primitives such as homomorphic encryption (HE) and multi-party computation (MPC), protecting both client data…

We show that the full group C$^*$-algebra of the free product of two nontrivial countable amenable discrete groups, where at least one of them has more than two elements, is primitive. We also show that in many cases, this C$^*$-algebra is…

We prove that every group ring of a non-abelian locally free group which is the union of an ascending sequence of free groups is primitive. In particular, every group ring of a countable non-abelian locally free group is primitive. In…

Let $A$ be an arbitrary symmetrizable Cartan matrix of rank $r$, and ${\bf n}={\bf n_+}$ be the standard maximal nilpotent subalgebra in the Kac-Moody algebra associated with $A$ (thus, ${\bf n}$ is generated by $E_1,\ldots,E_r$ subject to…

The main practical limitation of the McEliece public-key encryption scheme is probably the size of its key. A famous trend to overcome this issue is to focus on subclasses of alternant/Goppa codes with a non trivial automorphism group. Such…

Trusted Execution Environments, such as Intel SGX, use hardware supports to ensure the confidentiality and integrity of applications against a compromised cloud system. However, side channels like access patterns remain for adversaries to…

Let $S_g$ be the closed oriented surface of genus $g \geq 0$, and let $\mathrm{Mod}(S_g)$ be the mapping class group of $S_g$. For $g\geq 2$, we develop an algorithm to obtain a finite generating set for the liftable mapping class group…

A major challenge in the study of cryptography is characterizing the necessary and sufficient assumptions required to carry out a given cryptographic task. The focus of this work is the necessity of a broadcast channel for securely…

Clustering is an important tool for data exploration where the goal is to subdivide a data set into disjoint clusters that fit well into the underlying data structure. When dealing with sensitive data, privacy-preserving algorithms aim to…

Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…