ECCC
2008
13 years 11 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
ECCC
2008
13 years 11 months ago
2008
In a two player game, a referee asks two cooperating players (who are not allowed to communicate) questions sampled from some distribution and decides whether they win or not base...
ECCC
2008
13 years 11 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
ECCC
2008
13 years 11 months ago
2008
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...