| Non-malleable codes from two-source extractors S Dziembowski, T Kazana, M Obremski Annual Cryptology Conference, 239-257, 2013 | 147 | 2013 |
| Non-malleable reductions and applications D Aggarwal, Y Dodis, T Kazana, M Obremski Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 116 | 2015 |
| One-time computable self-erasing functions S Dziembowski, T Kazana, D Wichs Theory of Cryptography: 8th Theory of Cryptography Conference, TCC 2011 …, 2011 | 75 | 2011 |
| Leakage-resilient non-malleable codes D Aggarwal, S Dziembowski, T Kazana, M Obremski Theory of Cryptography Conference, 398-426, 2015 | 62 | 2015 |
| Key-evolution schemes resilient to space-bounded leakage S Dziembowski, T Kazana, D Wichs Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa …, 2011 | 49 | 2011 |
| Inception makes non-malleable codes stronger D Aggarwal, T Kazana, M Obremski Theory of Cryptography Conference, 319-343, 2017 | 36 | 2017 |
| One-time programs with limited memory K Durnoga, S Dziembowski, T Kazana, M Zajac International Conference on Information Security and Cryptology, 377-394, 2013 | 13 | 2013 |
| Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments I Damgård, T Kazana, M Obremski, V Raj, L Siniscalchi Theory of Cryptography Conference, 225-254, 2018 | 8 | 2018 |
| Leakage-resilient algebraic manipulation detection codes with optimal parameters D Aggarwal, T Kazana, M Obremski 2018 IEEE International Symposium on Information Theory (ISIT), 1131-1135, 2018 | 4 | 2018 |
| Quasi chain rule for min-entropy S Dziembowski, T Kazana, M Zdanowicz Information Processing Letters 134, 62-66, 2018 | 4 | 2018 |
| Bounded-retrieval model with keys derived from private data K Durnoga, S Dziembowski, T Kazana, M Zając, M Zdanowicz Information Security and Cryptology: 12th International Conference, Inscrypt …, 2017 | 3 | 2017 |
| Leakage-resilient Cryptography with key derived from sensitive data K Durnoga, T Kazana, M Zając, M Zdanowicz Cryptology ePrint Archive, 2015 | 3 | 2015 |
| Ustawy. D Aggarwal, S Dziembowski, T Kazana, M Obremski, Y Dodis, I Damgård, ... | | 2020 |
| Quasi chain rule for min-entropy M Zdanowicz, S Dziembowski, T Kazana Information Processing Letters, 2018 | | 2018 |
| Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters M Obremski, D Aggarwal, T Kazana | | 2018 |
| Inception Makes Non-malleable Codes Stronger M Obremski, D Aggarwal, T Kazana | | 2017 |
| Non-malleable Reductions and Applications (Full version) D Aggarwal, Y Dodis, T Kazana, M Obremski | | 2014 |
| Programy jednorazowe: krótkie wprowadzenie T Kazana Studia Bezpieczeństwa Narodowego 4, 2014 | | 2014 |
| Czym właściwie jest informacja? Anna Durkalec str. 1 Ukrywanie się w sieciach społecznych Marcin Waniek str. 2 Steganografia–jak ukryć galaktykę WJ Pearson, Ł Rajkowski, D Niwiński, K Dębski, T Kazana, S Charzyński, ... | | |
| W następnym numerze: ciemna materia atakuje W Czerwiński, J Ochremiak, J Chwedeńczuk, T Kazana, P Bielewicz, ... | | |
Maciej ObremskiNational University of SingaporeVerified email at nus.edu.sg
