Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Aggarwal, Divesh
add a person with the name Aggarwal, Divesh
 

Other publications of authors with the same name

Affine-malleable Extractors, Spectrum Doubling, and Application to Privacy Amplification., , and . IACR Cryptology ePrint Archive, (2015)Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract., , , and . STOC, page 733-742. ACM, (2015)Non-malleable Reductions and Applications., , , and . STOC, page 459-468. ACM, (2015)Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures., , , , , , and . CRYPTO (2), volume 11693 of Lecture Notes in Computer Science, page 510-539. Springer, (2019)Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding., , , and . STACS, volume 187 of LIPIcs, page 4:1-4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Algebraic Restriction Codes and Their Applications., , , , , and . ITCS, volume 215 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters., , and . ISIT, page 1131-1135. IEEE, (2018)Amplifying Privacy in Privacy Amplification., , , , and . CRYPTO (2), volume 8617 of Lecture Notes in Computer Science, page 183-198. Springer, (2014)Inception Makes Non-malleable Codes Stronger., , and . IACR Cryptology ePrint Archive, (2015)Non-malleable Codes from Additive Combinatorics., , and . IACR Cryptology ePrint Archive, (2013)