Maciej Obremski

Picture by Zahra Jafargholi

BIO:

I am a Research Assistant Professor at School of Computing, National University of Singapore. Before that I have spent 5 years in  Divesh Aggarwal's group at National University of Singapore, at first as a Research Fellow, and since 2020 as a Senior Research Fellow. Before joining NUS I spent 3 years as a Post-doc at Aarhus University (Denmark) with Ivan Damgård and Jesper Buus Nielsen and 2 years at University of Warsaw (Poland). I got my Ph.D. in 2013 from the University of Warsaw under the supervision of Stefan Dziembowski.
My research revolves around the theory of computer science, mostly focused on problems inspired by the modern cryptography. We live in the world where cryptographic devices are physical objects that can leak information as well as be tampered with, and I'm excited to partake in the line of research that models and tackles the problems of leakage an tamper resilient cryptography

Research Interests:

• Information Theoretic Cryptography

• Randomness and Randomness Extractors 

• Non-Malleable Codes and Secret Sharing

Other Information:

• Email: cqtmlo@nus.edu.sg

• Supervision: 

  • Saswata Mukherjee 

  • Ananta Mukherjee  

  • Eldon Chung (awarded PhD in May'24)

• Program Committee member: 

  • Eurocrypt'26

  • Asiacrypt'25

  • ITC'25

  • Asiacrypt'24  Distinguished PC Member Award (7 out of 105 PC members received the award) 

  • ITC'24

  • ITC'23 

Publications:

Survey

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

In Submission

Published

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

Invertible Bloom Lookup Tables with Less Memory and Randomness

Quantum Measurement Adversary 

Engineering an Efficient DNF Counter

Distributed Shuffling in Adversarial Environments

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory ,
(Old version: Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors)

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

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

Extractors Lower Bounds, Revisited

Non-Malleable Secret Sharing against Bounded Joint-Tampering  Attacks in the Plain Model

Complexity of Estimating Renyi Entropy of Markov Chains

How to Extract Useful Randomness from Unreliable Sources

Stronger leakage-resilient and non-malleable secret-sharing schemes for general access structures

Continuous non-malleable codes in the 8-split-state model

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

Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters

Inverted Leftover Hash Lemma

Inception makes non-malleable codes stronger

Renyi Entropy Estimation Revisited

Non-malleable Reductions and Applications

Leakage-resilient non-malleable codes

Non-malleable codes from two-source extractors