12 Publications

Mark all

[12]
2016 | Journal Article | IST-REx-ID: 1479
Krenn, S., Pietrzak, K. Z., Wadia, A., & Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity, 25(3), 567–605. https://doi.org/10.1007/s00037-015-0120-9
View | Files available | DOI
 
[11]
2013 | Conference Paper | IST-REx-ID: 2259   OA
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
View | Files available | DOI
 
[10]
2013 | Conference Paper | IST-REx-ID: 2940   OA
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
View | Files available | DOI
 
[9]
2013 | Conference Paper | IST-REx-ID: 2973   OA
Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A., Schneider, T., & Tsay, J. (2013). Bringing Zero-Knowledge Proofs of Knowledge to Practice. In B. Christianson, J. Malcolm, V. Matyas, & M. Roe (Eds.) (Vol. 7028, pp. 51–62). Presented at the SPW: Security Protocols Workshop, Springer. https://doi.org/10.1007/978-3-642-36213-2_9
View | DOI | Download (ext.)
 
[8]
2012 | Conference Paper | IST-REx-ID: 2974   OA
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
View | Files available | DOI
 
[7]
2012 | Conference Paper | IST-REx-ID: 2937   OA
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
View | DOI | Download (ext.)
 
[6]
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, J., Krenn, S., & Shoup, V. (2011). A Framework for Practical Universally Composable Zero-Knowledge Protocols. In D. Lee & X. Wang (Eds.) (Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-25385-0
View | DOI | Download (ext.)
 
[5]
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 (pp. 490–505). Presented at the S&P: IEEE Symposium on Security and Privacy, IEEE. https://doi.org/10.1109/SP.2011.22
View | DOI | Download (ext.)
 
[4]
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, E., Krenn, S., Seifriz, M., & Ultes Nitsche, U. (2011). cPLC - A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee, & M. Loock (Eds.). Presented at the ISSA: Information Security South Africa, IEEE. https://doi.org/10.1109/ISSA.2011.6027533
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 2979   OA
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. In D. Gritzalis, B. Preneel, & M. Theoharidou (Eds.) (Vol. 6345, pp. 151–167). Presented at the ESORICS: European Symposium on Research in Computer Security, Springer. https://doi.org/10.1007/978-3-642-15497-3
View | DOI | Download (ext.)
 
[2]
2010 | Conference Paper | IST-REx-ID: 2978   OA
Bangerter, E., Camenisch, J., & Krenn, S. (2010). Efficiency Limitations for Σ-Protocols for Group Homomorphisms. In D. Micciancio (Ed.) (Vol. 5978, pp. 553–571). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2
View | DOI | Download (ext.)
 
[1]
2010 | Conference Paper | IST-REx-ID: 2980   OA
Bangerter, E., Briner, T., Henecka, W., Krenn, S., Sadeghi, A., & Schneider, T. (2010). Automatic Generation of Sigma-Protocols. In F. Martinelli & B. Preneel (Eds.) (Vol. 6391, pp. 67–82). Presented at the EuroPKI: Public Key Infrastructures, Services and Applications, Springer. https://doi.org/10.1007/978-3-642-16441-5
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

12 Publications

Mark all

[12]
2016 | Journal Article | IST-REx-ID: 1479
Krenn, S., Pietrzak, K. Z., Wadia, A., & Wichs, D. (2016). A counterexample to the chain rule for conditional HILL entropy. Computational Complexity, 25(3), 567–605. https://doi.org/10.1007/s00037-015-0120-9
View | Files available | DOI
 
[11]
2013 | Conference Paper | IST-REx-ID: 2259   OA
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
View | Files available | DOI
 
[10]
2013 | Conference Paper | IST-REx-ID: 2940   OA
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
View | Files available | DOI
 
[9]
2013 | Conference Paper | IST-REx-ID: 2973   OA
Bangerter, E., Barzan, S., Krenn, S., Sadeghi, A., Schneider, T., & Tsay, J. (2013). Bringing Zero-Knowledge Proofs of Knowledge to Practice. In B. Christianson, J. Malcolm, V. Matyas, & M. Roe (Eds.) (Vol. 7028, pp. 51–62). Presented at the SPW: Security Protocols Workshop, Springer. https://doi.org/10.1007/978-3-642-36213-2_9
View | DOI | Download (ext.)
 
[8]
2012 | Conference Paper | IST-REx-ID: 2974   OA
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
View | Files available | DOI
 
[7]
2012 | Conference Paper | IST-REx-ID: 2937   OA
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
View | DOI | Download (ext.)
 
[6]
2011 | Conference Paper | IST-REx-ID: 2975
Camenisch, J., Krenn, S., & Shoup, V. (2011). A Framework for Practical Universally Composable Zero-Knowledge Protocols. In D. Lee & X. Wang (Eds.) (Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Springer. https://doi.org/10.1007/978-3-642-25385-0
View | DOI | Download (ext.)
 
[5]
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 (pp. 490–505). Presented at the S&P: IEEE Symposium on Security and Privacy, IEEE. https://doi.org/10.1109/SP.2011.22
View | DOI | Download (ext.)
 
[4]
2011 | Conference Paper | IST-REx-ID: 2977
Bangerter, E., Krenn, S., Seifriz, M., & Ultes Nitsche, U. (2011). cPLC - A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee, & M. Loock (Eds.). Presented at the ISSA: Information Security South Africa, IEEE. https://doi.org/10.1109/ISSA.2011.6027533
View | DOI
 
[3]
2010 | Conference Paper | IST-REx-ID: 2979   OA
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. In D. Gritzalis, B. Preneel, & M. Theoharidou (Eds.) (Vol. 6345, pp. 151–167). Presented at the ESORICS: European Symposium on Research in Computer Security, Springer. https://doi.org/10.1007/978-3-642-15497-3
View | DOI | Download (ext.)
 
[2]
2010 | Conference Paper | IST-REx-ID: 2978   OA
Bangerter, E., Camenisch, J., & Krenn, S. (2010). Efficiency Limitations for Σ-Protocols for Group Homomorphisms. In D. Micciancio (Ed.) (Vol. 5978, pp. 553–571). Presented at the TCC: Theory of Cryptography Conference, Springer. https://doi.org/10.1007/978-3-642-11799-2
View | DOI | Download (ext.)
 
[1]
2010 | Conference Paper | IST-REx-ID: 2980   OA
Bangerter, E., Briner, T., Henecka, W., Krenn, S., Sadeghi, A., & Schneider, T. (2010). Automatic Generation of Sigma-Protocols. In F. Martinelli & B. Preneel (Eds.) (Vol. 6391, pp. 67–82). Presented at the EuroPKI: Public Key Infrastructures, Services and Applications, Springer. https://doi.org/10.1007/978-3-642-16441-5
View | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed