J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” Designs, Codes and Cryptography, pp. 2549–2586, 2018.

T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS .5 Signature Scheme,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, 2018.

S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.

O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from Chameleon Hash Functions,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.

S. Kakvi, E. Kiltz, and A. May, “Certifying RSA,” in Advances in Cryptology – ASIACRYPT 2012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 404–414.

S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” in Advances in Cryptology – EUROCRYPT 2012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 537–553.

S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.