225 citations · 278 across the 25 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.CR2026
Secret Sharing from Non-Extractable Randomness
Divesh Aggarwal
Bosley and Dodis (TCC 2007) proved that a class of imperfect randomness sources that suffices for information-theoretic encryption of messages longer than the logarithm of the key…
cs.CR2026
Towards Worst-case Hardness for Low-Noise LPN
Divesh Aggarwal, Rishav Gupta, Hai Hoang Nguyen +2
The hardness of the Learning Parity with Noise (LPN) problem is a foundational assumption in cryptography, forming the basis of constructions ranging from symmetric-key primitives…
cs.CR2026
Hardness Amplification for (Sparse) LPN
Divesh Aggarwal, Rishav Gupta, Li Zeyong
We prove new hardness amplification results for Learning Parity with Noise () and its sparse variants. In , the goal is to recover a secret $\ve…