7 Publications
2018 | Journal Article | LibreCat-ID: 9606
Liu, Jia, et al. “How to Build Time-Lock Encryption.” Designs, Codes and Cryptography, 2018, pp. 2549–86, doi:10.1007/s10623-018-0461-x.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 5442
Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18, ACM Press, 2018, doi:10.1145/3243734.3243798.
LibreCat
| Files available
| DOI
| Download (ext.)
2017 | Journal Article | LibreCat-ID: 9607
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.
LibreCat
| DOI
| Download (ext.)
2015 | Book Chapter | LibreCat-ID: 2921 |

Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:10.1007/978-3-662-46447-2_12.
LibreCat
| DOI
| Download (ext.)
2012 | Book Chapter | LibreCat-ID: 2918
Kakvi, Saqib, et al. “Certifying RSA.” Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:10.1007/978-3-642-34961-4_25.
LibreCat
| DOI
2012 | Book Chapter | LibreCat-ID: 2919
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.
LibreCat
| DOI
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-04052-8_43.
LibreCat
| DOI
7 Publications
2018 | Journal Article | LibreCat-ID: 9606
Liu, Jia, et al. “How to Build Time-Lock Encryption.” Designs, Codes and Cryptography, 2018, pp. 2549–86, doi:10.1007/s10623-018-0461-x.
LibreCat
| DOI
2018 | Conference Paper | LibreCat-ID: 5442
Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS ’18, ACM Press, 2018, doi:10.1145/3243734.3243798.
LibreCat
| Files available
| DOI
| Download (ext.)
2017 | Journal Article | LibreCat-ID: 9607
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.
LibreCat
| DOI
| Download (ext.)
2015 | Book Chapter | LibreCat-ID: 2921 |

Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:10.1007/978-3-662-46447-2_12.
LibreCat
| DOI
| Download (ext.)
2012 | Book Chapter | LibreCat-ID: 2918
Kakvi, Saqib, et al. “Certifying RSA.” Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:10.1007/978-3-642-34961-4_25.
LibreCat
| DOI
2012 | Book Chapter | LibreCat-ID: 2919
Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.
LibreCat
| DOI
| Download (ext.)
2009 | Book Chapter | LibreCat-ID: 9616
Kakvi, Saqib. “Reinforcement Learning for Blackjack.” Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-04052-8_43.
LibreCat
| DOI