Maciej Obremski
Status: Alumnus (data might not be up-to-date)
Former Senior Research Fellow
Preprints
- D. Aggarwal, R. Jain, N.G. Boddu, Maciej Lukasz Obremski. Quantum Measurement Adversary.
- D. Aggarwal, Joao Ribeiro, Mark Simkin , Luisa Siniscalchi, Maciej Lukasz Obremski. Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
- D. Aggarwal, Maciej Lukasz Obremski. 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
- D. Aggarwal, Maciej Lukasz Obremski. (2022). A constant rate non-malleable code in the split-state model. IEEE Annual Symposium on Foundations of Computer Science (FOCS)
- D Venturi, M Skórski, , M Simkin, , J Ribeiro, , A Faonio, G Brian,, Maciej Lukasz Obremski. (2022). The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Trans. Inf.
- D. Aggarwal, G Malavolta, M Hajiabadi, , J Dujmovic, , N Dottling, , Maciej Lukasz Obremski. (2022). Algebraic Restriction Codes and their Applications. Innovations in Theoretical Computer Science (ITCS)
- L Siniscalchi, M Simkin, J Ribeiro, D. Aggarwal, Maciej Lukasz Obremski. (2022). Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory . IEEE Trans. Inf.
- J B Nielsen, J Ribeiro, Maciej Lukasz Obremski. (2022). Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. Proceedings of CRYPTO
- J Ribeiro, L Siniscalchi, I Visconti, D. Aggarwal, Maciej Lukasz Obremski. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
- M Skorski, Maciej Lukasz Obremski. (2020). Complexity of Estimating Renyi Entropy of Markov Chains. ISIT 2021
- N Stephens-Davidowitz, J Ribeiro, , S Guo, D. Aggarwal, Maciej Lukasz Obremski. (2020). Extractors Lower Bounds, Revisited. RANDOM
- Siyao Guo, D. Aggarwal, Joao Ribeiro, Noah Heskel Sklaire Stephens-Davidowitz, Maciej Lukasz Obremski. (2020). Extractor Lower Bounds, Revisited. RANDOM
- Antonio Faonio, Gianluca Brian, Mark Simkin, Daniele Venturi, 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
- D. Aggarwal, João Ribeiro, Luisa Siniscalchi, Ivan Visconti, Maciej Lukasz Obremski. (2020). How to Extract Useful Randomness from Unreliable Sources. Proceedings of EUROCRYPT
- D. Aggarwal, Ivan Damgard, Jesper Buus Nielsen, Joao Ribeiro, Mark Simkin, E. Purwanto, Maciej Lukasz Obremski. (2019). Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. Proceedings of CRYPTO
- D. Aggarwal, S Sekar, B Kanukurthi, B Obbattu, Maciej Lukasz Obremski. Non-malleable Codes with rate 1/3 via Rate Boosters. Annual ACM Symposium on Theory of Computing (STOC)
