Related papers: Distributional Collision Resistance Beyond One-Way…
In the paper we define a notion of quantum resistant ($(\epsilon,\delta)$-resistant) hash function which combine together a notion of pre-image (one-way) resistance ($\epsilon$-resistance) property we define in the paper and the notion of…
Oneway real functions are effective maps on positive-measure sets of reals that preserve randomness and have no effective probabilistic inversions. We construct a oneway real function which is collision-resistant: the probability of…
In this paper, a renewable, multi-use, multi-secret sharing scheme for general access structure based on one-way collision resistant hash function is presented in which each participant has to carry only one share. By applying…
cryptographic hash function is a deterministic procedure that compresses an arbitrary block of numerical data and returns a fixed-size bit string. There exist many hash functions: MD5, HAVAL, SHA, ... It was reported that these hash…
We investigate quantum analogues of collision resistance and obtain separations between quantum ``one-way'' and ``collision-resistant'' primitives. 1. Our first result studies one-wayness versus collision-resistance defined over quantum…
We present an explicit formula that produces hash collisions for the Merkle-Damg{\aa}rd construction. The formula works for arbitrary choice of message block and irrespective of the standardized constants used in hash functions, although…
Large-scale rare events data are commonly encountered in practice. To tackle the massive rare events data, we propose a novel distributed estimation method for logistic regression in a distributed system. For a distributed framework, we…
We provide a non-interactive quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any quantum one-way function. Our protocol is basically a parallel composition of the previous…
A fundamental theory is presented for the mechanical response of polymer networks undergoing large deformation which seamlessly integrates statistical mechanical principles with macroscopic thermodynamic constitutive theory. Our formulation…
Many commodity sensors that measure the robot and dynamic obstacle's state have non-Gaussian noise characteristics. Yet, many current approaches treat the underlying-uncertainty in motion and perception as Gaussian, primarily to ensure…
We give a lower bound for the non-collision probability up to a long time T in a system of n independent random walks with fixed obstacles on the two-dimensional lattice. By `collision' we mean collision between the random walks as well as…
This paper presents a class of new algorithms for distributed statistical estimation that exploit divide-and-conquer approach. We show that one of the key benefits of the divide-and-conquer strategy is robustness, an important…
Efficient trajectory optimization is essential for avoiding collisions in unstructured environments, but it remains challenging to have both speed and quality in the solutions. One reason is that second-order optimality requires calculating…
Motivated by the recent advances in the theory of stochastic partial differential equations involving nonlinear functions of distributions, like the Kardar-Parisi-Zhang (KPZ) equation, we reconsider the unique solvability of one-dimensional…
We consider a system of stochastic interacting particles with general diffusion coefficient and drift functions and we study the types of collisions that arise in them. In particular, interactions between particles are inversely…
In this paper, we consider contention resolution on a multiple-access communication channel. In this problem, a set of nodes arrive over time, each with a message it intends to send. In each time slot, each node may attempt to broadcast its…
We revisit the computation of a probability of collision in the context of automotive collision avoidance (also referred to as conflict detection in other contexts). After reviewing existing approaches to the definition and computation of a…
We consider two bivariate models with two-way interactions in context of risk and queueing theory. The two entities interact with each other by providing assistance but otherwise evolve independently. We focus on certain random quantities…
One-way functions are fundamental to classical cryptography and their existence remains a longstanding problem in computational complexity theory. Recently, a provable quantum one-way function has been identified, which maintains its…
Unsupervised fine-grained image hashing aims to learn compact binary codes that preserve subtle visual differences among highly similar instances without manual annotations. However, most existing methods neglect collision resistance,…