Maciej Obremski

About Maciej Obremski

Maciej Obremski, With an exceptional h-index of 11 and a recent h-index of 11 (since 2020), a distinguished researcher at National University of Singapore, specializes in the field of Theoretical Computer Science, Cryptography, Information Theory, Randomness Extractors, Non-Malleable Codes.

His recent articles reflect a diverse array of research interests and contributions to the field:

Quantum measurement adversary

Engineering an efficient approximate dnf-counter

Invertible bloom lookup tables with less memory and randomness

On the (Im) possibility of distributed samplers: lower bounds and party-dynamic constructions

Rate one-third non-malleable codes

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

Distributed shuffling in adversarial environments

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions

Maciej Obremski Information

University

Position

___

Citations(all)

613

Citations(since 2020)

421

Cited By

368

hIndex(all)

11

hIndex(since 2020)

11

i10Index(all)

11

i10Index(since 2020)

11

Email

University Profile Page

Google Scholar

Maciej Obremski Skills & Research Interests

Theoretical Computer Science

Cryptography

Information Theory

Randomness Extractors

Non-Malleable Codes

Top articles of Maciej Obremski

Quantum measurement adversary

IEEE Transactions on Information Theory

2023/9/8

Engineering an efficient approximate dnf-counter

2023/8/19

Invertible bloom lookup tables with less memory and randomness

Cryptology ePrint Archive

2023

On the (Im) possibility of distributed samplers: lower bounds and party-dynamic constructions

Cryptology ePrint Archive

2023

Maciej Obremski
Maciej Obremski

H-Index: 8

Peter Scholl
Peter Scholl

H-Index: 18

Rate one-third non-malleable codes

2022/6/9

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

Cryptology ePrint Archive

2022

Divesh Aggarwal
Divesh Aggarwal

H-Index: 15

Maciej Obremski
Maciej Obremski

H-Index: 8

Distributed shuffling in adversarial environments

Cryptology ePrint Archive

2022

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions

2022/8/15

Jesper Buus Nielsen
Jesper Buus Nielsen

H-Index: 31

Maciej Obremski
Maciej Obremski

H-Index: 8

Algebraic restriction codes and their applications

ITCS'22

2022

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

TCC 2022

2022

Divesh Aggarwal
Divesh Aggarwal

H-Index: 15

Maciej Obremski
Maciej Obremski

H-Index: 8

Extractors: Low Entropy Requirements Colliding With Non-Malleability.

IACR Cryptol. ePrint Arch.

2021/11/7

Maciej Obremski
Maciej Obremski

H-Index: 8

Divesh Aggarwal
Divesh Aggarwal

H-Index: 15

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

IEEE Transactions on Information Theory

2022/7/26

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

2020/8/10

Extractors Lower Bounds, Revisited

2020

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

2020

Divesh Aggarwal
Divesh Aggarwal

H-Index: 15

Maciej Obremski
Maciej Obremski

H-Index: 8

Complexity of Estimating Renyi Entropy of Markov Chains

2020

Maciej Obremski
Maciej Obremski

H-Index: 8

See List of Professors in Maciej Obremski University(National University of Singapore)

Co-Authors

academic-engine