J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” Designs, Codes and Cryptography, pp. 2549–2586, 2018.
LibreCat: /record/9606
DOI: 10.1007/s10623-018-0461-x

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.
LibreCat: /record/5442
DOI: 10.1145/3243734.3243798

S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.
LibreCat: /record/9607
DOI: 10.1007/s00145-017-9257-9

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.
LibreCat: /record/2921
DOI: 10.1007/978-3-662-46447-2_12

S. Kakvi, E. Kiltz, and A. May, “Certifying RSA,” in Advances in Cryptology – ASIACRYPT 2012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 404–414.
LibreCat: /record/2918
DOI: 10.1007/978-3-642-34961-4_25

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.
LibreCat: /record/2919
DOI: 10.1007/978-3-642-29011-4_32

S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat: /record/9616
DOI: 10.1007/978-3-642-04052-8_43