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.

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.

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.

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.

Offline witness encryption
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 285–303.

Constrained PRFs for unbounded inputs
H.M. Abusalah, G. Fuchsbauer, K.Z. Pietrzak, in:, Springer, 2016, pp. 413–428.

Constrained PRFs for unbounded inputs with short keys
H.M. Abusalah, G. Fuchsbauer, in:, Springer, 2016, pp. 445–463.

Policy privacy in cryptographic access control
A. Ferrara, G. Fuchsbauer, B. Liu, B. Warinschi, in:, IEEE, 2015, pp. 46–60.

Key-homomorphic constrained pseudorandom functions
A. Banerjee, G. Fuchsbauer, C. Peikert, K.Z. Pietrzak, S. Stevens, in:, 12th Theory of Cryptography Conference, Springer Nature, 2015, pp. 31–60.

A quasipolynomial reduction for generalized selective decryption on trees
G. Fuchsbauer, Z. Jafargholi, K.Z. Pietrzak, in:, Springer, 2015, pp. 601–620.

Efficient zero-knowledge proofs for commitments from learning with errors over rings
F. Benhamouda, S. Krenn, V. Lyubashevsky, K.Z. Pietrzak, 9326 (2015) 305–325.

Query-complexity amplification for random oracles
G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, Springer, 2015, pp. 159–180.

Practical round-optimal blind signatures in the standard model
G. Fuchsbauer, C. Hanser, D. Slamanig, in:, Springer, 2015, pp. 233–253.

Secret-key cryptography from ideal primitives: A systematic verview
P. Gazi, S. Tessaro, in:, 2015 IEEE Information Theory Workshop, IEEE, 2015.

Generic security of NMAC and HMAC with input whitening
P. Gazi, K.Z. Pietrzak, S. Tessaro, 9453 (2015) 85–109.

Condensed unpredictability 
M. Skórski, A. Golovnev, K.Z. Pietrzak, in:, Springer, 2015, pp. 1046–1057.

Anonymous transferable e-cash
F. Baldimtsi, M. Chase, G. Fuchsbauer, M. Kohlweiss, in:, Public-Key Cryptography - PKC 2015, Springer, 2015, pp. 101–124.

High parallel complexity graphs and memory-hard functions
J.F. Alwen, V. Serbinenko, in:, Proceedings of the 47th Annual ACM Symposium on Theory of Computing, ACM, 2015, pp. 595–603.

Incoercible multi-party computation and universally composable receipt-free voting
J.F. Alwen, R. Ostrovsky, H. Zhou, V. Zikas, in:, Advances in Cryptology - CRYPTO 2015, Springer, 2015, pp. 763–780.

The chain rule for HILL pseudoentropy, revisited
K.Z. Pietrzak, M. Skórski, 9230 (2015) 81–98.