Related papers: Oblivious Stash Shuffle
Distributed implementations of access control abound in distributed storage protocols. While such implementations are often accompanied by informal justifications of their correctness, our formal analysis reveals that their correctness can…
In this paper, we consider the problem of order preservation under addition and multiplication operators over the vector space of univariate real-valued random variables. Consistent with the case of usual order over the real numbers-as…
This paper has been withdrawn.
In a recent Letter [G. Chiribella et al., Phys. Rev. Lett. 98, 120501 (2007)], four protocols were proposed to secretly transmit a reference frame. Here We point out that in these protocols an eavesdropper can change the transmitted…
We present an improved incremental selection algorithm of the selection algorithm presented in [1] and prove all the selected conjectures.
This is a preliminary study for bifurcation in fractional order dynamical systems. Stability, persistence and hopf bifurcation are studied. Some studies are also done for functional equations.
Consider the following method of card shuffling. Start with a deck of $N$ cards numbered 1 through N. Fix a parameter $p$ between 0 and 1. In this model a ``shuffle'' consists of uniformly selecting a pair of adjacent cards and then…
In this talk I will introduce the principle of stochastic stability and discussing its consequences both at equilibrium and off-equilibrium.
We analyze superpositions of ortho- and para-Helium states, considering the possible existence of stationary and metastable states in the system. In particular, the metastable superposition of 1s2s ortho and para states seems to be…
Key-exchange protocols have been overlooked as a possible means for implementing oblivious transfer (OT). In this paper we present a protocol for mutual exchange of secrets, 1-out-of-2 OT and coin flipping similar to Diffie-Hellman protocol…
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…
Diffuse scattering is usually associated with some disorder in the analyzed material. Different kinds of disorder may produce different diffuse scattering -- or not. In this letter, we demonstrate some aspects of the variety of diffuse…
A famous conjecture of Chowla states that the Liouville function $\lambda(n)$ has negligible correlations with its shifts. Recently, the authors established a weak form of the logarithmically averaged Elliott conjecture on correlations of…
This note adds some critical remarks on the discussion presented in the McDonald's paper ([1]) on stability of steady motion of the well known problem of a disk rolling on a rough horizontal plane.
A new protocol for 1-2 (String) Oblivious Transfer is proposed. The protocol uses 5 rounds of message exchange.
This report provides my mathematical findings regarding the Mochizuki-Scholze-Stix controversy surrounding Mochizuki's Inter-Universal Teichm\"uller Theory.
This paper concerns the reliability of a pair of coupled oscillators in response to fluctuating inputs. Reliability means that an input elicits essentially identical responses upon repeated presentations regardless of the network's initial…
We investigate a one-time single shelf shuffle by establishing the position matrix explicitly. In some cases, we prove a no-feedback optimal guessing strategy. A general no-feedback strategy is conjectured, and asymptotics for the expected…
Recent developments regarding index and overlap construction for staggered fermions are reviewed, highlighting the surprising and unexpected aspects.
In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi…