7 Publications
2018 | Journal Article | LibreCat-ID: 9606
Liu, J., Jager, T., Kakvi, S., & Warinschi, B. (2018). How to build time-lock encryption. Designs, Codes and Cryptography, 2549–2586. https://doi.org/10.1007/s10623-018-0461-x
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 5442
Jager, T., Kakvi, S., & May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18. ACM Press. https://doi.org/10.1145/3243734.3243798
LibreCat
| Files available
| DOI
| Download (ext.)
2017 | Journal Article | LibreCat-ID: 9607
Kakvi, S., & Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology, 276–306. https://doi.org/10.1007/s00145-017-9257-9
LibreCat
| DOI
| Download (ext.)
2015 | Book Chapter | LibreCat-ID: 2921 | 
Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12
LibreCat
| DOI
| Download (ext.)
2012 | Book Chapter | LibreCat-ID: 2918
Kakvi, S., Kiltz, E., & May, A. (2012). Certifying RSA. In Advances in Cryptology – ASIACRYPT 2012 (pp. 404–414). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_25
LibreCat
| DOI
2012 | Book Chapter | LibreCat-ID: 2919
Kakvi, S., & Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In Advances in Cryptology – EUROCRYPT 2012 (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-29011-4_32
LibreCat
| DOI
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04052-8_43
LibreCat
| DOI
7 Publications
2018 | Journal Article | LibreCat-ID: 9606
Liu, J., Jager, T., Kakvi, S., & Warinschi, B. (2018). How to build time-lock encryption. Designs, Codes and Cryptography, 2549–2586. https://doi.org/10.1007/s10623-018-0461-x
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 5442
Jager, T., Kakvi, S., & May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18. ACM Press. https://doi.org/10.1145/3243734.3243798
LibreCat
| Files available
| DOI
| Download (ext.)
2017 | Journal Article | LibreCat-ID: 9607
Kakvi, S., & Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. Journal of Cryptology, 276–306. https://doi.org/10.1007/s00145-017-9257-9
LibreCat
| DOI
| Download (ext.)
2015 | Book Chapter | LibreCat-ID: 2921 |
Blazy, O., Kakvi, S., Kiltz, E., & Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-46447-2_12
LibreCat
| DOI
| Download (ext.)
2012 | Book Chapter | LibreCat-ID: 2918
Kakvi, S., Kiltz, E., & May, A. (2012). Certifying RSA. In Advances in Cryptology – ASIACRYPT 2012 (pp. 404–414). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-34961-4_25
LibreCat
| DOI
2012 | Book Chapter | LibreCat-ID: 2919
Kakvi, S., & Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In Advances in Cryptology – EUROCRYPT 2012 (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-29011-4_32
LibreCat
| DOI
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04052-8_43
LibreCat
| DOI