Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
1
0
2
Public key encryption can be plausibly secured against quasi-exponential attacks by exploiting the surprising hardness of constraint satisfaction problems where almost all constraints are corrupted.