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

Jager T, Kakvi S, May A. On the Security of the PKCS .5 Signature Scheme. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18. ACM Press; 2018. doi:10.1145/3243734.3243798
LibreCat: /record/5442
DOI: 10.1145/3243734.3243798

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

Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon Hash Functions. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015:256-279. doi:10.1007/978-3-662-46447-2_12
LibreCat: /record/2921
DOI: 10.1007/978-3-662-46447-2_12

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

Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. In: Advances in Cryptology – EUROCRYPT 2012. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:537-553. doi:10.1007/978-3-642-29011-4_32
LibreCat: /record/2919
DOI: 10.1007/978-3-642-29011-4_32

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