c-Unique Shortest Vector Problem is Hard

Vadim Lyubashevsky. c-Unique Shortest Vector Problem is Hard. IACR Cryptology ePrint Archive, 2008:504, 2008. [doi]

Abstract

Abstract is missing.