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

Skórski, M. (2019). Strong chain rules for min-entropy under few bits spoiled. In 2019 IEEE International Symposium on Information Theory. Paris, France: IEEE.https://doi.org/10.1109/isit.2019.8849240 
LibreCat: https://research-explorer.ista.ac.at/record/7136
DOI: 10.1109/isit.2019.8849240
WoS: 000489100301043
arXiv: 1702.08476

Abusalah, H. M., Kamath Hosdurg, C., Klein, K., Pietrzak, K. Z., &; Walter, M. (2019). Reversible proofs of sequential work. In Advances in Cryptology – EUROCRYPT 2019 (Vol. 11477, pp. 277–291). Darmstadt, Germany: Springer International Publishing.https://doi.org/10.1007/978-3-030-17656-3_10 
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Choudhuri, A. R., Hubádek, P., Kamath Hosdurg, C., Pietrzak, K. Z., Rosen, A., &; Rothblum, G. N. (2019). 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 (pp. 1103–1114). Phoenix, AZ, United States: ACM Press.https://doi.org/10.1145/3313276.3316400 
LibreCat: https://research-explorer.ista.ac.at/record/6677
DOI: 10.1145/3313276.3316400
WoS: 000523199100100

Fuchsbauer, G., Kamath Hosdurg, C., Klein, K., &; Pietrzak, K. Z. (2019). Adaptively secure proxy re-encryption (Vol. 11443, pp. 317–346). Presented at the PKC: Public-Key Cryptograhy, Beijing, China: Springer Nature.https://doi.org/10.1007/978-3-030-17259-6_11 
LibreCat: https://research-explorer.ista.ac.at/record/6430
DOI: 10.1007/978-3-030-17259-6_11

Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. International Association for Cryptologic Research.https://doi.org/10.13154/tches.v2018.i3.214-242 
LibreCat: https://research-explorer.ista.ac.at/record/10286
DOI: 10.13154/tches.v2018.i3.214-242

Pietrzak, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.59 
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

Abusalah, H. M. (2018). Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.https://doi.org/10.15479/AT:ISTA:TH_1046 
LibreCat: https://research-explorer.ista.ac.at/record/83
DOI: 10.15479/AT:ISTA:TH_1046

Obremski, M., &; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE.https://doi.org/10.1109/ISIT.2018.8437654 
LibreCat: https://research-explorer.ista.ac.at/record/108
DOI: 10.1109/ISIT.2018.8437654
WoS: 000448139300368

Dziembowski, S., Pietrzak, K. Z., &; Wichs, D. (2018). Non-malleable codes. Journal of the ACM. ACM.https://doi.org/10.1145/3178432 
LibreCat: https://research-explorer.ista.ac.at/record/107
DOI: 10.1145/3178432
WoS: 000442938200004

Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z.,https://doi.org/10.1145/3196494.3196534__Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM.https://doi.org/10.1145/3196494.3196534 
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

Micciancio, D., &; Walter, M. (2018). On the bit security of cryptographic primitives (Vol. 10820, pp. 3–28). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78381-9_1 
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Cohen, B., &; Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_15 
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Alwen, J. F., Blocki, J., &; Pietrzak, K. Z. (2018). Sustained space complexity (Vol. 10821, pp. 99–130). Presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-319-78375-8_4 
LibreCat: https://research-explorer.ista.ac.at/record/298
DOI: 10.1007/978-3-319-78375-8_4
WoS: 000517098700004
arXiv: 1705.05313

Chatterjee, S., Kamath Hosdurg, C., &; Kumar, V. (2018). Private set-intersection with common set-up. American Institute of Mathematical Sciences. AIMS.https://doi.org/10.3934/amc.2018002 
LibreCat: https://research-explorer.ista.ac.at/record/5980
DOI: 10.3934/amc.2018002
WoS: 000430950400002

Park, S., Kwon, A., Fuchsbauer, G., Gazi, P., Alwen, J. F., &; Pietrzak, K. Z. (2018). SpaceMint: A cryptocurrency based on proofs of space. In 22nd International Conference on Financial Cryptography and Data Security (Vol. 10957, pp. 480–499). Nieuwpoort, Curacao: Springer Nature.https://doi.org/10.1007/978-3-662-58387-6_26 
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Alwen, J. F., De Rezende, S., Nordstrom, J., &; Vinyals, M. (2017). Cumulative space in black-white pebbling and resolution. In C. Papadimitriou (Ed.) (Vol. 67, p. 38:1-38-21). Presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2017.38 
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38