115
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
104
Voted
FC
2004
Springer
15 years 7 months ago
2004
Springer
Most voting schemes rely on a number of authorities. If too many of these authorities are dishonest then voter privacy may be violated. To give stronger guarantees of voter privacy...
93
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
102
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer