Fischlin, M., Lehmann, A., &; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. Journal of Cryptology. Springer.https://doi.org/10.1007/s00145-013-9148-7 

Gazi, P., Pietrzak, K. Z., &; Rybar, M. (2014). The exact PRF-security of NMAC and HMAC. In J. Garay &; R. Gennaro (Eds.) (Vol. 8616, pp. 113–130). Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, USA: Springer.https://doi.org/10.1007/978-3-662-44371-2_7 

Alwen, J. F., Krenn, S., Pietrzak, K. Z., &; Wichs, D. (2013). Learning with rounding, revisited: New reduction properties and applications. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-642-40041-4_4 

Kiltz, E., Pietrzak, K. Z., &; Szegedy, M. (2013). Digital signatures with minimal overhead from indifferentiable random invertible functions. Presented at the CRYPTO: International Cryptology Conference, Santa Barbara, CA, United States: Springer.https://doi.org/10.1007/978-3-642-40041-4_31 

Bernhard, D., Fuchsbauer, G., &; Ghadafi, E. (2013). Efficient signatures of knowledge and DAA in the standard model. Presented at the ACNS: Applied Cryptography and Network Security, Banff, AB, Canada: Springer.https://doi.org/10.1007/978-3-642-38980-1_33 

Ferrara, A., Fuchsbauer, G., &; Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE.https://doi.org/10.1109/CSF.2013.15 

Krenn, S., Pietrzak, K. Z., &; Wadia, A. (2013). A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. In A. Sahai (Ed.) (Vol. 7785, pp. 23–39). Presented at the TCC: Theory of Cryptography Conference, Tokyo, Japan: Springer.https://doi.org/10.1007/978-3-642-36594-2_2 

Blazy, O., Fuchsbauer, G., Pointcheval, D., &; Vergnaud, D. (2013). Short blind signatures. Journal of Computer Security. IOS Press.https://doi.org/10.3233/JCS-130477 

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

Faust, S., Pietrzak, K. Z., &; Schipper, J. (2012). Practical leakage-resilient symmetric cryptography. In https://doi.org/10.1007/978-3-642-33027-8_13__Conference proceedings CHES 2012 (Vol. 7428, pp. 213–232). Leuven, Belgium: Springer.https://doi.org/10.1007/978-3-642-33027-8_13 

Heyse, S., Kiltz, E., Lyubashevsky, V., Paar, C., &; Pietrzak, K. Z. (2012). Lapin: An efficient authentication protocol based on ring-LPN. In https://doi.org/10.1007/978-3-642-34047-5_20__Conference proceedings FSE 2012 (Vol. 7549, pp. 346–365). Washington, DC, USA: Springer.https://doi.org/10.1007/978-3-642-34047-5_20 

Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., &; Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In Proceedings of the 2012 ACM conference on Computer and communications security (pp. 488–500). Raleigh, NC, USA: ACM.https://doi.org/10.1145/2382196.2382249 

Jain, A., Krenn, S., Pietrzak, K. Z., &; Tentes, A. (2012). Commitments and efficient zero knowledge proofs from learning parity with noise. In X. Wang &; K. Sako (Eds.) (Vol. 7658, pp. 663–680). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Beijing, China: Springer.https://doi.org/10.1007/978-3-642-34961-4_40 

Pietrzak, K. Z. (2012). Cryptography from learning parity with noise (Vol. 7147, pp. 99–114). Presented at the SOFSEM: Current Trends in Theory and Practice of Computer Science, Spindlerfv Mlýn, Czech Republic: Springer.https://doi.org/10.1007/978-3-642-27660-6_9 

Dodis, Y., Pietrzak, K. Z., Kiltz, E., &; Wichs, D. (2012). Message authentication, revisited (Vol. 7237, pp. 355–374). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Cambridge, UK: Springer.https://doi.org/10.1007/978-3-642-29011-4_22 

Pietrzak, K. Z. (2012). Subspace LWE (Vol. 7194, pp. 548–563). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_31 

Pietrzak, K. Z., Rosen, A., &; Segev, G. (2012). Lossy functions do not amplify well (Vol. 7194, pp. 458–475). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_26 

Jain, A., Pietrzak, K. Z., &; Tentes, A. (2012). Hardness preserving constructions of pseudorandom functions (Vol. 7194, pp. 369–382). Presented at the TCC: Theory of Cryptography Conference, Taormina, Sicily, Italy: Springer.https://doi.org/10.1007/978-3-642-28914-9_21