Related papers: Low Ambiguity in Strong, Total, Associative, One-W…

We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we allow the public verification key to be…

We derive two conditional expectation bounds, which we use to simplify cryptographic security proofs. The first bound relates the expectation of a bounded random variable and the average of its conditional expectations with respect to a set…

We prove that the upper envelope of a family of subharmonic functions defined on an open subset of $\mathbb{R}^{N}$, $(N\geq2)$, that is finite every where, is locally bounded above outside a closed nowhere dense set with no bounded…

We show that there exists an entire function which has neither fixed points nor invariant Baker domains. The question whether such a function exists was raised by Buff.

Let Y be an infinite covering space of a projective manifold M in P^N of dimension n geq 2. Let C be the intersection with M of at most n-1 generic hypersurfaces of degree d in P^N. The preimage X of C in Y is a connected submanifold. Let…

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order…

We investigate semiconjugate rational functions, that is rational functions $A,$ $B$ related by the functional equation $A\circ X=X\circ B$, where $X$ is a rational function of degree at least two. We show that if $A$ and $B$ is a pair of…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet $\Sigma$, and study the mean of functions over $\Sigma^n$. We say expander walks…

In this note we study restrictions on the recently introduced super-additive and sub-additive transformations, $A\mapsto A^*$ and $A\mapsto A_*$, of an aggregation function $A$. We prove that if $A^*$ has a slightly stronger property of…

Let $\Gamma$ be an oriented Jordan smooth curve and $\alpha$ be a diffeomorphism of $\Gamma$ onto itself which has an arbitrary nonempty set of periodic points. We prove criteria for one-sided invertiblity of the binomial functional…

In this tutorial, selected topics of cryptology and of computational complexity theory are presented. We give a brief overview of the history and the foundations of classical cryptography, and then move on to modern public-key cryptography.…

In this paper we study the asymptotic behaviour of two relatively new complexity functions defined on infinite words and their relationship to periodicity. Given a factor $u$ of an infinite word $x$, we say $u$ is closed if it is a letter…

Let $Y$ be an algebraic manifold of dimension 3 with $H^i(Y, \Omega^j_Y)=0$ for all $j\geq 0$, $i>0$ and $h^0(Y, {\mathcal{O}}_Y) > 1$. Let $X$ be a smooth completion of $Y$ such that the boundary $X-Y$ is the support of an effective…

We continue the study of statistical/computational tradeoffs in learning robust classifiers, following the recent work of Bubeck, Lee, Price and Razenshteyn who showed examples of classification tasks where (a) an efficient robust…

One-time programs (Goldwasser, Kalai and Rothblum, CRYPTO 2008) are functions that can be run on any single input of a user's choice, but not on a second input. Classically, they are unachievable without trusted hardware, but the…

We show that there is a restriction, or modification of the finite-variable fragments of First Order Logic in which a weak form of Craig's Interpolation Theorem holds, but a strong form of this theorem does not hold. Translating these…

Baker's conjecture states that a transcendental entire function of order less than $1/2$ has no unbounded Fatou components. It is known that, for such functions, there are no unbounded periodic Fatou components and so it remains to show…

We construct a function for almost-complex Riemannian manifolds. Non-vanishing of the function for the almost-complex structure implies the almost-complex structure is not integrable. Therefore the constructed function is an obstruction for…

An operator set is functionally incomplete if it can not represent the full set $\lbrace \neg,\vee,\wedge,\rightarrow,\leftrightarrow\rbrace$. The verification for the functional incompleteness highly relies on constructive proofs. The…