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.
135 Publications
2021 | Published | Conference Paper | IST-REx-ID: 9466 | 
M. Walter, “The convergence of slide-type reductions,” in Public-Key Cryptography – PKC 2021, Virtual, 2021, vol. 12710, pp. 45–67.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 9825 |
T. Laarhoven and M. Walter, “Dual lattice attacks for closest vector problems (with preprocessing),” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 478–502.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 9826 |
B. Auerbach et al., “Inverse-Sybil attacks in automated contact tracing,” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 399–421.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 9969 |
K. Z. Pietrzak, I. Salem, S. Schmid, and M. X. Yeo, “LightPIR: Privacy-preserving route discovery for payment channel networks,” presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland, 2021.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
| arXiv
2021 | Published | Thesis | IST-REx-ID: 10035 |
K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.
[Published Version]
View
| Files available
| DOI
2021 | Published | Conference Paper | IST-REx-ID: 10041 |
C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and D. Wichs, “Limits on the Adaptive Security of Yao’s Garbling,” in 41st Annual International Cryptology Conference, Part II , Virtual, 2021, vol. 12826, pp. 486–515.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10049 |
K. Klein et al., “Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement,” in 2021 IEEE Symposium on Security and Privacy , San Francisco, CA, United States, 2021, pp. 268–284.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10048 |
C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2021 | Published | Conference Paper | IST-REx-ID: 10044 |
C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th Theory of Cryptography Conference 2021, Raleigh, NC, United States, 2021.
[Preprint]
View
| Files available
| Download Preprint (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 8987 |
K. Z. Pietrzak, “Delayed authentication: Preventing replay and relay attacks in private contact tracing,” in Progress in Cryptology, Bangalore, India, 2020, vol. 12578, pp. 3–15.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
2020 | Published | Thesis | IST-REx-ID: 7896 |
C. Kamath Hosdurg, “On the average-case hardness of total search problems,” Institute of Science and Technology Austria, 2020.
[Published Version]
View
| Files available
| DOI
2020 | Published | Conference Paper | IST-REx-ID: 7966 |
B. Auerbach, F. Giacon, and E. Kiltz, “Everybody’s a target: Scalability in public-key encryption,” in Advances in Cryptology – EUROCRYPT 2020, 2020, vol. 12107, pp. 475–506.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2020 | Published | Conference Paper | IST-REx-ID: 8322 |
S. Chakraborty, S. Dziembowski, and J. B. Nielsen, “Reverse firewalls for actively secure MPCs,” in Advances in Cryptology – CRYPTO 2020, Santa Barbara, CA, United States, 2020, vol. 12171, pp. 732–762.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2020 | Published | Conference Paper | IST-REx-ID: 8339 |
N. Genise, D. Micciancio, C. Peikert, and M. Walter, “Improved discrete Gaussian and subgaussian analysis for lattice cryptography,” in 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography, Edinburgh, United Kingdom, 2020, vol. 12110, pp. 623–651.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Published | Journal Article | IST-REx-ID: 5887 |
G. Demay, P. Gazi, U. Maurer, and B. Tackmann, “Per-session security: Password-based cryptography revisited,” Journal of Computer Security, vol. 27, no. 1. IOS Press, pp. 75–111, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 7411 |
H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT 2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2019 | Published | Conference Paper | IST-REx-ID: 6528 |
K. Z. Pietrzak, “Simple verifiable delay functions,” in 10th Innovations in Theoretical Computer Science Conference, San Diego, CA, United States, 2019, vol. 124.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 6677 |
A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “Finding a Nash equilibrium is no easier than breaking Fiat-Shamir,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019, Phoenix, AZ, United States, 2019, pp. 1103–1114.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
2019 | Published | Book Chapter | IST-REx-ID: 6726 |
M. Walter, “Sampling the integers with low relative error,” in Progress in Cryptology – AFRICACRYPT 2019, vol. 11627, J. Buchmann, A. Nitaj, and T. Rachidi, Eds. Cham: Springer Nature, 2019, pp. 157–180.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2019 | Published | Conference Paper | IST-REx-ID: 7136 |
M. Skórski, “Strong chain rules for min-entropy under few bits spoiled,” in 2019 IEEE International Symposium on Information Theory, Paris, France, 2019.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv