Skórski, Maciej. Lower Bounds on Key Derivation for Square-Friendly Applications. Vol. 66, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.STACS.2017.57.
LibreCat: https://research-explorer.ista.ac.at/record/1174
DOI: 10.4230/LIPIcs.STACS.2017.57
WoS: 000521077300057

Alwen, Joel F., and Jeremiah Blocki. Towards Practical Attacks on Argon2i and Balloon Hashing. 7961977, IEEE, 2017, doi:10.1109/EuroSP.2017.47.
LibreCat: https://research-explorer.ista.ac.at/record/1176
DOI: 10.1109/EuroSP.2017.47
WoS: 000424197300011

Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.”10.1007/s00145-016-9247-3__Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3.
LibreCat: https://research-explorer.ista.ac.at/record/1187
DOI: 10.1007/s00145-016-9247-3
WoS: 000410788600007

Kamath Hosdurg, Chethan, and Sanjit Chatterjee. “A Closer Look at Multiple-Forking: Leveraging (in)Dependence for a Tighter Bound.”10.1007/s00453-015-9997-6__Algorithmica, vol. 74, no. 4, Springer, 2016, pp. 1321–62, doi:10.1007/s00453-015-9997-6.
LibreCat: https://research-explorer.ista.ac.at/record/1177
DOI: 10.1007/s00453-015-9997-6

Pietrzak, Krzysztof Z., and Skorski Maciej. Pseudoentropy: Lower-Bounds for Chain Rules and Transformations. Vol. 9985, Springer, 2016, pp. 183–203, doi:10.1007/978-3-662-53641-4_8.
LibreCat: https://research-explorer.ista.ac.at/record/1179
DOI: 10.1007/978-3-662-53641-4_8

Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Fuchsbauer, Georg, et al. Standard Security Does Imply Security against Selective Opening for Markov Distributions. Vol. 9562, Springer, 2016, pp. 282–305, doi:10.1007/978-3-662-49096-9_12.
LibreCat: https://research-explorer.ista.ac.at/record/1233
DOI: 10.1007/978-3-662-49096-9_12

Alwen, Joel F., and Jeremiah Blocki. Efficiently Computing Data-Independent Memory-Hard Functions. Vol. 9815, Springer, 2016, pp. 241–71, doi:10.1007/978-3-662-53008-5_9.
LibreCat: https://research-explorer.ista.ac.at/record/1365
DOI: 10.1007/978-3-662-53008-5_9

Gazi, Peter, and Stefano Tessaro. Provably Robust Sponge-Based PRNGs and KDFs. Vol. 9665, Springer, 2016, pp. 87–116, doi:10.1007/978-3-662-49890-3_4.
LibreCat: https://research-explorer.ista.ac.at/record/1366
DOI: 10.1007/978-3-662-49890-3_4

Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group Elements.”10.1007/s00145-014-9196-7__Journal of Cryptology, vol. 29, no. 2, Springer, 2016, pp. 363–421, doi:10.1007/s00145-014-9196-7.
LibreCat: https://research-explorer.ista.ac.at/record/1592
DOI: 10.1007/s00145-014-9196-7

Fuchsbauer, Georg, et al. Practical Round-Optimal Blind Signatures in the Standard Model from Weaker Assumptions. Vol. 9841, Springer, 2016, pp. 391–408, doi:10.1007/978-3-319-44618-9_21.
LibreCat: https://research-explorer.ista.ac.at/record/1225
DOI: 10.1007/978-3-319-44618-9_21

Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45, doi:10.1007/978-3-662-48797-6_6.
LibreCat: https://research-explorer.ista.ac.at/record/1653
DOI: 10.1007/978-3-662-48797-6_6

Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.”10.1007/s00037-015-0120-9__Computational Complexity, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:10.1007/s00037-015-0120-9.
LibreCat: https://research-explorer.ista.ac.at/record/1479
DOI: 10.1007/s00037-015-0120-9

Abusalah, Hamza M., et al. Offline Witness Encryption. Vol. 9696, Springer, 2016, pp. 285–303, doi:10.1007/978-3-319-39555-5_16.
LibreCat: https://research-explorer.ista.ac.at/record/1229
DOI: 10.1007/978-3-319-39555-5_16

Abusalah, Hamza M., et al. Constrained PRFs for Unbounded Inputs. Vol. 9610, Springer, 2016, pp. 413–28, doi:10.1007/978-3-319-29485-8_24.
LibreCat: https://research-explorer.ista.ac.at/record/1236
DOI: 10.1007/978-3-319-29485-8_24

Abusalah, Hamza M., and Georg Fuchsbauer. Constrained PRFs for Unbounded Inputs with Short Keys. Vol. 9696, Springer, 2016, pp. 445–63, doi:10.1007/978-3-319-39555-5_24.
LibreCat: https://research-explorer.ista.ac.at/record/1235
DOI: 10.1007/978-3-319-39555-5_24

Ferrara, Anna, et al. Policy Privacy in Cryptographic Access Control. IEEE, 2015, pp. 46–60, doi:10.1109/CSF.2015.11.
LibreCat: https://research-explorer.ista.ac.at/record/1474
DOI: 10.1109/CSF.2015.11

Banerjee, Abishek, et al. “Key-Homomorphic Constrained Pseudorandom Functions.”10.1007/978-3-662-46497-7_2__12th Theory of Cryptography Conference, vol. 9015, Springer Nature, 2015, pp. 31–60, doi:10.1007/978-3-662-46497-7_2.
LibreCat: https://research-explorer.ista.ac.at/record/1646
DOI: 10.1007/978-3-662-46497-7_2

Fuchsbauer, Georg, et al. A Quasipolynomial Reduction for Generalized Selective Decryption on Trees. Vol. 9215, Springer, 2015, pp. 601–20, doi:10.1007/978-3-662-47989-6_29.
LibreCat: https://research-explorer.ista.ac.at/record/1648
DOI: 10.1007/978-3-662-47989-6_29

Benhamouda, Fabrice, et al. Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings. Vol. 9326, Springer, 2015, pp. 305–25, doi:10.1007/978-3-319-24174-6_16.
LibreCat: https://research-explorer.ista.ac.at/record/1649
DOI: 10.1007/978-3-319-24174-6_16