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