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