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.

Akin Ünal

Benedikt Auerbach

Christoph Günther

Charlotte Hoffmann

Miguel Cueto Noval

Mirza Baig

Anshu Yadav

Guillermo Pascual Perez

Krzysztof Pietrzak

Michal Rybar

Michael Walter

Joel Alwen

Schipper, Joachim

Peter Gazi

Chethan Kamath Hosdurg

Suvradip Chakraborty

Georgia Avarikioti

Georg Fuchsbauer

Stephan Krenn

Karen Klein

Michelle Yeo

Hamza Abusalah



127 Publications

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
 
2019 | Conference Paper | IST-REx-ID: 7411 | OA
H. M. Abusalah, C. Kamath Hosdurg, K. Klein, K. Z. Pietrzak, and M. Walter, “Reversible proofs of sequential work,” in Advances in Cryptology – EUROCRYPT 2019, Darmstadt, Germany, 2019, vol. 11477, pp. 277–291.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2019 | Conference Paper | IST-REx-ID: 6677 | OA
A. R. Choudhuri, P. Hubáček, C. Kamath Hosdurg, K. Z. Pietrzak, A. Rosen, and G. N. Rothblum, “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, Phoenix, AZ, United States, 2019, pp. 1103–1114.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS
 
2019 | Conference Paper | IST-REx-ID: 6430 | OA
G. Fuchsbauer, C. Kamath Hosdurg, K. Klein, and K. Z. Pietrzak, “Adaptively secure proxy re-encryption,” presented at the PKC: Public-Key Cryptograhy, Beijing, China, 2019, vol. 11443, pp. 317–346.
[Preprint] View | Files available | DOI | Download Preprint (ext.)
 
2018 | Journal Article | IST-REx-ID: 10286 | OA
E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.
[Published Version] View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 7407 | OA
K. Z. Pietrzak, “Proofs of catalytic space,” in 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), San Diego, CA, United States, 2018, vol. 124, p. 59:1-59:25.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
2018 | Thesis | IST-REx-ID: 83 | OA
H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018.
[Published Version] View | Files available | DOI
 
2018 | Conference Paper | IST-REx-ID: 108 | OA
M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Journal Article | IST-REx-ID: 107 | OA
S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” Journal of the ACM, vol. 65, no. 4. ACM, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 193 | OA
J. F. Alwen et al., “On the memory hardness of data independent password hashing functions,” in Proceedings of the 2018 on Asia Conference on Computer and Communication Security, Incheon, Republic of Korea, 2018, pp. 51–65.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 300 | OA
D. Micciancio and M. Walter, “On the bit security of cryptographic primitives,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10820, pp. 3–28.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 302 | OA
B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2018 | Conference Paper | IST-REx-ID: 298 | OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Sustained space complexity,” presented at the Eurocrypt 2018: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 99–130.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Journal Article | IST-REx-ID: 5980
S. Chatterjee, C. Kamath Hosdurg, and V. Kumar, “Private set-intersection with common set-up,” American Institute of Mathematical Sciences, vol. 12, no. 1. AIMS, pp. 17–47, 2018.
View | DOI | WoS
 
