A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
In the setting of secure two-party computation, two parties wish to securely compute a joint function of their private inputs, while revealing only the output. One of the primary ...
In the random oracle model, parties are given oracle access to a random function (i.e., a uniformly chosen function from the set of all functions), and are assumed to have unbound...
Peer-to-Peer networks are overlay networks that are constructed over underlay networks. These networks can be structured or unstructured. In these networks, peers choose their nei...
Turbulent dynamical systems with a large phase space and a high degree of instabilities are ubiquitous in climate science and engineering applications. Statistical uncertainty quan...
Abstract. We study an explicit correspondence between the integrable modified KdV hierarchy and its dual integrable modified Camassa-Holm hierarchy. A Liouville transformation be...
Jing Kang, Xiaochuan Liu, Peter J. Olver, Changzhe...
In this paper we continue the development of mathematically rigorous theory of “near-flip” buckling of slender bodies of arbitrary geometry, based on hyperelasticity. In orde...