Maciej Obremski

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 60

Top Topics

Optimal Parameters

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

Publications

Mate Soos, Uddalok Sarkar, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski
Engineering an Efficient Approximate DNF-Counter. CoRR (2024)
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
Quantum Measurement Adversary. IEEE Trans. Inf. Theory 70 (1) (2024)
Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. (2024)
Maciej Obremski, João Ribeiro, Lawrence Roy, François-Xavier Standaert, Daniele Venturi
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. IACR Cryptol. ePrint Arch. 2024 (2024)
Mate Soos, Divesh Aggarwal, Sourav Chakraborty, Kuldeep S. Meel, Maciej Obremski
Engineering an Efficient Approximate DNF-Counter. IJCAI (2023)
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
Invertible Bloom Lookup Tables with Less Memory and Randomness. CoRR (2023)
Divesh Aggarwal, Eldon Chung, Maciej Obremski
Extractors: Low Entropy Requirements Colliding with Non-malleability. CRYPTO (2) (2023)
Nils Fleischhacker, Kasper Green Larsen, Maciej Obremski, Mark Simkin
Invertible Bloom Lookup Tables with Less Memory and Randomness. IACR Cryptol. ePrint Arch. 2023 (2023)
Damiano Abram, Maciej Obremski, Peter Scholl
On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions. IACR Cryptol. ePrint Arch. 2023 (2023)
Kasper Green Larsen, Maciej Obremski, Mark Simkin
Distributed Shuffling in Adversarial Environments. ITC (2023)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and Their Applications. Algorithmica 85 (12) (2023)
Eldon Chung, Alexander Golovnev, Zeyong Li, Maciej Obremski, Sidhant Saraogi, Noah Stephens-Davidowitz
On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity. Electron. Colloquium Comput. Complex. (2023)
Jesper Buus Nielsen, João L. Ribeiro, Maciej Obremski
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2022 (2022)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Survey: Non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2022 (2022)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and Their Applications. ITCS (2022)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Rate one-third non-malleable codes. STOC (2022)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) (2022)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68 (8) (2022)
Gianluca Brian, Antonio Faonio, Maciej Obremski, João L. Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Trans. Inf. Theory 68 (12) (2022)
Divesh Aggarwal, Marshall Ball, Maciej Obremski
Non-Malleable Code in the Split-State Model. Entropy 24 (8) (2022)
Jesper Buus Nielsen, João L. Ribeiro, Maciej Obremski
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. CRYPTO (1) (2022)
Kasper Green Larsen, Maciej Obremski, Mark Simkin
Distributed Shuffling in Adversarial Environments. IACR Cryptol. ePrint Arch. 2022 (2022)
Divesh Aggarwal, Nico Döttling, Jesko Dujmovic, Mohammad Hajiabadi, Giulio Malavolta, Maciej Obremski
Algebraic Restriction Codes and their Applications. IACR Cryptol. ePrint Arch. 2021 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. Electron. Colloquium Comput. Complex. 28 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. CoRR (2021)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Rate One-Third Non-malleable Codes. IACR Cryptol. ePrint Arch. 2021 (2021)
Eldon Chung, Maciej Obremski, Divesh Aggarwal
Extractors: Low Entropy Requirements Colliding With Non-Malleability. IACR Cryptol. ePrint Arch. 2021 (2021)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Electron. Colloquium Comput. Complex. 28 (2021)
Divesh Aggarwal, Eldon Chung, Maciej Obremski, João L. Ribeiro
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. IACR Cryptol. ePrint Arch. 2021 (2021)
Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain, Maciej Obremski
Quantum Measurement Adversary. CoRR (2021)
Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Electron. Colloquium Comput. Complex. 28 (2021)
Gianluca Brian, Antonio Faonio, Maciej Obremski, João L. Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. EUROCRYPT (2) (2021)
Gianluca Brian, Antonio Faonio, Maciej Obremski, João L. Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Siyao Guo, Maciej Obremski, João L. Ribeiro, Noah Stephens-Davidowitz
Extractor Lower Bounds, Revisited. APPROX-RANDOM (2020)
Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model. CRYPTO (3) (2020)
Divesh Aggarwal, Maciej Obremski
A constant rate non-malleable code in the split-state model. FOCS (2020)
Maciej Obremski, Maciej Skorski
Complexity of Estimating Rényi Entropy of Markov Chains. ISIT (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) (2020)
Gianluca Brian, Antonio Faonio, Maciej Obremski, Mark Simkin, Daniele Venturi
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Mark Simkin, Luisa Siniscalchi
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020 (2020)
Divesh Aggarwal, Siyao Guo, Maciej Obremski, João L. Ribeiro, Noah Stephens-Davidowitz
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. 26 (2019)
Divesh Aggarwal, Maciej Obremski
Inception makes non-malleable codes shorter as well! IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Maciej Obremski, João L. Ribeiro, Luisa Siniscalchi, Ivan Visconti
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João L. Ribeiro, Mark Simkin
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) (2019)
Divesh Aggarwal, Maciej Obremski
A constant-rate non-malleable code in the split-state model. IACR Cryptol. ePrint Arch. 2019 (2019)
Maciej Obremski, Maciej Skorski
Complexity of Estimating Renyi Entropy of Markov Chains. IACR Cryptol. ePrint Arch. 2019 (2019)
Divesh Aggarwal, Nico Döttling, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto
Continuous Non-Malleable Codes in the 8-Split-State Model. EUROCRYPT (1) (2019)
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. IACR Cryptol. ePrint Arch. 2018 (2018)
Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João L. Ribeiro, Mark Simkin
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018 (2018)
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. TCC (2) (2018)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. IACR Cryptol. ePrint Arch. 2018 (2018)
Maciej Obremski, Maciej Skorski
Inverted Leftover Hash Lemma. ISIT (2018)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters. ISIT (2018)
Maciej Obremski, Maciej Skorski
Renyi Entropy Estimation Revisited. APPROX-RANDOM (2017)
Maciej Obremski, Maciej Skorski
Renyi Entropy Estimation Revisited. IACR Cryptol. ePrint Arch. 2017 (2017)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Inception Makes Non-malleable Codes Stronger. TCC (2) (2017)
Nico Döttling, Jesper Buus Nielsen, Maciej Obremski
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. IACR Cryptol. ePrint Arch. 2017 (2017)
Nico Döttling, Jesper Buus Nielsen, Maciej Obremski
Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model. Electron. Colloquium Comput. Complex. 24 (2017)
Maciej Obremski, Maciej Skorski
Inverted Leftover Hash Lemma. IACR Cryptol. ePrint Arch. 2017 (2017)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-Resilient Non-malleable Codes. TCC (1) (2015)
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
Inception Makes Non-malleable Codes Stronger. IACR Cryptol. ePrint Arch. 2015 (2015)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. STOC (2015)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. IACR Cryptol. ePrint Arch. 2014 (2014)
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
Non-malleable Reductions and Applications. Electron. Colloquium Comput. Complex. 21 (2014)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-resilient non-malleable codes. IACR Cryptol. ePrint Arch. 2014 (2014)
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Leakage-resilient non-malleable codes. Electron. Colloquium Comput. Complex. 21 (2014)
Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Non-Malleable Codes from Two-Source Extractors. IACR Cryptol. ePrint Arch. 2013 (2013)
Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Non-malleable Codes from Two-Source Extractors. CRYPTO (2) (2013)