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.

Mirza Baig

Charlotte Hoffmann

Guillermo Pascual Perez

Krzysztof Pietrzak

Anshu Yadav

Christoph Günther

Ray Neiheiser

Akin Ünal

Miguel Cueto Noval

Joel Alwen

Michal Rybar

Hamza Abusalah

Michelle Yeo

Stephan Krenn

Peter Gazi

Karen Klein

Chethan Kamath Hosdurg

Georg Fuchsbauer

Michael Walter

Schipper, Joachim

Suvradip Chakraborty

Benedikt Auerbach

Georgia Avarikioti



126 Publications

2017 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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 | Published | 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.)
 
2016 | Published | 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 | Published | 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 | Published | 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 | Published | 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
 

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed