default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSaqib A. Kakvi
Person information
- affiliation: Royal Holloway, University of London, UK
- affiliation (former): University of Wuppertal, Germany
- affiliation (former): University of Paderborn, Germany
- affiliation (former): University of Bristol, UK
- affiliation (former): Ruhr University Bochum, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Saqib A. Kakvi
, Keith M. Martin, Colin Putman, Elizabeth A. Quaglia:
SoK: Anonymous Credentials. SSR 2023: 129-151- 2022
- [c10]Olivier Blazy, Saqib A. Kakvi:
Identity-Based Encryption in DDH Hard Groups. AFRICACRYPT 2022: 81-102 - 2020
- [c9]Peter Chvojka, Tibor Jager, Saqib A. Kakvi:
Offline Witness Encryption with Semi-adaptive Security. ACNS (1) 2020: 231-250 - [c8]Olivier Blazy, Saqib A. Kakvi:
Skipping the q in Group Signatures. INDOCRYPT 2020: 553-575 - [c7]Saqib A. Kakvi:
SoK: Comparison of the Security of Real World RSA Hash-and-Sign Signatures. SSR 2020: 91-113
2010 – 2019
- 2019
- [c6]Saqib A. Kakvi:
On the Security of RSA-PSS in the Wild. SSR 2019: 23-34 - [i6]Saqib A. Kakvi:
On the Security of RSA-PSS in the Wild. IACR Cryptol. ePrint Arch. 2019: 1268 (2019) - [i5]Peter Chvojka, Tibor Jager, Saqib A. Kakvi:
Offline Witness Encryption with Semi-Adaptive Security. IACR Cryptol. ePrint Arch. 2019: 1337 (2019) - 2018
- [j2]Jia Liu, Tibor Jager, Saqib A. Kakvi, Bogdan Warinschi:
How to build time-lock encryption. Des. Codes Cryptogr. 86(11): 2549-2586 (2018) - [j1]Saqib A. Kakvi, Eike Kiltz:
Optimal Security Proofs for Full Domain Hash, Revisited. J. Cryptol. 31(1): 276-306 (2018) - [c5]Tibor Jager, Saqib A. Kakvi, Alexander May:
On the Security of the PKCS#1 v1.5 Signature Scheme. CCS 2018: 1195-1208 - [i4]Tibor Jager, Saqib A. Kakvi, Alexander May:
On the Security of the PKCS#1 v1.5 Signature Scheme. IACR Cryptol. ePrint Arch. 2018: 855 (2018) - 2015
- [b1]Saqib A. Kakvi:
On the improvement of security proofs. Ruhr University Bochum, 2015 - [c4]Olivier Blazy, Saqib A. Kakvi, Eike Kiltz, Jiaxin Pan:
Tightly-Secure Signatures from Chameleon Hash Functions. Public Key Cryptography 2015: 256-279 - [i3]Jia Liu, Saqib A. Kakvi, Bogdan Warinschi:
Extractable Witness Encryption and Timed-Release Encryption from Bitcoin. IACR Cryptol. ePrint Arch. 2015: 482 (2015) - [i2]Olivier Blazy, Saqib A. Kakvi:
Group Signatures Without q-Assumptions. IACR Cryptol. ePrint Arch. 2015: 858 (2015) - 2014
- [i1]Olivier Blazy, Saqib A. Kakvi, Eike Kiltz, Jiaxin Pan:
Tightly-Secure Signatures from Chameleon Hash Functions. IACR Cryptol. ePrint Arch. 2014: 1021 (2014) - 2012
- [c3]Saqib A. Kakvi, Eike Kiltz, Alexander May:
Certifying RSA. ASIACRYPT 2012: 404-414 - [c2]Saqib A. Kakvi, Eike Kiltz:
Optimal Security Proofs for Full Domain Hash, Revisited. EUROCRYPT 2012: 537-553
2000 – 2009
- 2009
- [c1]Saqib A. Kakvi:
Reinforcement Learning for Blackjack. ICEC 2009: 300-301
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 00:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
