1,155 research outputs found
Verifying proofs in constant depth
In this paper we initiate the study of proof systems where verification of proofs proceeds by NC circuits. We investigate the question which languages admit proof systems in this very restricted model. Formulated alternatively, we ask which languages can be enumerated by NC functions. Our results show that the answer to this problem is not determined by the complexity of the language. On the one hand, we construct NC proof systems for a variety of languages ranging from regular to NP-complete. On the other hand, we show by combinatorial methods that even easy regular languages such as Exact-OR do not admit NC proof systems. We also present a general construction of proof systems for regular languages with strongly connected NFA's
Fractional Fokker-Planck Equations for Subdiffusion with Space-and-Time-Dependent Forces
We have derived a fractional Fokker-Planck equation for subdiffusion in a
general space-and- time-dependent force field from power law waiting time
continuous time random walks biased by Boltzmann weights. The governing
equation is derived from a generalized master equation and is shown to be
equivalent to a subordinated stochastic Langevin equation.Comment: 5 page
The fractional Schr\"{o}dinger operator and Toeplitz matrices
Confining a quantum particle in a compact subinterval of the real line with
Dirichlet boundary conditions, we identify the connection of the
one-dimensional fractional Schr\"odinger operator with the truncated Toeplitz
matrices. We determine the asymptotic behaviour of the product of eigenvalues
for the -stable symmetric laws by employing the Szeg\"o's strong limit
theorem. The results of the present work can be applied to a recently proposed
model for a particle hopping on a bounded interval in one dimension whose
hopping probability is given a discrete representation of the fractional
Laplacian.Comment: 10 pages, 2 figure
Controlled Data Sharing for Collaborative Predictive Blacklisting
Although sharing data across organizations is often advocated as a promising
way to enhance cybersecurity, collaborative initiatives are rarely put into
practice owing to confidentiality, trust, and liability challenges. In this
paper, we investigate whether collaborative threat mitigation can be realized
via a controlled data sharing approach, whereby organizations make informed
decisions as to whether or not, and how much, to share. Using appropriate
cryptographic tools, entities can estimate the benefits of collaboration and
agree on what to share in a privacy-preserving way, without having to disclose
their datasets. We focus on collaborative predictive blacklisting, i.e.,
forecasting attack sources based on one's logs and those contributed by other
organizations. We study the impact of different sharing strategies by
experimenting on a real-world dataset of two billion suspicious IP addresses
collected from Dshield over two months. We find that controlled data sharing
yields up to 105% accuracy improvement on average, while also reducing the
false positive rate.Comment: A preliminary version of this paper appears in DIMVA 2015. This is
the full version. arXiv admin note: substantial text overlap with
arXiv:1403.212
On the Concrete Security of Goldreich’s Pseudorandom Generator
International audienceLocal pseudorandom generators allow to expand a short random string into a long pseudo-random string, such that each output bit depends on a constant number d of input bits. Due to its extreme efficiency features, this intriguing primitive enjoys a wide variety of applications in cryptography and complexity. In the polynomial regime, where the seed is of size n and the output of size n s for s > 1, the only known solution, commonly known as Goldreich's PRG, proceeds by applying a simple d-ary predicate to public random sized subsets of the bits of the seed. While the security of Goldreich's PRG has been thoroughly investigated, with a variety of results deriving provable security guarantees against class of attacks in some parameter regimes and necessary criteria to be satisfied by the underlying predicate, little is known about its concrete security and efficiency. Motivated by its numerous theoretical applications and the hope of getting practical instantiations for some of them, we initiate a study of the concrete security of Goldreich's PRG, and evaluate its resistance to cryptanalytic attacks. Along the way, we develop a new guess-and-determine-style attack, and identify new criteria which refine existing criteria and capture the security guarantees of candidate local PRGs in a more fine-grained way
A functional non-central limit theorem for jump-diffusions with periodic coefficients driven by stable Levy-noise
We prove a functional non-central limit theorem for jump-diffusions with
periodic coefficients driven by strictly stable Levy-processes with stability
index bigger than one. The limit process turns out to be a strictly stable Levy
process with an averaged jump-measure. Unlike in the situation where the
diffusion is driven by Brownian motion, there is no drift related enhancement
of diffusivity.Comment: Accepted to Journal of Theoretical Probabilit
Lognormal scale invariant random measures
In this article, we consider the continuous analog of the celebrated
Mandelbrot star equation with lognormal weights. Mandelbrot introduced this
equation to characterize the law of multiplicative cascades. We show existence
and uniqueness of measures satisfying the aforementioned continuous equation;
these measures fall under the scope of the Gaussian multiplicative chaos theory
developed by J.P. Kahane in 1985 (or possibly extensions of this theory). As a
by product, we also obtain an explicit characterization of the covariance
structure of these measures. We also prove that qualitative properties such as
long-range independence or isotropy can be read off the equation.Comment: 31 pages; Probability Theory and Related Fields (2012) electronic
versio
Private Outsourcing of Polynomial Evaluation and Matrix Multiplication using Multilinear Maps
{\em Verifiable computation} (VC) allows a computationally weak client to
outsource the evaluation of a function on many inputs to a powerful but
untrusted server. The client invests a large amount of off-line computation and
gives an encoding of its function to the server. The server returns both an
evaluation of the function on the client's input and a proof such that the
client can verify the evaluation using substantially less effort than doing the
evaluation on its own. We consider how to privately outsource computations
using {\em privacy preserving} VC schemes whose executions reveal no
information on the client's input or function to the server. We construct VC
schemes with {\em input privacy} for univariate polynomial evaluation and
matrix multiplication and then extend them such that the {\em function privacy}
is also achieved. Our tool is the recently developed {mutilinear maps}. The
proposed VC schemes can be used in outsourcing {private information retrieval
(PIR)}.Comment: 23 pages, A preliminary version appears in the 12th International
Conference on Cryptology and Network Security (CANS 2013
Secure Arithmetic Computation with Constant Computational Overhead
We study the complexity of securely evaluating an arithmetic circuit over a finite field in the setting of secure two-party computation with semi-honest adversaries. In all existing protocols, the number of arithmetic operations per
multiplication gate grows either linearly with or polylogarithmically with the security parameter. We present the first protocol that only makes a *constant* (amortized) number of field operations per gate. The protocol uses the underlying field as a black box, and its security is based on arithmetic analogues of well-studied cryptographic assumptions.
Our protocol is particularly appealing in the special case of securely evaluating a ``vector-OLE\u27\u27 function of the form , where is the input of one party and are the inputs of the other party. In this case, which is motivated by natural applications, our protocol can achieve an asymptotic rate of (i.e., the communication is dominated by sending roughly elements of ). Our implementation of this protocol suggests that it outperforms competing approaches even for relatively small fields and over fast networks.
Our technical approach employs two new ingredients that may be of independent interest. First, we present a general way to combine any linear code that has a fast encoder and a cryptographic (``LPN-style\u27\u27) pseudorandomness property with another linear code that supports fast encoding and *erasure-decoding*, obtaining a code that inherits both the pseudorandomness feature of the former code and the efficiency features of the latter code. Second, we employ local *arithmetic* pseudo-random generators, proposing arithmetic generalizations of boolean candidates that resist all known attacks
- …