Non-Malleable Codes from Two-Source Extractors. - Stefan Dziembowski; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 2013)

Non-malleable Reductions and Applications. - Divesh Aggarwal; Yevgeniy Dodis; Tomasz Kazana; Maciej Obremski (Electron. Colloquium Comput. Complex., 2014)

Leakage-resilient non-malleable codes. - Divesh Aggarwal; Stefan Dziembowski; Tomasz Kazana; Maciej Obremski (Electron. Colloquium Comput. Complex., 2014)

Inception Makes Non-malleable Codes Stronger. - Divesh Aggarwal; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 2015)

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)

Inverted Leftover Hash Lemma. - Maciej Obremski; Maciej Skorski (IACR Cryptol. ePrint Arch., 2017)

Renyi Entropy Estimation Revisited. - Maciej Obremski; Maciej Skorski (IACR Cryptol. ePrint Arch., 2017)

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 002; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2018)

Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. - Divesh Aggarwal; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 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 (IACR Cryptol. ePrint Arch., 2018)

Continuous Non-Malleable Codes in the 8-Split-State Model. - Divesh Aggarwal; Nico Döttling; Jesper Buus Nielsen; Maciej Obremski; Erick Purwanto (EUROCRYPT (1), 2019)

Extractor Lower Bounds, Revisited. - Divesh Aggarwal; Siyao Guo; Maciej Obremski; João Ribeiro 002; Noah Stephens-Davidowitz (Electron. Colloquium Comput. Complex., 2019)

Inception makes non-malleable codes shorter as well! - Divesh Aggarwal; Maciej Obremski (IACR Cryptol. ePrint Arch., 2019)

A constant-rate non-malleable code in the split-state model. - Divesh Aggarwal; Maciej Obremski (IACR Cryptol. ePrint Arch., 2019)

How to Extract Useful Randomness from Unreliable Sources. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Luisa Siniscalchi; Ivan Visconti (IACR Cryptol. ePrint Arch., 2019)

Complexity of Estimating Renyi Entropy of Markov Chains. - Maciej Obremski; Maciej Skorski (IACR Cryptol. ePrint Arch., 2019)

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2020)

Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model. - Gianluca Brian; Antonio Faonio; Maciej Obremski; Mark Simkin 001; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2020)

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. - Divesh Aggarwal; Eldon Chung; Maciej Obremski; João Ribeiro 002 (Electron. Colloquium Comput. Complex., 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)

Extractors: Low Entropy Requirements Colliding With Non-Malleability. - Eldon Chung; Maciej Obremski; Divesh Aggarwal (Electron. Colloquium Comput. Complex., 2021)

Rate One-Third Non-malleable Codes. - Divesh Aggarwal; Bhavana Kanukurthi; Sai Lakshmi Bhavana Obbattu; Maciej Obremski; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2021)

Non-Malleable Code in the Split-State Model. - Divesh Aggarwal; Marshall Ball; Maciej Obremski (Entropy, 2022)

Survey: Non-malleable code in the split-state model. - Divesh Aggarwal; Marshall Ball; Maciej Obremski (IACR Cryptol. ePrint Arch., 2022)

Distributed Shuffling in Adversarial Environments. - Kasper Green Larsen; Maciej Obremski; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2022)

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. - Jesper Buus Nielsen; João Ribeiro 002; Maciej Obremski (IACR Cryptol. ePrint Arch., 2022)

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. - Divesh Aggarwal; Maciej Obremski; João Ribeiro 002; Mark Simkin 001; Luisa Siniscalchi (IEEE Trans. Inf. Theory, 2022)

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 002; Mark Simkin 001; Maciej Skórski; Daniele Venturi 001 (IEEE Trans. Inf. Theory, 2022)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (IJCAI, 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)

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions. - Damiano Abram; Maciej Obremski; Peter Scholl (IACR Cryptol. ePrint Arch., 2023)

Invertible Bloom Lookup Tables with Less Memory and Randomness. - Nils Fleischhacker; Kasper Green Larsen; Maciej Obremski; Mark Simkin 001 (IACR Cryptol. ePrint Arch., 2023)

Algebraic Restriction Codes and Their Applications. - Divesh Aggarwal; Nico Döttling; Jesko Dujmovic; Mohammad Hajiabadi; Giulio Malavolta; Maciej Obremski (Algorithmica, 2023)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Uddalok Sarkar; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (CoRR, 2024)

Improved Lower Bounds for 3-Query Matching Vector Codes. - Divesh Aggarwal; Pranjal Dutta; Zeyong Li; Maciej Obremski; Sidhant Saraogi (Electron. Colloquium Comput. Complex., 2024)

Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. - Maciej Obremski; João Ribeiro 002; Lawrence Roy; François-Xavier Standaert; Daniele Venturi 001 (IACR Cryptol. ePrint Arch., 2024)

Quantum Measurement Adversary. - Divesh Aggarwal; Naresh Goud Boddu; Rahul Jain 001; Maciej Obremski (IEEE Trans. Inf. Theory, 2024)

Efficient randomized strong 2-source non-malleable extractor for any linear min-entropy. - Divesh Aggarwal; Pranjal Dutta; Saswata Mukherjee 001; Satyajeet Nagargoje; Maciej Obremski (Electron. Colloquium Comput. Complex., 2025)

Minicrypt PIR for Big Batches. - Nico Döttling; Jesko Dujmovic; Julian Loss; Maciej Obremski (IACR Cryptol. ePrint Arch., 2025)