Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
126 Publications
2021 | Published | Thesis | IST-REx-ID: 10035 | 
Klein K. 2021. On the adaptive security of graph-based games. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10041 |
Kamath Hosdurg C, Klein K, Pietrzak KZ, Wichs D. 2021. Limits on the Adaptive Security of Yao’s Garbling. 41st Annual International Cryptology Conference, Part II . CRYPTO: Annual International Cryptology Conference, LCNS, vol. 12826, 486–515.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10044 |
Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference, 2021/926.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10048 |
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th Theory of Cryptography Conference 2021. TCC: Theory of Cryptography Conference.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10049 |
Klein K, Pascual Perez G, Walter M, Kamath Hosdurg C, Capretto M, Cueto Noval M, Markov I, Yeo MX, Alwen JF, Pietrzak KZ. 2021. Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. 2021 IEEE Symposium on Security and Privacy . SP: Symposium on Security and Privacy, 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10407 |
Chakraborty S, Dziembowski S, Gałązka M, Lizurej T, Pietrzak KZ, Yeo MX. 2021. Trojan-resilience without cryptography. TCC: Theory of Cryptography Conference, LNCS, vol. 13043, 397–428.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10408 |
Alwen JF, Auerbach B, Baig MA, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2021. Grafting key trees: Efficient key management for overlapping groups. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13044, 222–253.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10409 |
Kamath Hosdurg C, Klein K, Pietrzak KZ. 2021. On treewidth, separators and Yao’s garbling. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 486–517.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10410 |
Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2021. The cost of adaptivity in security games on graphs. 19th International Conference. TCC: Theory of Cryptography, LNCS, vol. 13043, 550–581.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2021 | Published | Conference Paper | IST-REx-ID: 10609 |
Chakraborty S, Ganesh C, Pancholi M, Sarkar P. 2021. Reverse firewalls for adaptively secure MPC without setup. 27th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: International Conference on Cryptology in Asia, LNCS, vol. 13091, 335–364.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2020 | Published | Thesis | IST-REx-ID: 7896 |
Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 7966 |
Auerbach B, Giacon F, Kiltz E. 2020. Everybody’s a target: Scalability in public-key encryption. Advances in Cryptology – EUROCRYPT 2020. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 12107, 475–506.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8322 |
Chakraborty S, Dziembowski S, Nielsen JB. 2020. Reverse firewalls for actively secure MPCs. Advances in Cryptology – CRYPTO 2020. CRYPTO: Annual International Cryptology Conference, LNCS, vol. 12171, 732–762.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 8339 |
Genise N, Micciancio D, Peikert C, Walter M. 2020. Improved discrete Gaussian and subgaussian analysis for lattice cryptography. 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 12110, 623–651.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 8987 |
Pietrzak KZ. 2020. Delayed authentication: Preventing replay and relay attacks in private contact tracing. Progress in Cryptology. INDOCRYPT: International Conference on Cryptology in IndiaLNCS vol. 12578, 3–15.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2019 | Published | Journal Article | IST-REx-ID: 5887 |
Demay G, Gazi P, Maurer U, Tackmann B. 2019. Per-session security: Password-based cryptography revisited. Journal of Computer Security. 27(1), 75–111.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 6430 |
Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 6528 |
Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 60.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 6677 |
Choudhuri AR, Hubáček P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2019 | Published | Book Chapter | IST-REx-ID: 6726 |
Walter M. 2019.Sampling the integers with low relative error. In: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.
[Preprint]
View
| DOI
| Download Preprint (ext.)