Zobrazeno 1 - 10
of 55
pro vyhledávání: '"Gabizon, Ariel"'
A basic combinatorial interpretation of Shannon's entropy function is via the "20 questions" game. This cooperative game is played by two players, Alice and Bob: Alice picks a distribution $\pi$ over the numbers $\{1,\ldots,n\}$, and announces it to
Externí odkaz:
http://arxiv.org/abs/1611.01655
Autor:
Ben-Sasson, Eli, Chiesa, Alessandro, Forbes, Michael A., Gabizon, Ariel, Riabzev, Michael, Spooner, Nicholas
We present the first constructions of single-prover proof systems that achieve perfect zero knowledge (PZK) for languages beyond NP, under no intractability assumptions: 1. The complexity class #P has PZK proofs in the model of Interactive PCPs (IPCP
Externí odkaz:
http://arxiv.org/abs/1610.03798
We examine a protocol $\pi_{\text{beacon}}$ that outputs unpredictable and publicly verifiable randomness, meaning that the output is unknown at the time that $\pi_{\text{beacon}}$ starts, yet everyone can verify that the output is close to uniform a
Externí odkaz:
http://arxiv.org/abs/1605.04559
Autor:
Bshouty, Nader H., Gabizon, Ariel
Roughly speaking, an $(n,(r,s))$-Cover Free Family (CFF) is a small set of $n$-bit strings such that: "in any $d:=r+s$ indices we see all patterns of weight $r$". CFFs have been of interest for a long time both in discrete mathematics as part of bloc
Externí odkaz:
http://arxiv.org/abs/1507.07368
In parameterized complexity, it is a natural idea to consider different generalizations of classic problems. Usually, such generalization are obtained by introducing a "relaxation" variable, where the original problem corresponds to setting this vari
Externí odkaz:
http://arxiv.org/abs/1411.6756
We propose a new model of a weakly random source that admits randomness extraction. Our model of additive sources includes such natural sources as uniform distributions on arithmetic progressions (APs), generalized arithmetic progressions (GAPs), and
Externí odkaz:
http://arxiv.org/abs/1410.7253
We study decentralized cryptocurrency protocols in which the participants do not deplete physical scarce resources. Such protocols commonly rely on Proof of Stake, i.e., on mechanisms that extend voting power to the stakeholders of the system. We off
Externí odkaz:
http://arxiv.org/abs/1406.5694
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and decoding alg
Externí odkaz:
http://arxiv.org/abs/1404.7739
Autor:
Ben-Basat, Ran, Gabizon, Ariel
Let $G$ be a directed graph on $n$ vertices. Given an integer $k<=n$, the SIMPLE $k$-PATH problem asks whether there exists a simple $k$-path in $G$. In case $G$ is weighted, the MIN-WT SIMPLE $k$-PATH problem asks for a simple $k$-path in $G$ of min
Externí odkaz:
http://arxiv.org/abs/1401.5707
An $r$-simple $k$-path is a {path} in the graph of length $k$ that passes through each vertex at most $r$ times. The $r$-SIMPLE $k$-PATH problem, given a graph $G$ as input, asks whether there exists an $r$-simple $k$-path in $G$. We first show that
Externí odkaz:
http://arxiv.org/abs/1312.4863