Maciej Obremski
Senior Research Fellow
S15-04-15C/D
cqtmlo@nus.edu.sg
Divesh Aggarwal

Preprints

  • Luisa Siniscalchi, Mark Simkin , Joao Ribeiro, Maciej Lukasz Obremski, D. Aggarwal. Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
  • Maciej Lukasz Obremski, D. Aggarwal. A constant-rate non-malleable code in the split-state model..
  • D. Aggarwal, Maciej Lukasz Obremski. Inception makes non-malleable codes shorter as well!.

Publications

  • Noah Heskel Sklaire Stephens-Davidowitz, Joao Ribeiro, D. Aggarwal, Maciej Lukasz Obremski, Siyao Guo. (2020). Extractor Lower Bounds, Revisited. RANDOM
  • Daniele Venturi, Mark Simkin, Gianluca Brian, Antonio Faonio, Maciej Lukasz Obremski. (2020). Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model. Proceedings of CRYPTO
  • Maciej Skorski, Maciej Lukasz Obremski. (2020). Complexity of Estimating Renyi Entropy of Markov Chains. IEEE International Symposium on Information Theory
  • Ivan Visconti, Luisa Siniscalchi, João Ribeiro, Maciej Lukasz Obremski, D. Aggarwal. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
  • E. Purwanto, Mark Simkin, Joao Ribeiro, Jesper Buus Nielsen, Ivan Damgard, Maciej Lukasz Obremski, D. Aggarwal. (2019). Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO
  • Mark Simkin, Joao Ribeiro, Erick Purwanto, Jesper Buus Nielsen, Maciej Lukasz Obremski, Ivan Damgard, D. Aggarwal. Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO