Saqib Kakvi

IT-Sicherheit (bis 2019)
saqib.kakvi@uni-paderborn.de
ID
66268

7 Publications

Mark all

[7]
2018 | Journal Article | LibreCat-ID: 9606
J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” Designs, Codes and Cryptography, pp. 2549–2586, 2018.
LibreCat | DOI
 
[6]
2018 | Conference Paper | LibreCat-ID: 5442
T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, 2018.
LibreCat | Files available | DOI | Download (ext.)
 
[5]
2017 | Journal Article | LibreCat-ID: 9607
S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.
LibreCat | DOI | Download (ext.)
 
[4]
2015 | Book Chapter | LibreCat-ID: 2921 | OA
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 | DOI | Download (ext.)
 
[3]
2012 | Book Chapter | LibreCat-ID: 2918
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 | DOI
 
[2]
2012 | Book Chapter | LibreCat-ID: 2919
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 | DOI | Download (ext.)
 
[1]
2009 | Book Chapter | LibreCat-ID: 9616
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

7 Publications

Mark all

[7]
2018 | Journal Article | LibreCat-ID: 9606
J. Liu, T. Jager, S. Kakvi, and B. Warinschi, “How to build time-lock encryption,” Designs, Codes and Cryptography, pp. 2549–2586, 2018.
LibreCat | DOI
 
[6]
2018 | Conference Paper | LibreCat-ID: 5442
T. Jager, S. Kakvi, and A. May, “On the Security of the PKCS#1 v1.5 Signature Scheme,” in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security  - CCS ’18, 2018.
LibreCat | Files available | DOI | Download (ext.)
 
[5]
2017 | Journal Article | LibreCat-ID: 9607
S. Kakvi and E. Kiltz, “Optimal Security Proofs for Full Domain Hash, Revisited,” Journal of Cryptology, pp. 276–306, 2017.
LibreCat | DOI | Download (ext.)
 
[4]
2015 | Book Chapter | LibreCat-ID: 2921 | OA
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 | DOI | Download (ext.)
 
[3]
2012 | Book Chapter | LibreCat-ID: 2918
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 | DOI
 
[2]
2012 | Book Chapter | LibreCat-ID: 2919
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 | DOI | Download (ext.)
 
[1]
2009 | Book Chapter | LibreCat-ID: 9616
S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.
LibreCat | DOI
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed