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.




110 Publications

2017 | 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.
View | Files available | DOI
 
2017 | 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.
View | Files available | DOI
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | Files available | DOI
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | Files available | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | DOI | Download Preprint (ext.) | arXiv
 
2017 | 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.
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 1174 | OA
Lower bounds on key derivation for square-friendly applications
M. Skórski, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1176 | OA
Towards practical attacks on Argon2i and balloon hashing
J.F. Alwen, J. Blocki, in:, IEEE, 2017.
View | DOI | Download Submitted Version (ext.)
 
2017 | 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.
View | Files available | DOI
 
2016 | Journal Article | IST-REx-ID: 1592
Structure preserving signatures and commitments to group elements
M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology 29 (2016) 363–421.
View | DOI
 
2016 | Conference Paper | IST-REx-ID: 1653 | OA
New realizations of somewhere statistically binding hashing and positional accumulators
T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.
View | Files available | DOI
 
2016 | 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.
View | DOI | Download Submitted Version (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1179 | OA
Pseudoentropy: Lower-bounds for chain rules and transformations
K.Z. Pietrzak, S. Maciej, in:, Springer, 2016, pp. 183–203.
View | DOI | Download Preprint (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1225 | OA
Practical round-optimal blind signatures in the standard model from weaker assumptions
G. Fuchsbauer, C. Hanser, C. Kamath Hosdurg, D. Slamanig, in:, Springer, 2016, pp. 391–408.
View | Files available | DOI | Download Submitted Version (ext.)
 

Search

Filter Publications