相关论文: New coins from old: computing with unknown bias
How can two parties with competing interests carry out a fair coin flip, using only a noiseless quantum channel? This problem (quantum weak coin-flipping) was formalized more than 15 years ago, and, despite some phenomenal theoretical…
One-way functions are a very important notion in the field of classical cryptography. Most examples of such functions, including factoring, discrete log or the RSA function, can be, however, inverted with the help of a quantum computer. In…
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the…
In this article we show for the first time that quantum coin flipping with security guarantees that are strictly better than any classical protocol is possible to implement with current technology. Our protocol takes into account all…
The computation of higher order processes very often involves a large number of diagrams. In addition, it is in general not possible to solve the occurring integrals explicitly and expansions in small quantities have to be performed. This…
Consider a Poisson point process with unknown support boundary curve $g$, which forms a prototype of an irregular statistical model. We address the problem of estimating non-linear functionals of the form $\int \Phi(g(x))\,dx$. Following a…
We discuss the possibility of creating money that is physically impossible to counterfeit. Of course, "physically impossible" is dependent on the theory that is a faithful description of nature. Currently there are several proposals for…
Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…
Here several perfect simulation algorithms are brought under a single framework, and shown to derive from the same probabilistic result, called here the Fundamental Theorem of Perfect Simulation (FTPS). An exact simulation algorithm has…
We investigate weak coin flipping, a fundamental cryptographic primitive where two distrustful parties need to remotely establish a shared random bit. A cheating player can try to bias the output bit towards a preferred value. For weak coin…
From the minimal assumption of post-quantum semi-honest oblivious transfers, we build the first $\epsilon$-simulatable two-party computation (2PC) against quantum polynomial-time (QPT) adversaries that is both constant-round and black-box…
Faced with a sequence of N binary events, such as coin flips (or Ising spins), it is natural to ask whether these events reflect some underlying dynamic signals or are just random. Plausible models for the dynamics of hidden biases lead to…
Graphical tests assess whether a function of interest departs from an envelope of functions generated under a simulated null distribution. This approach originated in spatial statistics, but has recently gained some popularity in functional…
New estimators for the mean and the covariance function for partially observed functional data are proposed using a detour via the fundamental theorem of calculus. The new estimators allow for a consistent estimation of the mean and…
In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…
We propose, experimentally realize and study possible applications of a new type of logic element: random flip-flop. By definition it operates similarly to a conventional flip-flop except that it functions with probability of 1/2 otherwise…
We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…
A Boolean function $f:V \to \{-1,1\}$ on the vertex set of a graph $G=(V,E)$ is locally $p$-stable if for every vertex $v$ the proportion of neighbours $w$ of $v$ with $f(v)=f(w)$ is exactly $p$. This notion was introduced by Gross and…
In this paper we generalize the concept of a quasi-Cauchy sequence to a concept of a $p$-quasi-Cauchy sequence for any fixed positive integer $p$. For $p=1$ we obtain some earlier existing results as a special case. We obtain some…