We reformalize and recast dual-receiver encryption (DRE) proposed in CCS ’04, a public-key encryption (PKE) scheme for encrypting to two independent recipients in one shot. We start by defining the crucial soundness property for DRE, which ensures that two recipients will get the same decryption result. While conceptually simple, DRE with soundness turns out to be a powerful primitive for vario...

We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij–Söderberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences in such pure diagrams be totally ordered, we are able to define a multiplication law for Betti diagrams that respects the decomposition and allows us to write a...

This article provides a complete axiomatization for strong non-contingency logic over Euclidean frames, whose completeness proof is nontrivial. Our result answers an open question raised in [3].

We investigate a non-Poissonian version of the asymmetric simple exclusion process, motivated by the observation that coarse graining the interactions between particles in complex systems generically leads to a stochastic process with a non-Markovian (history-dependent) character. We characterize a large family of one-dimensional hopping processes using a waiting-time distribution for individua...

In this paper, we prove that the Lp essential spectra of the Laplacian on functions are [0,+∞) on a noncompact complete Riemannian manifold with non-negative Ricci curvature at infinity. The similar method applies to gradient shrinking Ricci soliton, which is similar to non-compact manifold with non-negative Ricci curvature in many ways. © 2010 Elsevier Inc. All rights reserved.

The base of a signed digraph S is the minimum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. Let K be a signed complete graph of order n, which is a signed digraph obtained by assigning +1 or −1 to each arc of the n-th order complete graph Kn considered as a digraph. In this paper we show that for n ≥ 3 the base of a primiti...

In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.