Maciej Obremski

Cited by

	All	Since 2019
Citations	669	483
h-index	11	11
i10-index	11	11

120

2013201420152016201720182019202020212022202320243 15 28 27 45 63 87 77 74 113 77 53

Public access

View all

18 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Divesh AggarwalNUSVerified email at nus.edu.sg
Tomasz Kazanaasystent, Uniwersytet WarszawskiVerified email at crypto.edu.pl
João RibeiroInstituto Superior Técnico, Universidade de LisboaVerified email at tecnico.ulisboa.pt
Mark SimkinCryptography ResearcherVerified email at univariate.org
Jesper Buus NielsenProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Maciej SkórskiUniversity of WarsawVerified email at mimuw.edu.pl
Stefan DziembowskiUniversity of Warsaw and IDEAS NCBRVerified email at mimuw.edu.pl
Luisa SiniscalchiTechnical University of DenmarkVerified email at dtu.dk
Yevgeniy DodisProfessor, New York UniversityVerified email at cs.nyu.edu
Ivan DamgårdProfessor of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Nico DöttlingFaculty at the Helmholtz Center for Information Security (CISPA)Verified email at cispa.de
Daniele VenturiFull Professor, Sapienza University of Rome, ItalyVerified email at di.uniroma1.it
Antonio FaonioEURECOMVerified email at eurecom.fr
Gianluca BrianETH ZürichVerified email at inf.ethz.ch
Eldon ChungCentre for Quantum Technologies, National University of SingaporeVerified email at u.nus.edu
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityVerified email at cs.au.dk
Ivan ViscontiSapienza University of RomeVerified email at uniroma1.it
Bhavana KanukurthiIndian Institute of Science, BangaloreVerified email at csa.iisc.ernet.in
Sruthi SekarComputer Science and Engineering, IIT BombayVerified email at iitb.ac.in
Giulio MalavoltaBocconi UniversityVerified email at unibocconi.it

Maciej Obremski

National University of Singapore

Verified email at nus.edu.sg - Homepage

Theoretical Computer Science Cryptography Information Theory Randomness Extractors Non-Malleable Codes


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Non-malleable codes from two-source extractors S Dziembowski, T Kazana, M Obremski CRYPTO, Annual Cryptology Conference, 239-257, 2013	147	2013
Non-malleable Reductions and Applications D Aggarwal, Y Dodis, T Kazana, M Obremski STOC'15, 2015	116	2015
Stronger leakage-resilient and non-malleable secret-sharing schemes for general access structures D Aggarwal, I Damgard, JB Nielsen, M Obremski, E Purwanto, J Ribeiro, ... CRYPTO’19, 2018	80	2018
Leakage-resilient non-malleable codes D Aggarwal, S Dziembowski, T Kazana, M Obremski Twelfth IACR Theory of Cryptography Conference (TCC 2015), 2014	62	2014
Continuous non-malleable codes in the 8-split-state model D Aggarwal, N Dottling, JB Nielsen, M Obremski, E Purwanto Eurocrypt, 2019	38*	2019
Inception makes non-malleable codes stronger D Aggarwal, T Kazana, M Obremski Theory of Cryptography Conference, 319-343, 2017	36	2017
A constant-rate non-malleable code in the split-state model. D Aggarwal, M Obremski FOCS 2020, 2020	35*	2020
Renyi Entropy Estimation Revisited M Obremski, M Skorski Approx'17, 2017	23	2017
Non-Malleable Secret Sharing against Bounded Joint-Tampering Attacks in the Plain Model G Brian, A Faonio, M Obremski, M Simkin, D Venturi CRYPTO 2020, 2020	22	2020
How to Extract Useful Randomness from Unreliable Sources D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti Eurocrypt 2020, 2019	17	2019
Rate one-third non-malleable codes D Aggarwal, B Kanukurthi, SLB Obbattu, M Obremski, S Sekar Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022	16	2022
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. D Aggarwal, M Obremski, JL Ribeiro, M Simkin, L Siniscalchi IEEE Transactions in Information Theory 2020, 1371, 2020	9*	2020
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. I Damgård, T Kazana, M Obremski, V Raj, L Siniscalchi TCC 2018, 596, 2018	8	2018
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free G Brian, A Faonio, M Obremski, J Ribeiro, M Simkin, M Skórski, D Venturi Eurocrypt 2021, 2021	7	2021
Quantum measurement adversary D Aggarwal, NG Boddu, R Jain, M Obremski IEEE Transactions on Information Theory, 2023	6	2023
Algebraic restriction codes and their applications D Aggarwal, N Döttling, J Dujmovic, M Hajiabadi, G Malavolta, ... ITCS'22, 2022	6	2022
Extractors: Low Entropy Requirements Colliding With Non-Malleability. E Chung, M Obremski, D Aggarwal IACR Cryptol. ePrint Arch. 2021, 1480, 2021	6*	2021
Complexity of Estimating Renyi Entropy of Markov Chains M Obremski, M Skórski IEEE International Symposium on Information Theory (ISIT) 2020, 2020	5	2020
Inverted Leftover Hash Lemma M Obremski, M Skorski IEEE International Symposium on Information Theory (ISIT), 2018	5	2018
Distributed shuffling in adversarial environments KG Larsen, M Obremski, M Simkin Cryptology ePrint Archive, 2022	4	2022

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors