Maciej Obremski

Orcid: 0000-0003-4174-0438

According to our database1, Maciej Obremski authored at least 35 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum Measurement Adversary.
IEEE Trans. Inf. Theory, January, 2024

2023
Algebraic Restriction Codes and Their Applications.
Algorithmica, December, 2023

Invertible Bloom Lookup Tables with Less Memory and Randomness.
IACR Cryptol. ePrint Arch., 2023

On the (Im)possibility of Distributed Samplers: Lower Bounds and Party-Dynamic Constructions.
IACR Cryptol. ePrint Arch., 2023

On the randomized complexity of range avoidance, with applications to cryptography and metacomplexity.
Electron. Colloquium Comput. Complex., 2023

Engineering an Efficient Approximate DNF-Counter.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.
IEEE Trans. Inf. Theory, 2022

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.
IEEE Trans. Inf. Theory, 2022

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions.
IACR Cryptol. ePrint Arch., 2022

Distributed Shuffling in Adversarial Environments.
IACR Cryptol. ePrint Arch., 2022

Survey: Non-malleable code in the split-state model.
IACR Cryptol. ePrint Arch., 2022

Non-Malleable Code in the Split-State Model.
Entropy, 2022

2021
Rate One-Third Non-malleable Codes.
IACR Cryptol. ePrint Arch., 2021

Extractors: Low Entropy Requirements Colliding With Non-Malleability.
Electron. Colloquium Comput. Complex., 2021

Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters.
Electron. Colloquium Comput. Complex., 2021

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.
Electron. Colloquium Comput. Complex., 2021

2020
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.
IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.
IACR Cryptol. ePrint Arch., 2020

2019
Complexity of Estimating Renyi Entropy of Markov Chains.
IACR Cryptol. ePrint Arch., 2019

How to Extract Useful Randomness from Unreliable Sources.
IACR Cryptol. ePrint Arch., 2019

A constant-rate non-malleable code in the split-state model.
IACR Cryptol. ePrint Arch., 2019

Inception makes non-malleable codes shorter as well!
IACR Cryptol. ePrint Arch., 2019

Extractor Lower Bounds, Revisited.
Electron. Colloquium Comput. Complex., 2019

Continuous Non-Malleable Codes in the 8-Split-State Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments.
IACR Cryptol. ePrint Arch., 2018

Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters.
IACR Cryptol. ePrint Arch., 2018

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.
IACR Cryptol. ePrint Arch., 2018

2017
Renyi Entropy Estimation Revisited.
IACR Cryptol. ePrint Arch., 2017

Inverted Leftover Hash Lemma.
IACR Cryptol. ePrint Arch., 2017

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.
Electron. Colloquium Comput. Complex., 2017

2015
Inception Makes Non-malleable Codes Stronger.
IACR Cryptol. ePrint Arch., 2015

2014
Leakage-resilient non-malleable codes.
Electron. Colloquium Comput. Complex., 2014

Non-malleable Reductions and Applications.
Electron. Colloquium Comput. Complex., 2014

2013
Non-Malleable Codes from Two-Source Extractors.
IACR Cryptol. ePrint Arch., 2013


  Loading...