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.




144 Publications

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.) | WoS
 
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.) | WoS
 
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.) | WoS
 
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.) | WoS
 
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.) | WoS
 
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.) | WoS
 
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.) | WoS
 
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, 2017, pp. 1001–1017.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2016 | Published | 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 | WoS
 
2016 | Published | Journal Article | IST-REx-ID: 1479 | OA
A counterexample to the chain rule for conditional HILL entropy
S. Krenn, K.Z. Pietrzak, A. Wadia, D. Wichs, Computational Complexity 25 (2016) 567–605.
[Submitted Version] View | Files available | DOI | WoS
 
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.) | WoS
 
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.) | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1236 | OA
Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.
[Submitted Version] View | Files available | DOI | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1235 | OA
Constrained PRFs for unbounded inputs with short keys
H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.) | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1229 | OA
Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.
[Submitted Version] View | Files available | DOI | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1231 | OA
On the complexity of scrypt and proofs of space in the parallel random oracle model
J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2016 | Published | Conference Paper | IST-REx-ID: 1233 | OA
Standard security does imply security against selective opening for markov distributions
G. Fuchsbauer, F. Heuer, E. Kiltz, K.Z. Pietrzak, in:, Springer, 2016, pp. 282–305.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | WoS
 
2016 | Published | 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.
[Preprint] View | DOI | Download Preprint (ext.) | WoS
 
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.) | WoS
 
2016 | Published | 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.
[Submitted Version] View | Files available | DOI | WoS
 

Search

Filter Publications

Display / Sort

Export / Embed