相关论文: New coins from old: computing with unknown bias
Functional encryption is a powerful cryptographic primitive that enables fine-grained access to encrypted data and underlies numerous applications. Although the ideal security notion for FE (simulation security) has been shown to be…
A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way…
This paper is devoted to the $L^p(\mathbb R)$ theory of the fractional Fourier transform (FRFT) for $1\le p < 2$. In view of the special structure of the FRFT, we study FRFT properties of $L^1$ functions, via the introduction of a suitable…
In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…
In this paper, we prove classical coin-flipping secure in the presence of quantum adversaries. The proof uses a recent result of Watrous [Wat09] that allows quantum rewinding for protocols of a certain form. We then discuss two…
Fake coin problems using balance scales to identify one fake coin and its type among n coins (n > 2) were solved by Dyson in 1946. Dyson gave adaptive solutions with the minimum number of weighings where later weighings may be dependent on…
Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without…
The Bernoulli Factory is an algorithm that takes as input a series of i.i.d. Bernoulli random variables with an unknown but fixed success probability $p$, and outputs a corresponding series of Bernoulli random variables with success…
The no-cloning theorem can be used as a basis for quantum money constructions which guarantee unconditionally unforgeable currency. Existing schemes, however, either (i) require long-term quantum memory and quantum communication between the…
In 1975 Voronin proved the universality theorem for the Riemann zeta-function $\zeta(s)$ which roughly says that any admissible function $f(s)$ is approximated by $\zeta(s)$. A few years later Reich proved a discrete analogue of this…
We propose a general way of constructing zero-knowledge authentication schemes from actions of a semigroup on a set, without exploiting any specific algebraic properties of the set acted upon. Then we give several concrete realizations of…
We show that a computable function $f:\mathbb R\rightarrow\mathbb R$ has Luzin's property (N) if and only if it reflects $\Pi^1_1$-randomnes, if and only if it reflects $\Delta^1_1(\mathcal O)$-randomness, and if and only if it reflects…
You play the following game: you start out with $n$ coins that all have probability $p$ to land heads. You toss all of them and you then need to set aside at least one of them, which will not be tossed again. Now you repeat the process with…
Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in…
The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are…
The fixed-point (FP) action in QCD, although it is local and determined by classical equations, is difficult to parametrize well and is expensive to simulate. But the stake is high: the FP action has scale invariant instanton solutions, has…
$CMO$ functions are completely multiplicative functions $f$ for which $\sum_{n=1}^\infty f(n)$ $=0$. These functions were first introduced and studied by Kahane and Sa\"{i}as [5]. The main purpose of this paper is to generalise such…
We investigate a specific infinite urn scheme first considered by Karlin (1967). We prove functional central limit theorems for the total number of urns with at least k balls for different k.
Is is shown here that the "simple test of quantumness for a single system" of arXiv:0704.1962 (for a recent experimental realization see arXiv:0804.1646) has exactly the same relation to the discussion of to the problem of describing the…
We extend the theoretical results for any FOU(p) processes for the case in which the Hurst parameter is less than 1/2 and we show theoretically and by simulations that under some conditions on T and the sample size n it is possible to…