One-time Computable and Uncomputable Functions. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (IACR Cryptol. ePrint Arch., 2010)

One-Time Computable Self-erasing Functions. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (TCC, 2011)

Key-Evolution Schemes Resilient to Space-Bounded Leakage. - Stefan Dziembowski; Tomasz Kazana; Daniel Wichs (IACR Cryptol. ePrint Arch., 2011)

Non-Malleable Codes from Two-Source Extractors. - Stefan Dziembowski; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 2013)

Non-malleable Reductions and Applications. - Divesh Aggarwal; Yevgeniy Dodis; Tomasz Kazana; Maciej Obremski (Electron. Colloquium Comput. Complex., 2014)

Leakage-resilient non-malleable codes. - Divesh Aggarwal; Stefan Dziembowski; Tomasz Kazana; Maciej Obremski (Electron. Colloquium Comput. Complex., 2014)

Inception Makes Non-malleable Codes Stronger. - Divesh Aggarwal; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 2015)

One Time Programs with Limited Memory. - Konrad Durnoga; Stefan Dziembowski; Tomasz Kazana; Michal Zajac 001 (IACR Cryptol. ePrint Arch., 2015)

Leakage-Resilient Cryptography with Key Derived from Sensitive Data. - Konrad Durnoga; Tomasz Kazana; Michal Zajac 001; Maciej Zdanowicz (IACR Cryptol. ePrint Arch., 2015)

Bounded-Retrieval Model with Keys Derived from Private Data. - Konrad Durnoga; Stefan Dziembowski; Tomasz Kazana; Michal Zajac 001; Maciej Zdanowicz (Inscrypt, 2016)

Leakage-resilient Algebraic Manipulation Detection Codes with Optimal Parameters. - Divesh Aggarwal; Tomasz Kazana; Maciej Obremski (IACR Cryptol. ePrint Arch., 2018)

Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. - Ivan Damgård; Tomasz Kazana; Maciej Obremski; Varun Raj; Luisa Siniscalchi (IACR Cryptol. ePrint Arch., 2018)

Quasi chain rule for min-entropy. - Stefan Dziembowski; Tomasz Kazana; Maciej Zdanowicz (Inf. Process. Lett., 2018)