2018 | Conference Paper | IST-REx-ID: 6941 | OA
S. Park, A. Kwon, G. Fuchsbauer, P. Gazi, J. F. Alwen, and K. Z. Pietrzak, “SpaceMint: A cryptocurrency based on proofs of space,” in 22nd International Conference on Financial Cryptography and Data Security, Nieuwpoort, Curacao, 2018, vol. 10957, pp. 480–499.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Conference Paper | IST-REx-ID: 1175 | OA
J. F. Alwen, S. De Rezende, J. Nordstrom, and M. Vinyals, “Cumulative space in black-white pebbling and resolution,” presented at the ITCS: Innovations in Theoretical Computer Science, Berkeley, CA, United States, 2017, vol. 67, p. 38:1-38-21.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 605 | OA
J. Brody, S. Dziembowski, S. Faust, and K. Z. Pietrzak, “Position based cryptography and multiparty communication complexity,” presented at the TCC: Theory of Cryptography Conference, Baltimore, MD, United States, 2017, vol. 10677, pp. 56–81.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 609 | OA
J. F. Alwen and B. Tackmann, “Moderately hard functions: Definition, instantiations, and applications,” presented at the TCC: Theory of Cryptography, Baltimore, MD, United States, 2017, vol. 10677, pp. 493–526.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 635 | OA
J. F. Alwen, B. Chen, K. Z. Pietrzak, L. Reyzin, and S. Tessaro, “Scrypt is maximally memory hard,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 33–62.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 640 | OA
J. F. Alwen, J. Blocki, and K. Z. Pietrzak, “Depth-robust graphs and their cumulative memory complexity,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Paris, France, 2017, vol. 10212, pp. 3–32.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 648 | OA
M. Skórski, “On the complexity of breaking pseudoentropy,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 600–613.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 650 | OA
M. Skórski, “A cryptographic view of regularity lemmas: Simpler unified proofs and refined bounds,” presented at the TAMC: Theory and Applications of Models of Computation, Bern, Switzerland, 2017, vol. 10185, pp. 586–599.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6527 | OA
J. F. Alwen, J. Blocki, and B. Harsha, “Practical graphs for optimal side-channel resistant memory-hard functions,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, Dallas, TX, USA, 2017, pp. 1001–1017.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 6526 | OA
M. Skórski, “On the complexity of estimating Rènyi divergences,” in 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 697 | OA
K. Z. Pietrzak and M. Skórski, “Non uniform attacks against pseudoentropy,” presented at the ICALP: International Colloquium on Automata, Languages, and Programming, Warsaw, Poland, 2017, vol. 80.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 710 | OA
M. Obremski and M. Skórski, “Renyi entropy estimation revisited,” presented at the 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Berkeley, USA, 2017, vol. 81.
[Published Version] View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 838 | OA
M. Rybar, “(The exact security of) Message authentication codes,” Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 6196 | OA
P. Gazi, K. Z. Pietrzak, and M. Rybar, “The exact security of PMAC,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 2. Ruhr University Bochum, pp. 145–161, 2017.
[Published Version] View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 559 | OA
H. M. Abusalah, J. F. Alwen, B. Cohen, D. Khilko, K. Z. Pietrzak, and L. Reyzin, “Beyond Hellman’s time-memory trade-offs with applications to proofs of space,” presented at the ASIACRYPT: Theory and Applications of Cryptology and Information Security, Hong Kong, China, 2017, vol. 10625, pp. 357–379.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 637 | OA
Z. Jafargholi, C. Kamath Hosdurg, K. Klein, I. Komargodski, K. Z. Pietrzak, and D. Wichs, “Be adaptive avoid overcommitting,” presented at the CRYPTO: Cryptology, Santa Barbara, CA, United States, 2017, vol. 10401, pp. 133–163.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1174 | OA
M. Skórski, “Lower bounds on key derivation for square-friendly applications,” presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany, 2017, vol. 66.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Conference Paper | IST-REx-ID: 1176 | OA
J. F. Alwen and J. Blocki, “Towards practical attacks on Argon2i and balloon hashing,” presented at the EuroS&P: European Symposium on Security and Privacy, Paris, France, 2017.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2017 | Journal Article | IST-REx-ID: 1187 | OA
E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.
[Submitted Version] View | Files available | DOI | WoS
 
2016 | Journal Article | IST-REx-ID: 1177 | OA
C. Kamath Hosdurg and S. Chatterjee, “A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound,” Algorithmica, vol. 74, no. 4. Springer, pp. 1321–1362, 2016.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1179 | OA
K. Z. Pietrzak and S. Maciej, “Pseudoentropy: Lower-bounds for chain rules and transformations,” presented at the TCC: Theory of Cryptography Conference, Beijing, China, 2016, vol. 9985, pp. 183–203.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1233 | OA
G. Fuchsbauer, F. Heuer, E. Kiltz, and K. Z. Pietrzak, “Standard security does imply security against selective opening for markov distributions,” presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel, 2016, vol. 9562, pp. 282–305.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1365 | OA
J. F. Alwen and J. Blocki, “Efficiently computing data-independent memory-hard functions,” presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA, 2016, vol. 9815, pp. 241–271.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1366 | OA
P. Gazi and S. Tessaro, “Provably robust sponge-based PRNGs and KDFs,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9665, pp. 87–116.
[Preprint] View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1592
M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure preserving signatures and commitments to group elements,” Journal of Cryptology, vol. 29, no. 2. Springer, pp. 363–421, 2016.
View | DOI
 
2016 | Conference Paper | IST-REx-ID: 1225 | OA
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, and D. Slamanig, “Practical round-optimal blind signatures in the standard model from weaker assumptions,” presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy, 2016, vol. 9841, pp. 391–408.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1653 | OA
T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.
[Submitted Version] View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1479 | OA
S. Krenn, K. Z. Pietrzak, A. Wadia, and D. Wichs, “A counterexample to the chain rule for conditional HILL entropy,” Computational Complexity, vol. 25, no. 3. Springer, pp. 567–605, 2016.
[Submitted Version] View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1229 | OA
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Offline witness encryption,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 285–303.
[Submitted Version] View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1236 | OA
H. M. Abusalah, G. Fuchsbauer, and K. Z. Pietrzak, “Constrained PRFs for unbounded inputs,” presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA, 2016, vol. 9610, pp. 413–428.
[Submitted Version] View | Files available | DOI
 
2016 | Conference Paper | IST-REx-ID: 1235 | OA
H. M. Abusalah and G. Fuchsbauer, “Constrained PRFs for unbounded inputs with short keys,” presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK, 2016, vol. 9696, pp. 445–463.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications

    • Display / Sort

    Citation Style: IEEE

    Export / Embed