Stephan Krenn
Pietrzak Group
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 | 
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.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
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.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
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.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
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.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
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.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2976
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter E, Camenisch J, Krenn S. 2010. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 553–571.
View
| DOI
| Download (ext.)
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 |
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.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen JF, Krenn S, Pietrzak KZ, Wichs D. 2013. Learning with rounding, revisited: New reduction properties and applications. 8042(1), 57–74.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
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.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
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.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
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.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
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.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2976
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
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.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter E, Camenisch J, Krenn S. 2010. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. TCC: Theory of Cryptography Conference, LNCS, vol. 5978, 553–571.
View
| DOI
| Download (ext.)