Tomasz Kazana

According to our database, Tomasz Kazana authored at least 14 papers between 2010 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

Condense to Conduct and Conduct to Condense.

Tomasz Kazana

CoRR, August, 2025

2018

Quasi chain rule for min-entropy.

Stefan Dziembowski, Tomasz Kazana, Maciej Zdanowicz

Inf. Process. Lett., 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

Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Leakage-Resilient Algebraic Manipulation Detection Codes with Optimal Parameters.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Inception Makes Non-malleable Codes Stronger.

Divesh Aggarwal, Tomasz Kazana, Maciej Obremski

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

2016

Bounded-Retrieval Model with Keys Derived from Private Data.

Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac, Maciej Zdanowicz

Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

2015

Leakage-Resilient Cryptography with Key Derived from Sensitive Data.

Konrad Durnoga, Tomasz Kazana, Michal Zajac, Maciej Zdanowicz

IACR Cryptol. ePrint Arch., 2015

Leakage-Resilient Non-malleable Codes.

Divesh Aggarwal, Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Non-malleable Reductions and Applications.

Divesh Aggarwal, Yevgeniy Dodis, Tomasz Kazana, Maciej Obremski

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2013

Non-malleable Codes from Two-Source Extractors.

Stefan Dziembowski, Tomasz Kazana, Maciej Obremski

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

One-Time Programs with Limited Memory.

Konrad Durnoga, Stefan Dziembowski, Tomasz Kazana, Michal Zajac

Proceedings of the Information Security and Cryptology - 9th International Conference, 2013

2011

One-Time Computable Self-erasing Functions.

Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Key-Evolution Schemes Resilient to Space-Bounded Leakage.

Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010

One-time Computable and Uncomputable Functions.

Stefan Dziembowski, Tomasz Kazana, Daniel Wichs

IACR Cryptol. ePrint Arch., 2010