Skórski, M. (2017). Lower bounds on key derivation for square-friendly applications (Vol. 66). Presented at the STACS: Symposium on Theoretical Aspects of Computer Science, Hannover, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2017.57 

Alwen, J. F., &; Blocki, J. (2017). Towards practical attacks on Argon2i and balloon hashing. Presented at the EuroS&;P: European Symposium on Security and Privacy, Paris, France: IEEE.https://doi.org/10.1109/EuroSP.2017.47 

Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &; Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-016-9247-3 

Kamath Hosdurg, C., &; Chatterjee, S. (2016). A closer look at multiple-forking: Leveraging (in)dependence for a tighter bound. Algorithmica. Springer.https://doi.org/10.1007/s00453-015-9997-6 

Pietrzak, K. Z., &; Maciej, S. (2016). Pseudoentropy: Lower-bounds for chain rules and transformations (Vol. 9985, pp. 183–203). Presented at the TCC: Theory of Cryptography Conference, Beijing, China: Springer.https://doi.org/10.1007/978-3-662-53641-4_8 

Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., &; Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-662-49896-5_13 

Fuchsbauer, G., Heuer, F., Kiltz, E., &; Pietrzak, K. Z. (2016). Standard security does imply security against selective opening for markov distributions (Vol. 9562, pp. 282–305). Presented at the TCC: Theory of Cryptography Conference, Tel Aviv, Israel: Springer.https://doi.org/10.1007/978-3-662-49096-9_12 

Alwen, J. F., &; Blocki, J. (2016). Efficiently computing data-independent memory-hard functions (Vol. 9815, pp. 241–271). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer.https://doi.org/10.1007/978-3-662-53008-5_9 

Gazi, P., &; Tessaro, S. (2016). Provably robust sponge-based PRNGs and KDFs (Vol. 9665, pp. 87–116). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-662-49890-3_4 

Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., &; Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-014-9196-7 

Fuchsbauer, G., Hanser, C., Kamath Hosdurg, C., &; Slamanig, D. (2016). Practical round-optimal blind signatures in the standard model from weaker assumptions (Vol. 9841, pp. 391–408). Presented at the SCN: Security and Cryptography for Networks, Amalfi, Italy: Springer.https://doi.org/10.1007/978-3-319-44618-9_21 

Okamoto, T., Pietrzak, K. Z., Waters, B., &; Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer.https://doi.org/10.1007/978-3-662-48797-6_6 

Krenn, S., Pietrzak, K. Z., Wadia, A., &; Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. Springer.https://doi.org/10.1007/s00037-015-0120-9 

Abusalah, H. M., Fuchsbauer, G., &; Pietrzak, K. Z. (2016). Offline witness encryption (Vol. 9696, pp. 285–303). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer.https://doi.org/10.1007/978-3-319-39555-5_16 

Abusalah, H. M., Fuchsbauer, G., &; Pietrzak, K. Z. (2016). Constrained PRFs for unbounded inputs (Vol. 9610, pp. 413–428). Presented at the CT-RSA: Topics in Cryptology, San Francisco, CA, USA: Springer.https://doi.org/10.1007/978-3-319-29485-8_24 

Abusalah, H. M., &; Fuchsbauer, G. (2016). Constrained PRFs for unbounded inputs with short keys (Vol. 9696, pp. 445–463). Presented at the ACNS: Applied Cryptography and Network Security, Guildford, UK: Springer.https://doi.org/10.1007/978-3-319-39555-5_24 

Ferrara, A., Fuchsbauer, G., Liu, B., &; Warinschi, B. (2015). Policy privacy in cryptographic access control (pp. 46–60). Presented at the CSF: Computer Security Foundations, Verona, Italy: IEEE.https://doi.org/10.1109/CSF.2015.11 

Banerjee, A., Fuchsbauer, G., Peikert, C., Pietrzak, K. Z., &; Stevens, S. (2015). Key-homomorphic constrained pseudorandom functions. In 12th Theory of Cryptography Conference (Vol. 9015, pp. 31–60). Warsaw, Poland: Springer Nature.https://doi.org/10.1007/978-3-662-46497-7_2 

Fuchsbauer, G., Jafargholi, Z., &; Pietrzak, K. Z. (2015). A quasipolynomial reduction for generalized selective decryption on trees (Vol. 9215, pp. 601–620). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, USA: Springer.https://doi.org/10.1007/978-3-662-47989-6_29 

Benhamouda, F., Krenn, S., Lyubashevsky, V., &; Pietrzak, K. Z. (2015). Efficient zero-knowledge proofs for commitments from learning with errors over rings. Presented at the ESORICS: European Symposium on Research in Computer Security, Vienna, Austria: Springer.https://doi.org/10.1007/978-3-319-24174-6_16