home
members
publications
positions
grants
seminar
More
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments.
Ivan Damgård, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi
Theory of Cryptography Conference, TCC 2018
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters.
Divesh Aggarwal, Tomasz Kazana, Maciej Obremski
IEEE International Symposium on Information Theory, ISIT 2018
Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments
Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters
Quasi chain rule for min-entropy
Stefan Dziembowski, Tomasz Kazana, Maciej Zdanowicz
Information Processing Letters 134: 62-66 (2018)
Bounded-Retrieval Model with Keys Derived from Private Data
Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac, Maciej Zdanowicz
Conference on Information Security and Cryptology, Inscrypt 2016
Inception Makes Non-malleable Codes Stronger
Theory of Cryptography Conference, TCC 2016
Non-malleable Reductions and Applications
Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski
ACM Symposium on Theory of Computing, STOC 2015
Leakage-Resilient Non-malleable Codes
Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
One-Time Programs with Limited Memory
Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zając
Conference on Information Security and Cryptology, Inscrypt 2013
Non-malleable Codes from Two-Source Extractors
Stefan Dziembowski, Tomasz Kazana, Maciej Obremski
Annual Cryptology Conference, CRYPTO 2013
One-Time Computable Self-erasing Functions
Stefan Dziembowski, Tomasz Kazana, Daniel Wichs
Theory of Cryptography Conference, TCC 2011
Key-Evolution Schemes Resilient to Space-Bounded Leakage
Annual Cryptology Conference, CRYPTO 2011