Maciej Obremski

According to our database, Maciej Obremski authored at least 41 papers between 2013 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Minicrypt PIR for Big Batches.

Nico Döttling, Jesko Dujmovic, Julian Loss, Maciej Obremski

IACR Cryptol. ePrint Arch., 2025

On the Impossibility of Actively Secure Distributed Samplers.

Damiano Abram, Serge Fehr, Maciej Obremski, Peter Scholl

IACR Cryptol. ePrint Arch., 2025

Improved Lower Bounds for 3-Query Matching Vector Codes.

Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi

Proceedings of the 16th Innovations in Theoretical Computer Science Conference, 2025

Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy.

Divesh Aggarwal, Pranjal Dutta, Saswata Mukherjee, Satyajeet Nagargoje, Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024

Quantum Measurement Adversary.

Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski

IEEE Trans. Inf. Theory, January, 2024

Engineering an Efficient Approximate DNF-Counter.

Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski

CoRR, 2024

Invertible Bloom Lookup Tables with Less Memory and Randomness.

Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences.

Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi

Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions.

Damiano Abram, Maciej Obremski, Peter Scholl

IACR Cryptol. ePrint Arch., 2023

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.

Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz

Electron. Colloquium Comput. Complex., 2023

Engineering an Efficient Approximate DNF-Counter.

Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Extractors: Low Entropy Requirements Colliding with Non-malleability.

Divesh Aggarwal, Eldon Chung, Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Distributed Shuffling in Adversarial Environments.

Kasper Green Larsen, Maciej Obremski, Mark Simkin

Proceedings of the 4th Conference on Information-Theoretic Cryptography, 2023

2022

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IEEE Trans. Inf. Theory, 2022

Survey: Non-malleable code in the split-state model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.

Divesh Aggarwal, Marshall Ball, Maciej Obremski

Entropy, 2022

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.

Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro

Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Rate one-third non-malleable codes.

Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar

Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Algebraic Restriction Codes and Their Applications.

Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions.

Jesper Buus Nielsen, João Ribeiro, Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

2021

Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters.

Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar

Electron. Colloquium Comput. Complex., 2021

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.

Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi

Proceedings of the Advances in Cryptology - EUROCRYPT 2021, 2021

2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi

IACR Cryptol. ePrint Arch., 2020

Complexity of Estimating Rényi Entropy of Markov Chains.

Maciej Obremski, Maciej Skorski

Proceedings of the IEEE International Symposium on Information Theory, 2020

A constant rate non-malleable code in the split-state model.

Divesh Aggarwal, Maciej Obremski

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

How to Extract Useful Randomness from Unreliable Sources.

Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model.

Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi

Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

Extractor Lower Bounds, Revisited.

Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz

Proceedings of the Approximation, 2020

2019

Inception makes non-malleable codes shorter as well!

Divesh Aggarwal, Maciej Obremski

IACR Cryptol. ePrint Arch., 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.

Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto

Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures.

Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin

Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

2018

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments.

Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Inverted Leftover Hash Lemma.

Maciej Obremski, Maciej Skorski

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.

Nico Döttling, Jesper Buus Nielsen, Maciej Obremski

Electron. Colloquium Comput. Complex., 2017

Inception Makes Non-malleable Codes Stronger.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Renyi Entropy Estimation Revisited.

Maciej Obremski, Maciej Skorski

Proceedings of the Approximation, 2017

2015

Leakage-Resilient Non-malleable Codes.

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Non-malleable Reductions and Applications.

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2013

Non-malleable Codes from Two-Source Extractors.

Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013