Liu, Jia, et al. “How to Build Time-Lock Encryption.”10.1007/s10623-018-0461-x__Designs, Codes and Cryptography, 2018, pp. 2549–86, doi:10.1007/s10623-018-0461-x.
LibreCat: /record/9606
DOI: 10.1007/s10623-018-0461-x

Jager, Tibor, et al. “On the Security of the PKCS .5 Signature Scheme.”10.1145/3243734.3243798__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, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.”10.1007/s00145-017-9257-9__Journal of Cryptology, 2017, pp. 276–306, doi:10.1007/s00145-017-9257-9.
LibreCat: /record/9607
DOI: 10.1007/s00145-017-9257-9

Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.”10.1007/978-3-662-46447-2_12__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:10.1007/978-3-662-46447-2_12.
LibreCat: /record/2921
DOI: 10.1007/978-3-662-46447-2_12

Kakvi, Saqib, et al. “Certifying RSA.”10.1007/978-3-642-34961-4_25__Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:10.1007/978-3-642-34961-4_25.
LibreCat: /record/2918
DOI: 10.1007/978-3-642-34961-4_25

Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.”10.1007/978-3-642-29011-4_32__Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.
LibreCat: /record/2919
DOI: 10.1007/978-3-642-29011-4_32

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