Kamath Hosdurg C. 2020. On the average-case hardness of total search problems. Institute of Science and Technology Austria.
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. 27(1), 75–111.
LibreCat: https://research-explorer.ista.ac.at/record/5887
DOI: 10.3233/JCS-181131

Pietrzak KZ. 2019. Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference. ITCS 2019: Innovations in Theoretical Computer Science, LIPIcs, vol. 124, 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: Progress in Cryptology – AFRICACRYPT 2019. vol. 11627, 157–180.
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. 2019 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 8849240.
LibreCat: https://research-explorer.ista.ac.at/record/7136
DOI: 10.1109/isit.2019.8849240
WoS: 000489100301043
arXiv: 1702.08476

Abusalah HM, Kamath Hosdurg C, Klein K, Pietrzak KZ, Walter M. 2019. Reversible proofs of sequential work. Advances in Cryptology – EUROCRYPT 2019. International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 11477, 277–291.
LibreCat: https://research-explorer.ista.ac.at/record/7411
DOI: 10.1007/978-3-030-17656-3_10
WoS: 000483516200010

Choudhuri AR, Hubádek P, Kamath Hosdurg C, Pietrzak KZ, Rosen A, Rothblum GN. 2019. Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing  - STOC 2019. STOC: Symposium on Theory of Computing, 1103–1114.
LibreCat: https://research-explorer.ista.ac.at/record/6677
DOI: 10.1145/3313276.3316400
WoS: 000523199100100

Fuchsbauer G, Kamath Hosdurg C, Klein K, Pietrzak KZ. 2019. Adaptively secure proxy re-encryption. PKC: Public-Key Cryptograhy, LNCS, vol. 11443, 317–346.
LibreCat: https://research-explorer.ista.ac.at/record/6430
DOI: 10.1007/978-3-030-17259-6_11

Allini EN, 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. 2018(3), 214–242.
LibreCat: https://research-explorer.ista.ac.at/record/10286
DOI: 10.13154/tches.v2018.i3.214-242

Pietrzak KZ. 2018. Proofs of catalytic space. 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). ITCS: Innovations in theoretical Computer Science Conference, LIPIcs, vol. 124, 59:1-59:25.
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.
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. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.
LibreCat: https://research-explorer.ista.ac.at/record/108
DOI: 10.1109/ISIT.2018.8437654
WoS: 000448139300368

Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.
LibreCat: https://research-explorer.ista.ac.at/record/107
DOI: 10.1145/3178432
WoS: 000442938200004

Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.
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. Eurocrypt: Advances in Cryptology, LNCS, vol. 10820, 3–28.
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821, 451–467.
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Alwen JF, Blocki J, Pietrzak KZ. 2018. Sustained space complexity. Eurocrypt 2018: Advances in Cryptology, LNCS, vol. 10821, 99–130.
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. 12(1), 17–47.
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 JF, Pietrzak KZ. 2018. SpaceMint: A cryptocurrency based on proofs of space. 22nd International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 10957, 480–499.
LibreCat: https://research-explorer.ista.ac.at/record/6941
DOI: 10.1007/978-3-662-58387-6_26
WoS: 000540656400026

Alwen JF, De Rezende S, Nordstrom J, Vinyals M. 2017. Cumulative space in black-white pebbling and resolution. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 67, 38:1-38-21.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38