Stephan Krenn
Pietrzak Group
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 | 
Krenn, Stephan, Krzysztof Z Pietrzak, Akshay Wadia, and Daniel Wichs. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity. Springer, 2016. https://doi.org/10.1007/s00037-015-0120-9.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
Krenn, Stephan, Krzysztof Z Pietrzak, and Akshay Wadia. “A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It.” edited by Amit Sahai, 7785:23–39. Springer, 2013. https://doi.org/10.1007/978-3-642-36594-2_2.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
Bangerter, Endre, Stefania Barzan, Stephan Krenn, Ahmad Sadeghi, Thomas Schneider, and Joe Tsay. “Bringing Zero-Knowledge Proofs of Knowledge to Practice.” edited by Bruce Christianson, James Malcolm, Vashek Matyas, and Michael Roe, 7028:51–62. Springer, 2013. https://doi.org/10.1007/978-3-642-36213-2_9.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.” edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012. https://doi.org/10.1007/978-3-642-34961-4_40.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun Wang, 7073:449–67. Springer, 2011. https://doi.org/10.1007/978-3-642-25385-0.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche. “CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter, Marijke Coetzee, and Marianne Loock. IEEE, 2011. https://doi.org/10.1109/ISSA.2011.6027533.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 2976
Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. https://doi.org/10.1109/SP.2011.22.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
Almeida, José, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols.” edited by Dimitris Gritzalis, Bart Preneel, and Marianthi Theoharidou, 6345:151–67. Springer, 2010. https://doi.org/10.1007/978-3-642-15497-3.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
Bangerter, Endre, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “Automatic Generation of Sigma-Protocols.” edited by Fabio Martinelli and Bart Preneel, 6391:67–82. Springer, 2010. https://doi.org/10.1007/978-3-642-16441-5.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter, Endre, Jan Camenisch, and Stephan Krenn. “Efficiency Limitations for Σ-Protocols for Group Homomorphisms.” edited by Daniele Micciancio, 5978:553–71. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2.
View
| DOI
| Download (ext.)
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 |
Krenn, Stephan, Krzysztof Z Pietrzak, Akshay Wadia, and Daniel Wichs. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity. Springer, 2016. https://doi.org/10.1007/s00037-015-0120-9.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen, Joel F, Stephan Krenn, Krzysztof Z Pietrzak, and Daniel Wichs. “Learning with Rounding, Revisited: New Reduction Properties and Applications.” Lecture Notes in Computer Science. Springer, 2013. https://doi.org/10.1007/978-3-642-40041-4_4.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
Krenn, Stephan, Krzysztof Z Pietrzak, and Akshay Wadia. “A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It.” edited by Amit Sahai, 7785:23–39. Springer, 2013. https://doi.org/10.1007/978-3-642-36594-2_2.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
Bangerter, Endre, Stefania Barzan, Stephan Krenn, Ahmad Sadeghi, Thomas Schneider, and Joe Tsay. “Bringing Zero-Knowledge Proofs of Knowledge to Practice.” edited by Bruce Christianson, James Malcolm, Vashek Matyas, and Michael Roe, 7028:51–62. Springer, 2013. https://doi.org/10.1007/978-3-642-36213-2_9.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In Proceedings of the 2012 ACM Conference on Computer and Communications Security, 488–500. ACM, 2012. https://doi.org/10.1145/2382196.2382249.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
Jain, Abhishek, Stephan Krenn, Krzysztof Z Pietrzak, and Aris Tentes. “Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise.” edited by Xiaoyun Wang and Kazue Sako, 7658:663–80. Springer, 2012. https://doi.org/10.1007/978-3-642-34961-4_40.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun Wang, 7073:449–67. Springer, 2011. https://doi.org/10.1007/978-3-642-25385-0.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche. “CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter, Marijke Coetzee, and Marianne Loock. IEEE, 2011. https://doi.org/10.1109/ISSA.2011.6027533.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 2976
Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. https://doi.org/10.1109/SP.2011.22.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
Almeida, José, Endre Bangerter, Manuel Barbosa, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols.” edited by Dimitris Gritzalis, Bart Preneel, and Marianthi Theoharidou, 6345:151–67. Springer, 2010. https://doi.org/10.1007/978-3-642-15497-3.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
Bangerter, Endre, Thomas Briner, Wilko Henecka, Stephan Krenn, Ahmad Sadeghi, and Thomas Schneider. “Automatic Generation of Sigma-Protocols.” edited by Fabio Martinelli and Bart Preneel, 6391:67–82. Springer, 2010. https://doi.org/10.1007/978-3-642-16441-5.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter, Endre, Jan Camenisch, and Stephan Krenn. “Efficiency Limitations for Σ-Protocols for Group Homomorphisms.” edited by Daniele Micciancio, 5978:553–71. Springer, 2010. https://doi.org/10.1007/978-3-642-11799-2.
View
| DOI
| Download (ext.)