| Keep the dirt: Tainted treekem, adaptively and actively secure continuous group key agreement K Klein, G Pascual-Perez, M Walter, C Kamath, M Capretto, M Cueto, ... 2021 IEEE Symposium on Security and Privacy (SP), 268-284, 2021 | 48* | 2021 |
| Finding a Nash equilibrium is no easier than breaking Fiat-Shamir AR Choudhuri, P Hubáček, C Kamath, K Pietrzak, A Rosen, GN Rothblum Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 45 | 2019 |
| On the complexity of scrypt and proofs of space in the parallel random oracle model J Alwen, B Chen, C Kamath, V Kolmogorov, K Pietrzak, S Tessaro Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016 | 43 | 2016 |
| Be adaptive, avoid overcommitting Z Jafargholi, C Kamath, K Klein, I Komargodski, K Pietrzak, D Wichs Annual International Cryptology Conference, 133-163, 2017 | 42 | 2017 |
| Adaptively secure proxy re-encryption G Fuchsbauer, C Kamath, K Klein, K Pietrzak IACR International Workshop on Public Key Cryptography, 317-346, 2019 | 30 | 2019 |
| PPAD-hardness via iterated squaring modulo a composite AR Choudhuri, P Hubácek, C Kamath, K Pietrzak, A Rosen, GN Rothblum Cryptology ePrint Archive, 2019 | 30 | 2019 |
| Practical round-optimal blind signatures in the standard model from weaker assumptions G Fuchsbauer, C Hanser, C Kamath, D Slamanig International Conference on Security and Cryptography for Networks, 391-408, 2016 | 29 | 2016 |
| Galindo-Garcia identity-based signature revisited S Chatterjee, C Kamath, V Kumar International Conference on Information Security and Cryptology, 456-471, 2012 | 26 | 2012 |
| On the memory-hardness of data-independent password-hashing functions J Alwen, P Gazi, C Kamath, K Klein, G Osang, K Pietrzak, L Reyzin, ... Proceedings of the 2018 on Asia Conference on Computer and Communications …, 2018 | 16 | 2018 |
| Reversible proofs of sequential work H Abusalah, C Kamath, K Klein, K Pietrzak, M Walter Annual International Conference on the Theory and Applications of …, 2019 | 15 | 2019 |
| PPAD is as Hard as LWE and Iterated Squaring N Bitansky, AR Choudhuri, J Holmgren, C Kamath, A Lombardi, O Paneth, ... Theory of Cryptography Conference, 593-622, 2022 | 10 | 2022 |
| A Closer Look at Multiple Forking: Leveraging (In)Dependence for a Tighter Bound S Chatterjee, C Kamath Algorithmica 74, 1321-1362, 2016 | 7 | 2016 |
| Practical statistically-sound proofs of exponentiation in any group C Hoffmann, P Hubáček, C Kamath, K Klein, K Pietrzak Annual International Cryptology Conference, 370-399, 2022 | 6 | 2022 |
| Limits on the adaptive security of Yao’s garbling C Kamath, K Klein, K Pietrzak, D Wichs Annual International Cryptology Conference, 486-515, 2021 | 3 | 2021 |
| On Average-Case Hardness in from One-Way Functions P Hubáček, C Kamath, K Král, V Slívová Theory of Cryptography Conference, 614-638, 2020 | 3* | 2020 |
| The cost of adaptivity in security games on graphs C Kamath, K Klein, K Pietrzak, M Walter Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021 | 2* | 2021 |
| On treewidth, separators and yao’s garbling C Kamath, K Klein, K Pietrzak Theory of Cryptography Conference, 486-517, 2021 | 1 | 2021 |
| Private set-intersection with common set-up. S Chatterjee, C Kamath, V Kumar Advances in Mathematics of Communications 12 (1), 2018 | 1 | 2018 |
| From selective-id to full-id IBS without random oracles S Chatterjee, C Kamath Security, Privacy, and Applied Cryptography Engineering: Third International …, 2013 | 1 | 2013 |
| Certifying Giant Nonprimes C Hoffmann, P Hubáček, C Kamath, K Pietrzak IACR International Conference on Public-Key Cryptography, 530-553, 2023 | | 2023 |
krzysztof pietrzakProfessor, Cryptography, IST AustriaVerified email at ist.ac.at
