In the last few days, a Denial of Service attack was launched on universities in Israel, leading the administrators of the Israel Academic network to block access to it from the global internet. Consequently, websites such as ECCC have been accessible only from within the Israeli and European academic networks.
It seems that this blocking was just removed, and we hope it will not be put back in the future.
Needless to say, deciding on such blocking is not in our control, but we do apologize for this disruption of service.
Modern cryptography relies on the intractability of computational problems. We present an approach to build cryptography from a new source of hardness: proving mathematical theorems.
Our main result is a construction of succinct non-interactive arguments (SNARGs) for NP under standard derandomization (prBPP = prP) and cryptographic assumptions (LWE and SXDH), ... more >>>
The symmetric determinantal complexity $\sdc(f)$ of a polynomial $f$ is the
least $m$ such that $f=\Det(M)$ for an $m\times m$ symmetric matrix $M$ of
affine-linear forms. We prove, over $\CC$, that
\[
\sdc\!\left(\sum_{i=1}^n x_i^n\right)
\ge \left(\frac{1}{2e}-o(1)\right)n^2 .
\]
The result is a symmetric companion to the author's non-symmetric ...
more >>>
I refute the 1995 dream XOR lemma conjecture by Goldreich, Nisan, and Wigderson. I also give a counterexample to the XOR lemma for low-degree polynomials.
more >>>
