Stephan Krenn
Pietrzak Group
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 | 
Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:10.1007/s00037-015-0120-9.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
Bangerter, Endre, et al. Bringing Zero-Knowledge Proofs of Knowledge to Practice. Edited by Bruce Christianson et al., vol. 7028, Springer, 2013, pp. 51–62, doi:10.1007/978-3-642-36213-2_9.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, Jan, et al. A Framework for Practical Universally Composable Zero-Knowledge Protocols. Edited by Dong Lee and Xiaoyun Wang, vol. 7073, Springer, 2011, pp. 449–67, doi:10.1007/978-3-642-25385-0.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, Endre, et al. CPLC - A Cryptographic Programming Language and Compiler. Edited by Hein Venter et al., IEEE, 2011, doi:10.1109/ISSA.2011.6027533.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 2976
Gullasch, David, et al. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. IEEE, 2011, pp. 490–505, doi:10.1109/SP.2011.22.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
Almeida, José, et al. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. Edited by Dimitris Gritzalis et al., vol. 6345, Springer, 2010, pp. 151–67, doi:10.1007/978-3-642-15497-3.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
Bangerter, Endre, et al. Automatic Generation of Sigma-Protocols. Edited by Fabio Martinelli and Bart Preneel, vol. 6391, Springer, 2010, pp. 67–82, doi:10.1007/978-3-642-16441-5.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter, Endre, et al. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. Edited by Daniele Micciancio, vol. 5978, Springer, 2010, pp. 553–71, doi:10.1007/978-3-642-11799-2.
View
| DOI
| Download (ext.)
12 Publications
2016 | Journal Article | IST-REx-ID: 1479 |
Krenn, Stephan, et al. “A Counterexample to the Chain Rule for Conditional HILL Entropy.” Computational Complexity, vol. 25, no. 3, Springer, 2016, pp. 567–605, doi:10.1007/s00037-015-0120-9.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2259 |
Alwen, Joel F., et al. Learning with Rounding, Revisited: New Reduction Properties and Applications. Vol. 8042, no. 1, Springer, 2013, pp. 57–74, doi:10.1007/978-3-642-40041-4_4.
[Published Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2940 |
Krenn, Stephan, et al. A Counterexample to the Chain Rule for Conditional HILL Entropy, and What Deniable Encryption Has to Do with It. Edited by Amit Sahai, vol. 7785, Springer, 2013, pp. 23–39, doi:10.1007/978-3-642-36594-2_2.
[Submitted Version]
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 2973 |
Bangerter, Endre, et al. Bringing Zero-Knowledge Proofs of Knowledge to Practice. Edited by Bruce Christianson et al., vol. 7028, Springer, 2013, pp. 51–62, doi:10.1007/978-3-642-36213-2_9.
View
| DOI
| Download (ext.)
2012 | Conference Paper | IST-REx-ID: 2937 |
Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500, doi:10.1145/2382196.2382249.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2012 | Conference Paper | IST-REx-ID: 2974 |
Jain, Abhishek, et al. Commitments and Efficient Zero Knowledge Proofs from Learning Parity with Noise. Edited by Xiaoyun Wang and Kazue Sako, vol. 7658, Springer, 2012, pp. 663–80, doi:10.1007/978-3-642-34961-4_40.
[Submitted Version]
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, Jan, et al. A Framework for Practical Universally Composable Zero-Knowledge Protocols. Edited by Dong Lee and Xiaoyun Wang, vol. 7073, Springer, 2011, pp. 449–67, doi:10.1007/978-3-642-25385-0.
View
| DOI
| Download (ext.)
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, Endre, et al. CPLC - A Cryptographic Programming Language and Compiler. Edited by Hein Venter et al., IEEE, 2011, doi:10.1109/ISSA.2011.6027533.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 2976
Gullasch, David, et al. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. IEEE, 2011, pp. 490–505, doi:10.1109/SP.2011.22.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2979 |
Almeida, José, et al. A Certifying Compiler for Zero-Knowledge Proofs of Knowledge Based on Sigma-Protocols. Edited by Dimitris Gritzalis et al., vol. 6345, Springer, 2010, pp. 151–67, doi:10.1007/978-3-642-15497-3.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2980 |
Bangerter, Endre, et al. Automatic Generation of Sigma-Protocols. Edited by Fabio Martinelli and Bart Preneel, vol. 6391, Springer, 2010, pp. 67–82, doi:10.1007/978-3-642-16441-5.
View
| DOI
| Download (ext.)
2010 | Conference Paper | IST-REx-ID: 2978 |
Bangerter, Endre, et al. Efficiency Limitations for Σ-Protocols for Group Homomorphisms. Edited by Daniele Micciancio, vol. 5978, Springer, 2010, pp. 553–71, doi:10.1007/978-3-642-11799-2.
View
| DOI
| Download (ext.)