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.

The exact PRF security of truncation: Tight bounds for keyed sponges and truncated CBC
P. Gazi, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2015, pp. 368–387.

Relaxing full-codebook security: A refined analysis of key-length extension schemes
P. Gazi, J. Lee, Y. Seurin, J. Steinberger, S. Tessaro, 9054 (2015) 319–341.

Proofs of space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, in:, 35th Annual Cryptology Conference, Springer, 2015, pp. 585–605.

Constrained Verifiable Random Functions 
G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.

Optimality of non-adaptive strategies: The case of parallel games
G. Demay, P. Gazi, U. Maurer, B. Tackmann, in:, IEEE International Symposium on Information Theory, IEEE, 2014.

Enhanced chosen-ciphertext security and applications
D. Dachman Soled, G. Fuchsbauer, P. Mohassel, A. O’Neill, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 329–344.

Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases
F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.

Policy-based signatures
M. Bellare, G. Fuchsbauer, in:, H. Krawczyk (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 520–537.

Key derivation without entropy waste
Y. Dodis, K.Z. Pietrzak, D. Wichs, in:, P. Nguyen, E. Oswald (Eds.), Springer, 2014, pp. 93–110.

Simple chosen-ciphertext security from low noise LPN
E. Kiltz, D. Masny, K.Z. Pietrzak, in:, Springer, 2014, pp. 1–18.

How to fake auxiliary input
D. Jetchev, K.Z. Pietrzak, in:, Y. Lindell (Ed.), Springer, 2014, pp. 566–590.

Robust multi-property combiners for hash functions
M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.

The exact PRF-security of NMAC and HMAC
P. Gazi, K.Z. Pietrzak, M. Rybar, in:, J. Garay, R. Gennaro (Eds.), Springer, 2014, pp. 113–130.

Learning with rounding, revisited: New reduction properties and applications
J.F. Alwen, S. Krenn, K.Z. Pietrzak, D. Wichs, 8042 (2013) 57–74.

Digital signatures with minimal overhead from indifferentiable random invertible functions
E. Kiltz, K.Z. Pietrzak, M. Szegedy, 8042 (2013) 571–588.

Efficient signatures of knowledge and DAA in the standard model
D. Bernhard, G. Fuchsbauer, E. Ghadafi, 7954 (2013) 518–533.

Cryptographically enforced RBAC
A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.

A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it
S. Krenn, K.Z. Pietrzak, A. Wadia, in:, A. Sahai (Ed.), Springer, 2013, pp. 23–39.

Short blind signatures
O. Blazy, G. Fuchsbauer, D. Pointcheval, D. Vergnaud, Journal of Computer Security 21 (2013) 627–661.

Proofs of Space
S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.

Practical leakage-resilient symmetric cryptography
S. Faust, K.Z. Pietrzak, J. Schipper, in:,  Conference Proceedings CHES 2012, Springer, 2012, pp. 213–232.

Lapin: An efficient authentication protocol based on ring-LPN
S. Heyse, E. Kiltz, V. Lyubashevsky, C. Paar, K.Z. Pietrzak, in:,  Conference Proceedings FSE 2012, Springer, 2012, pp. 346–365.

Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols
J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.

Commitments and efficient zero knowledge proofs from learning parity with noise
A. Jain, S. Krenn, K.Z. Pietrzak, A. Tentes, in:, X. Wang, K. Sako (Eds.), Springer, 2012, pp. 663–680.

Cryptography from learning parity with noise
K.Z. Pietrzak, in:, Springer, 2012, pp. 99–114.

Message authentication, revisited
Y. Dodis, K.Z. Pietrzak, E. Kiltz, D. Wichs, in:, Springer, 2012, pp. 355–374.

Subspace LWE
K.Z. Pietrzak, in:, Springer, 2012, pp. 548–563.

Lossy functions do not amplify well
K.Z. Pietrzak, A. Rosen, G. Segev, in:, Springer, 2012, pp. 458–475.

Hardness preserving constructions of pseudorandom functions
A. Jain, K.Z. Pietrzak, A. Tentes, in:, Springer, 2012, pp. 369–382.