Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

132 Publications


2017 | Published | Conference Paper | IST-REx-ID: 1175 | OA
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.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 1176 | OA
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 

2017 | Published | Journal Article | IST-REx-ID: 1187 | OA
Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.
[Submitted Version] View | Files available | DOI | WoS
 

2017 | Published | Conference Paper | IST-REx-ID: 559 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 605 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 609 | OA
Moderately hard functions: Definition, instantiations, and applications
J.F. Alwen, B. Tackmann, in:, Y. Kalai, L. Reyzin (Eds.), Springer, 2017, pp. 493–526.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Thesis | IST-REx-ID: 838 | OA
(The exact security of) Message authentication codes
M. Rybar, (The Exact Security of) Message Authentication Codes, Institute of Science and Technology Austria, 2017.
[Published Version] View | Files available | DOI
 

2017 | Published | Journal Article | IST-REx-ID: 6196 | OA
The exact security of PMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, IACR Transactions on Symmetric Cryptology 2016 (2017) 145–161.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 635 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 637 | OA
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.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 640 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 648 | OA
On the complexity of breaking pseudoentropy
M. Skórski, in:, G. Jäger, S. Steila (Eds.), Springer, 2017, pp. 600–613.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 650 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 6526 | OA
On the complexity of estimating Rènyi divergences
M. Skórski, in:, 2017 IEEE International Symposium on Information Theory (ISIT), IEEE, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 6527 | OA
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.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

2017 | Published | Conference Paper | IST-REx-ID: 697 | OA
Non uniform attacks against pseudoentropy
K.Z. Pietrzak, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 

2017 | Published | Conference Paper | IST-REx-ID: 710 | OA
Renyi entropy estimation revisited
M. Obremski, M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
[Published Version] View | Files available | DOI
 

2016 | Published | Conference Paper | IST-REx-ID: 1365 | OA
Efficiently computing data-independent memory-hard functions
J.F. Alwen, J. Blocki, in:, Springer, 2016, pp. 241–271.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Published | Conference Paper | IST-REx-ID: 1366 | OA
Provably robust sponge-based PRNGs and KDFs
P. Gazi, S. Tessaro, in:, Springer, 2016, pp. 87–116.
[Preprint] View | DOI | Download Preprint (ext.)
 

2016 | Published | Journal Article | IST-REx-ID: 1177 | OA
A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound
C. Kamath Hosdurg, S. Chatterjee, Algorithmica 74 (2016) 1321–1362.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 

Filters and Search Terms

department=KrPi

Search

Filter Publications

Display / Sort

Export / Embed