Trojan-resilience without cryptography
S. Chakraborty, S. Dziembowski, M. Gazka, T. Lizurej, K.Z. Pietrzak, M.X. Yeo, in:, Springer Nature, 2021, pp. 397–428.
LibreCat: https://research-explorer.ista.ac.at/record/10407
DOI: 10.1007/978-3-030-90453-1_14
WoS: 000728364000014

Grafting key trees: Efficient key management for overlapping groups
J.F. Alwen, B. Auerbach, M.A. Baig, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, 19th International Conference, Springer Nature, 2021, pp. 222–253.
LibreCat: https://research-explorer.ista.ac.at/record/10408
DOI: 10.1007/978-3-030-90456-2_8
WoS: 000728363700008

On treewidth, separators and Yao’s garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th International Conference, Springer Nature, 2021, pp. 486–517.
LibreCat: https://research-explorer.ista.ac.at/record/10409
DOI: 10.1007/978-3-030-90453-1_17
WoS: 000728364000017

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

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

Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement
K. Klein, G. Pascual Perez, M. Walter, C. Kamath Hosdurg, M. Capretto, M. Cueto Noval, I. Markov, M.X. Yeo, J.F. Alwen, K.Z. Pietrzak, in:, 2021 IEEE Symposium on Security and Privacy , IEEE, 2021, pp. 268–284.
LibreCat: https://research-explorer.ista.ac.at/record/10049
DOI: 10.1109/sp40001.2021.00035

On treewidth, separators and Yao's garbling
C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, 19th Theory of Cryptography Conference 2021, International Association for Cryptologic Research, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10044

On the adaptive security of graph-based games
K. Klein, On the Adaptive Security of Graph-Based Games, Institute of Science and Technology Austria, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10035
DOI: 10.15479/at:ista:10035

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

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

LightPIR: Privacy-preserving route discovery for payment channel networks
K.Z. Pietrzak, I. Salem, S. Schmid, M.X. Yeo, in:, IEEE, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/9969
DOI: 10.23919/IFIPNetworking52078.2021.9472205
WoS: 000853016800008
arXiv: 2104.04293

Reverse firewalls for actively secure MPCs
S. Chakraborty, S. Dziembowski, J.B. Nielsen, in:, Advances in Cryptology – CRYPTO 2020, Springer Nature, 2020, pp. 732–762.
LibreCat: https://research-explorer.ista.ac.at/record/8322
DOI: 10.1007/978-3-030-56880-1_26

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

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

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

On the average-case hardness of total search problems
C. Kamath Hosdurg, On the Average-Case Hardness of Total Search Problems, Institute of Science and Technology Austria, 2020.
LibreCat: https://research-explorer.ista.ac.at/record/7896
DOI: 10.15479/AT:ISTA:7896

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

Simple verifiable delay functions
K.Z. Pietrzak, in:, 10th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

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

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

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

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

Adaptively secure proxy re-encryption
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, K.Z. Pietrzak, in:, Springer Nature, 2019, pp. 317–346.
LibreCat: https://research-explorer.ista.ac.at/record/6430
DOI: 10.1007/978-3-030-17259-6_11

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

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

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

Inverted leftover hash lemma
M. Obremski, M. Skórski, in:, IEEE, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/108
DOI: 10.1109/ISIT.2018.8437654
WoS: 000448139300368

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

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

On the bit security of cryptographic primitives
D. Micciancio, M. Walter, in:, Springer, 2018, pp. 3–28.
LibreCat: https://research-explorer.ista.ac.at/record/300
DOI: 10.1007/978-3-319-78381-9_1
WoS: 000517097500001

Simple proofs of sequential work
B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.
LibreCat: https://research-explorer.ista.ac.at/record/302
DOI: 10.1007/978-3-319-78375-8_15
WoS: 000517098700015

Sustained space complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, Springer, 2018, pp. 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

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

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

Cumulative space in black-white pebbling and resolution
J.F. Alwen, S. De Rezende, J. Nordstrom, M. Vinyals, in:, C. Papadimitriou (Ed.), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, p. 38:1-38-21.
LibreCat: https://research-explorer.ista.ac.at/record/1175
DOI: 10.4230/LIPIcs.ITCS.2017.38

Position based cryptography and multiparty communication complexity
J. Brody, S. Dziembowski, S. Faust, K.Z. Pietrzak, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 56–81.
LibreCat: https://research-explorer.ista.ac.at/record/605
DOI: 10.1007/978-3-319-70500-2_3

Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
LibreCat: https://research-explorer.ista.ac.at/record/609
DOI: 10.1007/978-3-319-70500-2_17

Scrypt is maximally memory hard
J.F. Alwen, B. Chen, K.Z. Pietrzak, L. Reyzin, S. Tessaro, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 33–62.
LibreCat: https://research-explorer.ista.ac.at/record/635
DOI: 10.1007/978-3-319-56617-7_2

Depth-robust graphs and their cumulative memory complexity
J.F. Alwen, J. Blocki, K.Z. Pietrzak, in:, J.-S. Coron, J. Buus Nielsen (Eds.), Springer, 2017, pp. 3–32.
LibreCat: https://research-explorer.ista.ac.at/record/640
DOI: 10.1007/978-3-319-56617-7_1

On the complexity of breaking pseudoentropy
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
LibreCat: https://research-explorer.ista.ac.at/record/648
DOI: 10.1007/978-3-319-55911-7_43

A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 586–599.
LibreCat: https://research-explorer.ista.ac.at/record/650
DOI: 10.1007/978-3-319-55911-7_42

Practical graphs for optimal side-channel resistant memory-hard functions
J.F. Alwen, J. Blocki, B. Harsha, in:, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, ACM Press, 2017, pp. 1001–1017.
LibreCat: https://research-explorer.ista.ac.at/record/6527
DOI: 10.1145/3133956.3134031

On the complexity of estimating Rènyi divergences
M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/6526
DOI: 10.1109/isit.2017.8006529
arXiv: 1702.01666

Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/697
DOI: 10.4230/LIPIcs.ICALP.2017.39

Renyi entropy estimation revisited
M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/710
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2017.20

(The exact security of) Message authentication codes
M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/838
DOI: 10.15479/AT:ISTA:th_828

The exact security of PMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.
LibreCat: https://research-explorer.ista.ac.at/record/6196
DOI: 10.13154/TOSC.V2016.I2.145-161

Beyond Hellman’s time-memory trade-offs with applications to proofs of space
H.M. Abusalah, J.F. Alwen, B. Cohen, D. Khilko, K.Z. Pietrzak, L. Reyzin, in:, Springer, 2017, pp. 357–379.
LibreCat: https://research-explorer.ista.ac.at/record/559
DOI: 10.1007/978-3-319-70697-9_13

Be adaptive avoid overcommitting
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K.Z. Pietrzak, D. Wichs, in:, J. Katz, H. Shacham (Eds.), Springer, 2017, pp. 133–163.
LibreCat: https://research-explorer.ista.ac.at/record/637
DOI: 10.1007/978-3-319-63688-7_5

Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057