Laarhoven, T., &; Walter, M. (2021). Dual lattice attacks for closest vector problems (with preprocessing). In Topics in Cryptology – CT-RSA 2021 (Vol. 12704, pp. 478–502). Virtual Event: Springer Nature.https://doi.org/10.1007/978-3-030-75539-3_20 
LibreCat: https://research-explorer.ista.ac.at/record/9825
DOI: 10.1007/978-3-030-75539-3_20

Chakraborty, S., Dziembowski, S., Gazka, M., Lizurej, T., Pietrzak, K. Z., &; Yeo, M. X. (2021). Trojan-resilience without cryptography (Vol. 13043, pp. 397–428). Presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_14 
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Alwen, J. F., Auerbach, B., Baig, M. A., Cueto Noval, M., Klein, K., Pascual Perez, G.,https://doi.org/10.1007/978-3-030-90456-2_8__Walter, M. (2021). Grafting key trees: Efficient key management for overlapping groups. In 19th International Conference (Vol. 13044, pp. 222–253). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90456-2_8 
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th International Conference (Vol. 13043, pp. 486–517). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

Chakraborty, S., Ganesh, C., Pancholi, M., &; Sarkar, P. (2021). Reverse firewalls for adaptively secure MPC without setup. In 27th International Conference on the Theory and Application of Cryptology and Information Security (Vol. 13091, pp. 335–364). Virtual, Singapore: Springer Nature.https://doi.org/10.1007/978-3-030-92075-3_12 
LibreCat: https://research-explorer.ista.ac.at/record/10609
DOI: 10.1007/978-3-030-92075-3_12
WoS: 000927876200012

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Wichs, D. (2021). Limits on the Adaptive Security of Yao’s Garbling. In 41st Annual International Cryptology Conference, Part II  (Vol. 12826, pp. 486–515). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-84245-1_17 
LibreCat: https://research-explorer.ista.ac.at/record/10041
DOI: 10.1007/978-3-030-84245-1_17

Klein, K., Pascual Perez, G., Walter, M., Kamath Hosdurg, C., Capretto, M., Cueto Noval, M.,https://doi.org/10.1109/sp40001.2021.00035__Pietrzak, K. Z. (2021). Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement. In 2021 IEEE Symposium on Security and Privacy  (pp. 268–284). San Francisco, CA, United States: IEEE.https://doi.org/10.1109/sp40001.2021.00035 
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2021). On treewidth, separators and Yao’s garbling. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.
LibreCat: https://research-explorer.ista.ac.at/record/10044

Klein, K. (2021). On the adaptive security of graph-based games. Institute of Science and Technology Austria.https://doi.org/10.15479/at:ista:10035 
LibreCat: https://research-explorer.ista.ac.at/record/10035
DOI: 10.15479/at:ista:10035

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th International Conference (Vol. 13043, pp. 550–581). Raleigh, NC, United States: Springer Nature.https://doi.org/10.1007/978-3-030-90453-1_19 
LibreCat: https://research-explorer.ista.ac.at/record/10410
DOI: 10.1007/978-3-030-90453-1_19
WoS: 000728364000019

Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2021). The cost of adaptivity in security games on graphs. In 19th Theory of Cryptography Conference 2021. Raleigh, NC, United States: International Association for Cryptologic Research.
LibreCat: https://research-explorer.ista.ac.at/record/10048

Pietrzak, K. Z., Salem, I., Schmid, S., &; Yeo, M. X. (2021). LightPIR: Privacy-preserving route discovery for payment channel networks. Presented at the 2021 IFIP Networking Conference (IFIP Networking), Espoo and Helsinki, Finland: IEEE.https://doi.org/10.23919/IFIPNetworking52078.2021.9472205 
LibreCat: https://research-explorer.ista.ac.at/record/9969
DOI: 10.23919/IFIPNetworking52078.2021.9472205
WoS: 000853016800008
arXiv: 2104.04293

Chakraborty, S., Dziembowski, S., &; Nielsen, J. B. (2020). Reverse firewalls for actively secure MPCs. In Advances in Cryptology – CRYPTO 2020 (Vol. 12171, pp. 732–762). Santa Barbara, CA, United States: Springer Nature.https://doi.org/10.1007/978-3-030-56880-1_26 
LibreCat: https://research-explorer.ista.ac.at/record/8322
DOI: 10.1007/978-3-030-56880-1_26

Genise, N., Micciancio, D., Peikert, C., &; Walter, M. (2020). Improved discrete Gaussian and subgaussian analysis for lattice cryptography. In 23rd IACR International Conference on the Practice and Theory of Public-Key Cryptography (Vol. 12110, pp. 623–651). Edinburgh, United Kingdom: Springer Nature.https://doi.org/10.1007/978-3-030-45374-9_21 
LibreCat: https://research-explorer.ista.ac.at/record/8339
DOI: 10.1007/978-3-030-45374-9_21

Pietrzak, K. Z. (2020). Delayed authentication: Preventing replay and relay attacks in private contact tracing. In Progress in Cryptology (Vol. 12578, pp. 3–15). Bangalore, India: Springer Nature.https://doi.org/10.1007/978-3-030-65277-7_1 
LibreCat: https://research-explorer.ista.ac.at/record/8987
DOI: 10.1007/978-3-030-65277-7_1
WoS: 000927592800001

Auerbach, B., Giacon, F., &; Kiltz, E. (2020). Everybody’s a target: Scalability in public-key encryption. In Advances in Cryptology – EUROCRYPT 2020 (Vol. 12107, pp. 475–506). Springer Nature.https://doi.org/10.1007/978-3-030-45727-3_16 
LibreCat: https://research-explorer.ista.ac.at/record/7966
DOI: 10.1007/978-3-030-45727-3_16
WoS: 000828688000016

Kamath Hosdurg, C. (2020). On the average-case hardness of total search problems. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:7896 
LibreCat: https://research-explorer.ista.ac.at/record/7896
DOI: 10.15479/AT:ISTA:7896

Demay, G., Gazi, P., Maurer, U., &; Tackmann, B. (2019). Per-session security: Password-based cryptography revisited. Journal of Computer Security. IOS Press.https://doi.org/10.3233/JCS-181131 
LibreCat: https://research-explorer.ista.ac.at/record/5887
DOI: 10.3233/JCS-181131

Pietrzak, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.60 
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

Walter, M. (2019). Sampling the integers with low relative error. In J. Buchmann, A. Nitaj, &; T. Rachidi (Eds.), Progress in Cryptology – AFRICACRYPT 2019 (Vol. 11627, pp. 157–180). Cham: Springer Nature.https://doi.org/10.1007/978-3-030-23696-0_9 
LibreCat: https://research-explorer.ista.ac.at/record/6726
DOI: 10.1007/978-3-030-23696-0_9