Folgen
Maciej Obremski
Titel
Zitiert von
Zitiert von
Jahr
Non-malleable codes from two-source extractors
S Dziembowski, T Kazana, M Obremski
CRYPTO, Annual Cryptology Conference, 239-257, 2013
1472013
Non-malleable Reductions and Applications
D Aggarwal, Y Dodis, T Kazana, M Obremski
STOC'15, 2015
1162015
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
802018
Leakage-resilient non-malleable codes
D Aggarwal, S Dziembowski, T Kazana, M Obremski
Twelfth IACR Theory of Cryptography Conference (TCC 2015), 2014
622014
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
362017
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
232017
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
222020
How to Extract Useful Randomness from Unreliable Sources
D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti
Eurocrypt 2020, 2019
172019
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
162022
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
82018
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
72021
Quantum measurement adversary
D Aggarwal, NG Boddu, R Jain, M Obremski
IEEE Transactions on Information Theory, 2023
62023
Algebraic restriction codes and their applications
D Aggarwal, N Döttling, J Dujmovic, M Hajiabadi, G Malavolta, ...
ITCS'22, 2022
62022
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
52020
Inverted Leftover Hash Lemma
M Obremski, M Skorski
IEEE International Symposium on Information Theory (ISIT), 2018
52018
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
D Aggarwal, T Kazana, M Obremski
IEEE International Symposium on Information Theory (ISIT), 2018
42018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20