Divesh Aggarwal
Principal Investigator
S15-04-12
dcsdiva@nus.edu.sg
65165628
Divesh Aggarwal

Preprints

  • R. Jain, N.G. Boddu, D. Aggarwal. Quantum secure non-malleable codes in the split-state model.
  • R. Jain, N.G. Boddu, D. Aggarwal, Maciej Lukasz Obremski. Quantum Measurement Adversary.
  • Joao Ribeiro, Maciej Lukasz Obremski, D. Aggarwal, Luisa Siniscalchi, Mark Simkin . Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
  • Rajendra Kumar, Yanlin Chen, D. Aggarwal, Yixin Shen. Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
  • Maciej Lukasz Obremski, D. Aggarwal. A constant-rate non-malleable code in the split-state model..
  • Phong Q. Nguyen, Jianwei Li, D. Aggarwal, Noah Heskel Sklaire Stephens-Davidowitz. Slide Reduction, Revisited---Filling the Gaps in SVP Approximation.
  • Noah Heskel Sklaire Stephens-Davidowitz, D. Aggarwal. An improved constant in Banaszczyk\'s transference theorem.
  • D. Aggarwal, Maciej Lukasz Obremski. Inception makes non-malleable codes shorter as well!.

Publications

  • Maciej Lukasz Obremski, D. Aggarwal. (2022). A constant rate non-malleable code in the split-state model. IEEE Annual Symposium on Foundations of Computer Science (FOCS)
  • G Malavolta, Maciej Lukasz Obremski, D. Aggarwal, N Dottling, , J Dujmovic, , M Hajiabadi, . (2022). Algebraic Restriction Codes and their Applications. Innovations in Theoretical Computer Science (ITCS)
  • L Siniscalchi, J Ribeiro, M Simkin, Maciej Lukasz Obremski, D. Aggarwal. (2022). Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory . IEEE Transactions on Information Theory
  • Maciej Lukasz Obremski, D. Aggarwal, J Ribeiro, L Siniscalchi, I Visconti. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
  • Maciej Lukasz Obremski, J Ribeiro, , N Stephens-Davidowitz, D. Aggarwal, S Guo. (2020). Extractors Lower Bounds, Revisited. RANDOM
  • D. Aggarwal, Maciej Lukasz Obremski, Siyao Guo, Noah Heskel Sklaire Stephens-Davidowitz, Joao Ribeiro. (2020). Extractor Lower Bounds, Revisited. RANDOM
  • João Ribeiro, Maciej Lukasz Obremski, D. Aggarwal, Ivan Visconti, Luisa Siniscalchi. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
  • Ivan Damgard, Maciej Lukasz Obremski, D. Aggarwal, E. Purwanto, Mark Simkin, Joao Ribeiro, Jesper Buus Nielsen. (2019). Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO
  • Jesper Buus Nielsen, Nico Dottling, D. Aggarwal, E. Purwanto, Maciej Obremski. (2019). Continuous non-malleable codes in the 8-split-state model. Springer EUROCRYPT 531-561
  • D. Aggarwal, Kai-Min Chung, H.H. Lin, T. Vidick. (2019). A Quantum-Proof Non-Malleable Extractor, With Application to Privacy Amplification against Active Quantum Adversaries. Springer EUROCRYPT 442-469
  • T. Lee, Gavin K. Brennen, D. Aggarwal, M. Tomamichel, M. Santha. (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger 3
  • D. Aggarwal, N. Stephens-Davidowitz. (2018). (Gap/S)ETH Hardness of SVP. ACM STOC
  • P. Mukhopadhyay, D. Aggarwal. (2018). Improved algorithms for the Shortest Vector Problem and the Closest Vector Problem in the infinity norm. ISAAC
  • D. Aggarwal, A. Joux, A. Prakash, M. Santha. (2018). A new public-key cryptosystem via Mersenne numbers. CRYPTO
  • T. Lee, Gavin K. Brennen, D. Aggarwal, M. Tomamichel, M. Santha. (2018). Quantum attacks on Bitcoin, and how to protect against them. Ledger
  • D. Aggarwal, Noah Stephens-Davidowitz. (2018). Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP). Proceedings of the Symposium on Simplicity in Algorithms
  • D. Aggarwal, M. Obremski, T. Kazana. (2017). Inception makes non-malleable codes stronger. Theory of Cryptography
  • D. Aggarwal, O. Regev. (2016). A Note on Discrete Gaussian Combinations of Lattice Vectors. CJTCS 1
  • D. Aggarwal, U. Maurer. (2016). Breaking RSA Generically Is Equivalent to Factoring. IEEE Transactions on Information Theory 62 6251-6259
  • C. Dubey, D. Aggarwal. (2016). Improved hardness results for unique shortest vector problem. Inf. Proc. Lett 116 631-637
  • D. Aggarwal, S. Lovett, K. Hosseini. (2016). Affine-malleable extractors, spectrum doubling, and application to privacy amplification. IEEE ISIT
  • S Sekar, Maciej Lukasz Obremski, D. Aggarwal, B Obbattu, B Kanukurthi. Non-malleable Codes with rate 1/3 via Rate Boosters. Annual ACM Symposium on Theory of Computing (STOC)
  • Ivan Damgard, D. Aggarwal, Mark Simkin, Joao Ribeiro, Erick Purwanto, Jesper Buus Nielsen, Maciej Lukasz Obremski. Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO