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.




127 Publications

2021 | Conference Paper | IST-REx-ID: 10407 | OA
S. Chakraborty, S. Dziembowski, M. Gałązka, T. Lizurej, K. Z. Pietrzak, and M. X. Yeo, “Trojan-resilience without cryptography,” presented at the TCC: Theory of Cryptography Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 397–428.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10408 | OA
J. F. Alwen et al., “Grafting key trees: Efficient key management for overlapping groups,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13044, pp. 222–253.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10409 | OA
C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “On treewidth, separators and Yao’s garbling,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 486–517.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10609 | OA
S. Chakraborty, C. Ganesh, M. Pancholi, and P. Sarkar, “Reverse firewalls for adaptively secure MPC without setup,” in 27th International Conference on the Theory and Application of Cryptology and Information Security, Virtual, Singapore, 2021, vol. 13091, pp. 335–364.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10041 | OA
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 | Conference Paper | IST-REx-ID: 10049 | OA
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 | Conference Paper | IST-REx-ID: 10044 | OA
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.)
 
2021 | Thesis | IST-REx-ID: 10035 | OA
K. Klein, “On the adaptive security of graph-based games,” Institute of Science and Technology Austria, 2021.
[Published Version] View | Files available | DOI
 
2021 | Conference Paper | IST-REx-ID: 10410 | OA
C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “The cost of adaptivity in security games on graphs,” in 19th International Conference, Raleigh, NC, United States, 2021, vol. 13043, pp. 550–581.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2021 | Conference Paper | IST-REx-ID: 10048 | OA
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 | Conference Paper | IST-REx-ID: 9969 | OA
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
 
2020 | Conference Paper | IST-REx-ID: 8322 | OA
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 | Conference Paper | IST-REx-ID: 8339 | OA
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.)
 
2020 | Conference Paper | IST-REx-ID: 8987 | OA
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 | Conference Paper | IST-REx-ID: 7966 | OA
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 | Thesis | IST-REx-ID: 7896 | OA
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
 
2019 | Journal Article | IST-REx-ID: 5887 | OA
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 | Conference Paper | IST-REx-ID: 6528 | OA
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 | Book Chapter | IST-REx-ID: 6726 | OA
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 | Conference Paper | IST-REx-ID: 7136 | OA
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
 

Search

Filter Publications