Krenn S, Pietrzak KZ, Wadia A, Wichs D. 2016. A counterexample to the chain rule for conditional HILL entropy. Computational Complexity. 25(3), 567–605.
LibreCat: https://research-explorer.ista.ac.at/record/1479
DOI: 10.1007/s00037-015-0120-9

Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
LibreCat: https://research-explorer.ista.ac.at/record/2259
DOI: 10.1007/978-3-642-40041-4_4

Krenn S, Pietrzak KZ, Wadia A. 2013. A counterexample to the chain rule for conditional HILL entropy, and what deniable encryption has to do with it. TCC: Theory of Cryptography Conference, LNCS, vol. 7785, 23–39.
LibreCat: https://research-explorer.ista.ac.at/record/2940
DOI: 10.1007/978-3-642-36594-2_2

Bangerter E, Barzan S, Krenn S, Sadeghi A, Schneider T, Tsay J. 2013. Bringing Zero-Knowledge Proofs of Knowledge to Practice. SPW: Security Protocols Workshop, LNCS, vol. 7028, 51–62.
LibreCat: https://research-explorer.ista.ac.at/record/2973
DOI: 10.1007/978-3-642-36213-2_9

Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Computer and Communications Security, 488–500.
LibreCat: https://research-explorer.ista.ac.at/record/2937
DOI: 10.1145/2382196.2382249

Jain A, Krenn S, Pietrzak KZ, Tentes A. 2012. Commitments and efficient zero knowledge proofs from learning parity with noise. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7658, 663–680.
LibreCat: https://research-explorer.ista.ac.at/record/2974
DOI: 10.1007/978-3-642-34961-4_40

Camenisch J, Krenn S, Shoup V. 2011. A Framework for Practical Universally Composable Zero-Knowledge Protocols. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7073, 449–467.
LibreCat: https://research-explorer.ista.ac.at/record/2975
DOI: 10.1007/978-3-642-25385-0

Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. 2011. cPLC - A Cryptographic Programming Language and Compiler. ISSA: Information Security South Africa.
LibreCat: https://research-explorer.ista.ac.at/record/2977
DOI: 10.1109/ISSA.2011.6027533

Gullasch D, Bangerter E, Krenn S. 2011. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. S&;P: IEEE Symposium on Security and Privacy, 490–505.
LibreCat: https://research-explorer.ista.ac.at/record/2976
DOI: 10.1109/SP.2011.22

Almeida J, Bangerter E, Barbosa M, Krenn S, Sadeghi A, Schneider T. 2010. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. ESORICS: European Symposium on Research in Computer Security, LNCS, vol. 6345, 151–167.
LibreCat: https://research-explorer.ista.ac.at/record/2979
DOI: 10.1007/978-3-642-15497-3

Bangerter E, Briner T, Henecka W, Krenn S, Sadeghi A, Schneider T. 2010. Automatic Generation of Sigma-Protocols. EuroPKI: Public Key Infrastructures, Services and Applications, LNCS, vol. 6391, 67–82.
LibreCat: https://research-explorer.ista.ac.at/record/2980
DOI: 10.1007/978-3-642-16441-5

Bangerter E, Camenisch J, Krenn S. 2010. Efficiency Limitations for :3-Protocols for Group Homomorphisms. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 553–571.
LibreCat: https://research-explorer.ista.ac.at/record/2978
DOI: 10.1007/978-3-642-11799-2