Public-key encryption from planted clique and noisy k-LIN
The construction is secure against polynomial-size adversaries under two average-case conjectures and answers a STOC 2010 question.
Stories per day · 30 days
1 stories, newest first · one card per story