Maciej Obremski
Senior Research Fellow
S15-04-15C/D
Preprints
- 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.
- 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
- 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)
- M Simkin, , M Skórski, , D Venturi, G Brian,, A Faonio, Maciej Lukasz Obremski, J Ribeiro, . (2022). The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Transactions on Information Theory
- 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
- J Ribeiro, J B Nielsen, Maciej Lukasz Obremski. (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
- M Skorski, Maciej Lukasz Obremski. (2020). Complexity of Estimating Renyi Entropy of Markov Chains. ISIT 2021
- 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
- Gianluca Brian, Antonio Faonio, Maciej Lukasz Obremski, Daniele Venturi, Mark Simkin. (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
- 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
- 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
