Obserwuj
Maciej Obremski
Tytuł
Cytowane przez
Cytowane przez
Rok
Non-malleable codes from two-source extractors
S Dziembowski, T Kazana, M Obremski
CRYPTO, Annual Cryptology Conference, 239-257, 2013
1282013
Non-malleable Reductions and Applications
D Aggarwal, Y Dodis, T Kazana, M Obremski
STOC'15, 2015
1012015
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
582018
Leakage-resilient non-malleable codes
D Aggarwal, S Dziembowski, T Kazana, M Obremski
Twelfth IACR Theory of Cryptography Conference (TCC 2015), 2014
552014
Continuous non-malleable codes in the 8-split-state model
D Aggarwal, N Dottling, JB Nielsen, M Obremski, E Purwanto
Eurocrypt, 2019
35*2019
Inception makes non-malleable codes stronger
D Aggarwal, T Kazana, M Obremski
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
322017
A constant-rate non-malleable code in the split-state model.
D Aggarwal, M Obremski
FOCS 2020, 2020
21*2020
Renyi Entropy Estimation Revisited
M Obremski, M Skorski
Approx'17, 2017
202017
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
152020
How to Extract Useful Randomness from Unreliable Sources
D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti
Eurocrypt 2020, 2019
122019
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
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
72022
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
7*2020
Extractors: Low entropy requirements colliding with non-malleability
E Chung, M Obremski, D Aggarwal
arXiv preprint arXiv:2111.04157, 2021
32021
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
D Aggarwal, T Kazana, M Obremski
IEEE International Symposium on Information Theory (ISIT), 2018
32018
Quantum Measurement Adversary
D Aggarwal, NG Boddu, R Jain, M Obremski
arXiv preprint arXiv:2106.02766, 2021
22021
Extractors Lower Bounds, Revisited
D Aggarwal, S Guo, M Obremski, J Ribeiro, N Stephens-Davidowitz
Random 2020, 2020
22020
Complexity of Estimating Renyi Entropy of Markov Chains
M Obremski, M Skórski
IEEE International Symposium on Information Theory (ISIT) 2020, 2020
22020
Inverted Leftover Hash Lemma
M Obremski, M Skorski
IEEE International Symposium on Information Theory (ISIT), 2018
22018
Distributed Shuffling in Adversarial Environments
KG Larsen, M Obremski, M Simkin
Cryptology ePrint Archive, 2022
12022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20