The Planted k-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and CryptographySagnik Saha, Nikolaj I. Schwartzbach, and Prashant Nalini Vasudevan
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and SeparationsBenny Applebaum, Barak Arkis, Pavel Raykov, and Prashant Nalini Vasudevan