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
1162013
Non-malleable Reductions and Applications
D Aggarwal, Y Dodis, T Kazana, M Obremski
STOC'15, 2015
932015
Leakage-resilient non-malleable codes
D Aggarwal, S Dziembowski, T Kazana, M Obremski
Twelfth IACR Theory of Cryptography Conference (TCC 2015), 2014
512014
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
442018
Inception makes non-malleable codes stronger
D Aggarwal, T Kazana, M Obremski
Theory of Cryptography Conference, 319-343, 2017
282017
Continuous non-malleable codes in the 8-split-state model
D Aggarwal, N Dottling, JB Nielsen, M Obremski, E Purwanto
Eurocrypt, 2019
25*2019
Renyi Entropy Estimation Revisited
M Obremski, M Skorski
Approx'17, 2017
192017
A constant-rate non-malleable code in the split-state model.
D Aggarwal, M Obremski
FOCS 2020, 2020
13*2020
How to Extract Useful Randomness from Unreliable Sources
D Aggarwal, M Obremski, J Ribeiro, L Siniscalchi, I Visconti
Eurocrypt 2020, 2019
92019
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
82020
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
52018
Privacy Amplification with Tamperable Memory via Non-malleable Two-source Extractors
D Aggarwal, M Obremski, J Ribeiro, M Simkin, L Siniscalchi
Cryptology ePrint Archive, 2020
3*2020
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
Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters
D Aggarwal, T Kazana, M Obremski
IEEE International Symposium on Information Theory (ISIT), 2018
22018
Complexity of Estimating Renyi Entropy of Markov Chains
M Obremski, M Skórski
IEEE International Symposium on Information Theory (ISIT) 2020, 2020
12020
Inverted Leftover Hash Lemma
M Obremski, M Skorski
IEEE International Symposium on Information Theory (ISIT), 2018
12018
Algebraic Restriction Codes and their Applications
D Aggarwal, N Döttling, J Dujmovic, M Hajiabadi, G Malavolta, ...
Cryptology ePrint Archive, 2021
2021
Rate One-Third Non-malleable Codes
D Aggarwal, B Kanukurthi, SLB Obbattu, M Obremski, S Sekar
Cryptology ePrint Archive, 2021
2021
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing
D Aggarwal, E Chung, M Obremski, J Ribeiro
Cryptology ePrint Archive, 2021
2021
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20