Maciej Obremski

Citada per

	Totes	Des de 2020
Citacions	698	424
Índex h	11	11
Índex i10	11	11

120

20132014201520162017201820192020202120222023202420253 15 29 27 45 63 87 81 81 120 67 65 8

Accés públic

Mostra-ho tot

17 articles

0 articles

disponibles

no disponibles

Es basa en els requisits de les agències que proporcionen el finançament

Coautors

Divesh AggarwalNUSCorreu electrònic verificat a nus.edu.sg
Tomasz Kazanaasystent, Uniwersytet WarszawskiCorreu electrònic verificat a crypto.edu.pl
João RibeiroInstituto de Telecomunicações and Instituto Superior Técnico, Universidade de LisboaCorreu electrònic verificat a tecnico.ulisboa.pt
Mark SimkinCryptography ResearcherCorreu electrònic verificat a univariate.org
Jesper Buus NielsenProfessor of Computer Science, Aarhus UniversityCorreu electrònic verificat a cs.au.dk
Maciej SkórskiUniversity of WarsawCorreu electrònic verificat a mimuw.edu.pl
Stefan DziembowskiUniversity of Warsaw and IDEAS NCBRCorreu electrònic verificat a mimuw.edu.pl
Luisa SiniscalchiTechnical University of DenmarkCorreu electrònic verificat a dtu.dk
Daniele VenturiFull Professor, Sapienza University of Rome, ItalyCorreu electrònic verificat a di.uniroma1.it
Yevgeniy DodisProfessor, New York UniversityCorreu electrònic verificat a cs.nyu.edu
Ivan DamgårdProfessor of Computer Science, Aarhus UniversityCorreu electrònic verificat a cs.au.dk
Nico DöttlingFaculty at the Helmholtz Center for Information Security (CISPA)Correu electrònic verificat a cispa.de
Antonio FaonioEURECOMCorreu electrònic verificat a eurecom.fr
Gianluca BrianETH ZürichCorreu electrònic verificat a inf.ethz.ch
Bhavana KanukurthiIndian Institute of Science, BangaloreCorreu electrònic verificat a csa.iisc.ernet.in
Sruthi SekarComputer Science and Engineering, IIT BombayCorreu electrònic verificat a iitb.ac.in
Eldon ChungCentre for Quantum Technologies, National University of SingaporeCorreu electrònic verificat a u.nus.edu
Ivan ViscontiSapienza University of RomeCorreu electrònic verificat a uniroma1.it
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityCorreu electrònic verificat a cs.au.dk
Giulio MalavoltaBocconi UniversityCorreu electrònic verificat a unibocconi.it

Segueix

Maciej Obremski

National University of Singapore

Correu electrònic verificat a nus.edu.sg - Pàgina d'inici

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


Títol Ordena per cites Ordena per any Ordena per títol	Citada per Citada per	Any
Non-malleable codes from two-source extractors S Dziembowski, T Kazana, M Obremski CRYPTO, Annual Cryptology Conference, 239-257, 2013	151	2013
Non-malleable Reductions and Applications D Aggarwal, Y Dodis, T Kazana, M Obremski STOC'15, 2015	119	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	83	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	40*	2019
Inception makes non-malleable codes stronger D Aggarwal, T Kazana, M Obremski Theory of Cryptography Conference, 319-343, 2017	38	2017
A constant-rate non-malleable code in the split-state model. D Aggarwal, M Obremski FOCS 2020, 2020	37*	2020
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	24	2020
Renyi Entropy Estimation Revisited M Obremski, M Skorski Approx'17, 2017	23	2017
How to Extract Useful Randomness from Unreliable Sources D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti Eurocrypt 2020, 2019	20	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	9	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	8	2021
Quantum measurement adversary D Aggarwal, NG Boddu, R Jain, M Obremski IEEE Transactions on Information Theory 70 (1), 318-335, 2023	7	2023
Algebraic restriction codes and their applications D Aggarwal, N Döttling, J Dujmovic, M Hajiabadi, G Malavolta, ... ITCS'22, 2022	7	2022
Extractors: Low Entropy Requirements Colliding With Non-Malleability. E Chung, M Obremski, D Aggarwal IACR Cryptol. ePrint Arch. 2021, 1480, 2021	6*	2021
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions JB Nielsen, J Ribeiro, M Obremski Crypto 2022, 2022	5	2022
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

En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.

Articles 1–20

Cites per any

Cites duplicades

Cites combinades

Addició de coautorsCoautors

Segueix

Citada per

Coautors