[{"citation":{"apa":"Liu, J., Jager, T., Kakvi, S., &#38; Warinschi, B. (2018). How to build time-lock encryption. <i>Designs, Codes and Cryptography</i>, 2549–2586. <a href=\"https://doi.org/10.1007/s10623-018-0461-x\">https://doi.org/10.1007/s10623-018-0461-x</a>","ieee":"J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” <i>Designs, Codes and Cryptography</i>, pp. 2549–2586, 2018.","short":"J. Liu, T. Jager, S. Kakvi, B. Warinschi, Designs, Codes and Cryptography (2018) 2549–2586.","chicago":"Liu, Jia, Tibor Jager, Saqib Kakvi, and Bogdan Warinschi. “How to Build Time-Lock Encryption.” <i>Designs, Codes and Cryptography</i>, 2018, 2549–86. <a href=\"https://doi.org/10.1007/s10623-018-0461-x\">https://doi.org/10.1007/s10623-018-0461-x</a>.","mla":"Liu, Jia, et al. “How to Build Time-Lock Encryption.” <i>Designs, Codes and Cryptography</i>, 2018, pp. 2549–86, doi:<a href=\"https://doi.org/10.1007/s10623-018-0461-x\">10.1007/s10623-018-0461-x</a>.","ama":"Liu J, Jager T, Kakvi S, Warinschi B. How to build time-lock encryption. <i>Designs, Codes and Cryptography</i>. 2018:2549-2586. doi:<a href=\"https://doi.org/10.1007/s10623-018-0461-x\">10.1007/s10623-018-0461-x</a>","bibtex":"@article{Liu_Jager_Kakvi_Warinschi_2018, title={How to build time-lock encryption}, DOI={<a href=\"https://doi.org/10.1007/s10623-018-0461-x\">10.1007/s10623-018-0461-x</a>}, journal={Designs, Codes and Cryptography}, author={Liu, Jia and Jager, Tibor and Kakvi, Saqib and Warinschi, Bogdan}, year={2018}, pages={2549–2586} }"},"publication":"Designs, Codes and Cryptography","department":[{"_id":"558"}],"type":"journal_article","date_created":"2019-05-03T12:42:01Z","date_updated":"2022-01-06T07:04:16Z","publication_status":"published","author":[{"first_name":"Jia","last_name":"Liu","full_name":"Liu, Jia"},{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"id":"66268","full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"},{"full_name":"Warinschi, Bogdan","first_name":"Bogdan","last_name":"Warinschi"}],"publication_identifier":{"issn":["0925-1022","1573-7586"]},"status":"public","year":"2018","title":"How to build time-lock encryption","doi":"10.1007/s10623-018-0461-x","user_id":"66268","_id":"9606","language":[{"iso":"eng"}],"page":"2549-2586"},{"file":[{"content_type":"application/pdf","success":1,"file_id":"5443","date_updated":"2018-11-08T12:57:34Z","relation":"main_file","file_size":481982,"access_level":"closed","file_name":"2018-855.pdf","date_created":"2018-11-08T12:57:34Z","creator":"abirke"}],"date_created":"2018-11-08T12:56:04Z","type":"conference","department":[{"_id":"558"}],"publication":"Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS '18","main_file_link":[{"url":"https://eprint.iacr.org/2018/855.pdf"}],"language":[{"iso":"eng"}],"doi":"10.1145/3243734.3243798","year":"2018","title":"On the Security of the PKCS#1 v1.5 Signature Scheme","author":[{"first_name":"Tibor","last_name":"Jager","full_name":"Jager, Tibor","id":"64669"},{"id":"66268","last_name":"Kakvi","first_name":"Saqib","full_name":"Kakvi, Saqib"},{"last_name":"May","first_name":"Alexander","full_name":"May, Alexander"}],"publication_identifier":{"isbn":["9781450356930"]},"date_updated":"2022-01-06T07:01:54Z","publication_status":"published","file_date_updated":"2018-11-08T12:57:34Z","citation":{"ama":"Jager T, Kakvi S, May A. On the Security of the PKCS#1 v1.5 Signature Scheme. In: <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>","bibtex":"@inproceedings{Jager_Kakvi_May_2018, title={On the Security of the PKCS#1 v1.5 Signature Scheme}, DOI={<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>}, booktitle={Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18}, publisher={ACM Press}, author={Jager, Tibor and Kakvi, Saqib and May, Alexander}, year={2018} }","mla":"Jager, Tibor, et al. “On the Security of the PKCS#1 v1.5 Signature Scheme.” <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3243734.3243798\">10.1145/3243734.3243798</a>.","short":"T. Jager, S. Kakvi, A. May, in: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, ACM Press, 2018.","chicago":"Jager, Tibor, Saqib Kakvi, and Alexander May. “On the Security of the PKCS#1 v1.5 Signature Scheme.” In <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3243734.3243798\">https://doi.org/10.1145/3243734.3243798</a>.","apa":"Jager, T., Kakvi, S., &#38; May, A. (2018). On the Security of the PKCS#1 v1.5 Signature Scheme. In <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>. ACM Press. <a href=\"https://doi.org/10.1145/3243734.3243798\">https://doi.org/10.1145/3243734.3243798</a>","ieee":"T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in <i>Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18</i>, 2018."},"_id":"5442","publisher":"ACM Press","ddc":["006"],"user_id":"38235","status":"public","has_accepted_license":"1"},{"publication":"Journal of Cryptology","citation":{"bibtex":"@article{Kakvi_Kiltz_2017, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>}, journal={Journal of Cryptology}, author={Kakvi, Saqib and Kiltz, Eike}, year={2017}, pages={276–306} }","short":"S. Kakvi, E. Kiltz, Journal of Cryptology (2017) 276–306.","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. <i>Journal of Cryptology</i>. 2017:276-306. doi:<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>","chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Journal of Cryptology</i>, 2017, 276–306. <a href=\"https://doi.org/10.1007/s00145-017-9257-9\">https://doi.org/10.1007/s00145-017-9257-9</a>.","ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” <i>Journal of Cryptology</i>, pp. 276–306, 2017.","mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Journal of Cryptology</i>, 2017, pp. 276–306, doi:<a href=\"https://doi.org/10.1007/s00145-017-9257-9\">10.1007/s00145-017-9257-9</a>.","apa":"Kakvi, S., &#38; Kiltz, E. (2017). Optimal Security Proofs for Full Domain Hash, Revisited. <i>Journal of Cryptology</i>, 276–306. <a href=\"https://doi.org/10.1007/s00145-017-9257-9\">https://doi.org/10.1007/s00145-017-9257-9</a>"},"date_created":"2019-05-03T12:44:03Z","type":"journal_article","department":[{"_id":"558"}],"status":"public","year":"2017","title":"Optimal Security Proofs for Full Domain Hash, Revisited","publication_identifier":{"issn":["0933-2790","1432-1378"]},"author":[{"id":"66268","last_name":"Kakvi","first_name":"Saqib","full_name":"Kakvi, Saqib"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"}],"date_updated":"2022-01-06T07:04:16Z","publication_status":"published","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2Fs00145-017-9257-9"}],"page":"276-306","language":[{"iso":"eng"}],"_id":"9607","doi":"10.1007/s00145-017-9257-9","user_id":"66268"},{"status":"public","user_id":"66268","_id":"2921","publisher":"Springer Berlin Heidelberg","page":"256-279","citation":{"bibtex":"@inbook{Blazy_Kakvi_Kiltz_Pan_2015, place={Berlin, Heidelberg}, title={Tightly-Secure Signatures from Chameleon Hash Functions}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blazy, Olivier and Kakvi, Saqib and Kiltz, Eike and Pan, Jiaxin}, year={2015}, pages={256–279} }","ama":"Blazy O, Kakvi S, Kiltz E, Pan J. Tightly-Secure Signatures from Chameleon Hash Functions. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2015:256-279. doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>","mla":"Blazy, Olivier, et al. “Tightly-Secure Signatures from Chameleon Hash Functions.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2015, pp. 256–79, doi:<a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">10.1007/978-3-662-46447-2_12</a>.","chicago":"Blazy, Olivier, Saqib Kakvi, Eike Kiltz, and Jiaxin Pan. “Tightly-Secure Signatures from Chameleon Hash Functions.” In <i>Lecture Notes in Computer Science</i>, 256–79. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>.","short":"O. Blazy, S. Kakvi, E. Kiltz, J. Pan, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2015, pp. 256–279.","ieee":"O. Blazy, S. Kakvi, E. Kiltz, and J. Pan, “Tightly-Secure Signatures from Chameleon Hash Functions,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2015, pp. 256–279.","apa":"Blazy, O., Kakvi, S., Kiltz, E., &#38; Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In <i>Lecture Notes in Computer Science</i> (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-46447-2_12\">https://doi.org/10.1007/978-3-662-46447-2_12</a>"},"oa":"1","place":"Berlin, Heidelberg","date_updated":"2022-01-06T06:58:47Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783662464465","9783662464472"]},"author":[{"full_name":"Blazy, Olivier","first_name":"Olivier","last_name":"Blazy"},{"full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib","id":"66268"},{"full_name":"Kiltz, Eike","first_name":"Eike","last_name":"Kiltz"},{"first_name":"Jiaxin","last_name":"Pan","full_name":"Pan, Jiaxin"}],"year":"2015","title":"Tightly-Secure Signatures from Chameleon Hash Functions","doi":"10.1007/978-3-662-46447-2_12","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2014/1021.pdf"}],"extern":"1","publication":"Lecture Notes in Computer Science","department":[{"_id":"558"}],"type":"book_chapter","date_created":"2018-05-25T12:46:08Z"},{"date_updated":"2022-01-06T06:58:47Z","publication_status":"published","author":[{"id":"66268","full_name":"Kakvi, Saqib","last_name":"Kakvi","first_name":"Saqib"},{"last_name":"Kiltz","first_name":"Eike","full_name":"Kiltz, Eike"},{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"publication_identifier":{"isbn":["9783642349607","9783642349614"],"issn":["0302-9743","1611-3349"]},"title":"Certifying RSA","status":"public","year":"2012","doi":"10.1007/978-3-642-34961-4_25","user_id":"25078","publisher":"Springer Berlin Heidelberg","_id":"2918","page":"404-414","extern":"1","citation":{"ieee":"S. Kakvi, E. Kiltz, and A. May, “Certifying RSA,” in <i>Advances in Cryptology – ASIACRYPT 2012</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 404–414.","apa":"Kakvi, S., Kiltz, E., &#38; May, A. (2012). Certifying RSA. In <i>Advances in Cryptology – ASIACRYPT 2012</i> (pp. 404–414). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_25\">https://doi.org/10.1007/978-3-642-34961-4_25</a>","short":"S. Kakvi, E. Kiltz, A. May, in: Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 404–414.","chicago":"Kakvi, Saqib, Eike Kiltz, and Alexander May. “Certifying RSA.” In <i>Advances in Cryptology – ASIACRYPT 2012</i>, 404–14. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34961-4_25\">https://doi.org/10.1007/978-3-642-34961-4_25</a>.","mla":"Kakvi, Saqib, et al. “Certifying RSA.” <i>Advances in Cryptology – ASIACRYPT 2012</i>, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_25\">10.1007/978-3-642-34961-4_25</a>.","bibtex":"@inbook{Kakvi_Kiltz_May_2012, place={Berlin, Heidelberg}, title={Certifying RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34961-4_25\">10.1007/978-3-642-34961-4_25</a>}, booktitle={Advances in Cryptology – ASIACRYPT 2012}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike and May, Alexander}, year={2012}, pages={404–414} }","ama":"Kakvi S, Kiltz E, May A. Certifying RSA. In: <i>Advances in Cryptology – ASIACRYPT 2012</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:404-414. doi:<a href=\"https://doi.org/10.1007/978-3-642-34961-4_25\">10.1007/978-3-642-34961-4_25</a>"},"publication":"Advances in Cryptology – ASIACRYPT 2012","department":[{"_id":"558"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2018-05-25T12:34:06Z"},{"publication":"Advances in Cryptology – EUROCRYPT 2012","citation":{"bibtex":"@inbook{Kakvi_Kiltz_2012, place={Berlin, Heidelberg}, title={Optimal Security Proofs for Full Domain Hash, Revisited}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>}, booktitle={Advances in Cryptology – EUROCRYPT 2012}, publisher={Springer Berlin Heidelberg}, author={Kakvi, Saqib and Kiltz, Eike}, year={2012}, pages={537–553} }","ama":"Kakvi S, Kiltz E. Optimal Security Proofs for Full Domain Hash, Revisited. In: <i>Advances in Cryptology – EUROCRYPT 2012</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:537-553. doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>","mla":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” <i>Advances in Cryptology – EUROCRYPT 2012</i>, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:<a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">10.1007/978-3-642-29011-4_32</a>.","short":"S. Kakvi, E. Kiltz, in: Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 537–553.","chicago":"Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.” In <i>Advances in Cryptology – EUROCRYPT 2012</i>, 537–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">https://doi.org/10.1007/978-3-642-29011-4_32</a>.","ieee":"S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” in <i>Advances in Cryptology – EUROCRYPT 2012</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 537–553.","apa":"Kakvi, S., &#38; Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In <i>Advances in Cryptology – EUROCRYPT 2012</i> (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-29011-4_32\">https://doi.org/10.1007/978-3-642-29011-4_32</a>"},"extern":"1","place":"Berlin, Heidelberg","date_created":"2018-05-25T12:36:44Z","type":"book_chapter","department":[{"_id":"558"}],"status":"public","title":"Optimal Security Proofs for Full Domain Hash, Revisited","year":"2012","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642290107","9783642290114"]},"author":[{"id":"66268","last_name":"Kakvi","first_name":"Saqib","full_name":"Kakvi, Saqib"},{"first_name":"Eike","last_name":"Kiltz","full_name":"Kiltz, Eike"}],"date_updated":"2022-01-06T06:58:47Z","publication_status":"published","page":"537-553","main_file_link":[{"url":"https://doi.org/10.1007/s00145-017-9257-9"}],"publisher":"Springer Berlin Heidelberg","_id":"2919","doi":"10.1007/978-3-642-29011-4_32","user_id":"66268"},{"place":"Berlin, Heidelberg","date_created":"2019-05-06T09:54:39Z","type":"book_chapter","department":[{"_id":"558"}],"publication":"Lecture Notes in Computer Science","citation":{"ama":"Kakvi S. Reinforcement Learning for Blackjack. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2009. doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>","bibtex":"@inbook{Kakvi_2009, place={Berlin, Heidelberg}, title={Reinforcement Learning for Blackjack}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>}, booktitle={Lecture Notes in Computer Science}, author={Kakvi, Saqib}, year={2009} }","mla":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” <i>Lecture Notes in Computer Science</i>, 2009, doi:<a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">10.1007/978-3-642-04052-8_43</a>.","chicago":"Kakvi, Saqib. “Reinforcement Learning for Blackjack.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2009. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>.","short":"S. Kakvi, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.","apa":"Kakvi, S. (2009). Reinforcement Learning for Blackjack. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-04052-8_43\">https://doi.org/10.1007/978-3-642-04052-8_43</a>","ieee":"S. Kakvi, “Reinforcement Learning for Blackjack,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2009."},"extern":"1","language":[{"iso":"eng"}],"_id":"9616","doi":"10.1007/978-3-642-04052-8_43","user_id":"66268","title":"Reinforcement Learning for Blackjack","year":"2009","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642040511","9783642040528"]},"author":[{"id":"66268","last_name":"Kakvi","first_name":"Saqib","full_name":"Kakvi, Saqib"}],"date_updated":"2022-01-06T07:04:17Z","publication_status":"published"}]