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 

Demay, G., Gazi, P., Maurer, U., &; Tackmann, B. (2015). Query-complexity amplification for random oracles (Vol. 9063, pp. 159–180). Presented at the ICITS: International Conference on Information Theoretic Security, Lugano, Switzerland: Springer.https://doi.org/10.1007/978-3-319-17470-9_10 

Fuchsbauer, G., Hanser, C., &; Slamanig, D. (2015). Practical round-optimal blind signatures in the standard model (Vol. 9216, pp. 233–253). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_12 

Gazi, P., &; Tessaro, S. (2015). Secret-key cryptography from ideal primitives: A systematic verview. In 2015 IEEE Information Theory Workshop. Jerusalem, Israel: IEEE.https://doi.org/10.1109/ITW.2015.7133163 

Gazi, P., Pietrzak, K. Z., &; Tessaro, S. (2015). Generic security of NMAC and HMAC with input whitening. Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer.https://doi.org/10.1007/978-3-662-48800-3_4 

Skórski, M., Golovnev, A., &; Pietrzak, K. Z. (2015). Condensed unpredictabilityhttps://doi.org/10.1007/978-3-662-47672-7_85__(Vol. 9134, pp. 1046–1057). Presented at the ICALP: Automata, Languages and Programming, Kyoto, Japan: Springer.https://doi.org/10.1007/978-3-662-47672-7_85 

Baldimtsi, F., Chase, M., Fuchsbauer, G., &; Kohlweiss, M. (2015). Anonymous transferable e-cash. In Public-Key Cryptography - PKC 2015 (Vol. 9020, pp. 101–124). Gaithersburg, MD, United States: Springer.https://doi.org/10.1007/978-3-662-46447-2_5 

Alwen, J. F., &; Serbinenko, V. (2015). High parallel complexity graphs and memory-hard functions. In Proceedings of the 47th annual ACM symposium on Theory of computing (pp. 595–603). Portland, OR, United States: ACM.https://doi.org/10.1145/2746539.2746622 

Alwen, J. F., Ostrovsky, R., Zhou, H., &; Zikas, V. (2015). Incoercible multi-party computation and universally composable receipt-free voting. In Advances in Cryptology - CRYPTO 2015 (Vol. 9216, pp. 763–780). Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-48000-7_37 

Pietrzak, K. Z., &; Skórski, M. (2015). The chain rule for HILL pseudoentropy, revisited. Presented at the LATINCRYPT: Cryptology and Information Security in Latin America, Guadalajara, Mexico: Springer.https://doi.org/10.1007/978-3-319-22174-8_5 

Gazi, P., Pietrzak, K. Z., &; Tessaro, S. (2015). The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC (Vol. 9215, pp. 368–387). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-662-47989-6_18