Related papers: Type-Preserving Matrices and Security of Block Cip…

We study the quantum security of key-alternating ciphers (KAC), a natural multi-round generalization of the Even--Mansour construction. KAC abstracts the round structure of practical block ciphers as public permutations interleaved with key…

Group signature is a fundamental cryptographic primitive, aiming to protect anonymity and ensure accountability of users. It allows group members to anonymously sign messages on behalf of the whole group, while incorporating a tracing…

Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…

A modular tensor category is a non-degenerate ribbon finite tensor category. And a ribbon factorizable Hopf algebra is exactly the Hopf algebra whose finite-dimensional representations form a modular tensor category. The goal of this paper…

A block cipher can be easily broken if its encryption functions can be seen as linear maps on a small vector space. Even more so, if its round functions can be seen as linear maps on a small vector space. We show that this cannot happen for…

Cryptographic security is traditionally formulated using game-based or simulation-based definitions. In this paper, we propose a structural reformulation of cryptographic security based on Grothendieck topologies and sheaf theory. Our key…

Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…

We study a family of models for an $N_1 \times N_2$ matrix worth of Ising spins $S_{aB}$. In the large $N_i$ limit we show that the spins soften, so that the partition function is described by a bosonic matrix integral with a single…

We introduce a method for obtaining new classes of free divisors from representations $V$ of connected linear algebraic groups $G$ where $\dim(G)=\dim(V)$, with $V$ having an open orbit. We give sufficient conditions that the complement of…

The powerful no-cloning principle of quantum mechanics can be leveraged to achieve interesting primitives, referred to as unclonable primitives, that are impossible to achieve classically. In the past few years, we have witnessed a surge of…

We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…

Data mining has made broad significant multidisciplinary field used in vast application domains and extracts knowledge by identifying structural relationship among the objects in large data bases. Privacy preserving data mining is a new…

We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast…

This thesis is concerned with the mixed Tate property of reductive algebraic groups $G$, which in particular guarantees a Chow Kunneth property for the classifying space $BG$. Toward this goal, we first refine the construction of the…

In the secure two-party computation problem, two parties wish to compute a (possibly randomized) function of their inputs via an interactive protocol, while ensuring that neither party learns more than what can be inferred from only their…

We present two noncommutative algebras over a field of characteristic zero that each posses a family of actions by cyclic groups of order $2n$, represented in $n \times n$ matrices, requiring generators of degree $3n$.

Since the advent of software defined networks ({SDN}), there have been many attempts to outsource the complex and costly local network functionality, i.e. the middlebox, to the cloud in the same way as outsourcing computation and storage.…

Gibbs-type priors are widely used as key components in several Bayesian nonparametric models. By virtue of their flexibility and mathematical tractability, they turn out to be predominant priors in species sampling problems, clustering and…

Topology-driven nonlinear light-matter effects open up new paradigms for both topological photonics and nonlinear optics. Here, we propose to achieve high-efficiency second-harmonic generation in a second-order photonic topological…

We propose a new computationally efficient privacy-preserving identification framework based on layered sparse coding. The key idea of the proposed framework is a sparsifying transform learning with ambiguization, which consists of a…