default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLaila El Aimani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c11]Laila El Aimani:
Finding Low-Weight Polynomial Multiples Using the Rho Method. AFRICACRYPT 2022: 550-575- 2021
- [c10]Laila El Aimani:
A New Approach for Finding Low-Weight Polynomial Multiples. Inscrypt 2021: 151-170 - [i9]Laila El Aimani:
A New Approach for finding Low-Weight Polynomial Multiples. IACR Cryptol. ePrint Arch. 2021: 586 (2021)
2010 – 2019
- 2016
- [i8]Laila El Aimani:
The Joint Signature and Encryption Revisited. CoRR abs/1610.09503 (2016) - 2013
- [c9]Laila El Aimani, Marc Joye:
Toward Practical Group Encryption. ACNS 2013: 237-252 - 2012
- [c8]Laila El Aimani, Olivier Sanders:
Efficient Group Signatures in the Standard Model. ICISC 2012: 410-424 - [i7]Laila El Aimani, Marc Joye:
Toward Practical Group Encryption. IACR Cryptol. ePrint Arch. 2012: 155 (2012) - [i6]Laila El Aimani, Olivier Sanders:
Efficient Group Signatures in the Standard Model. IACR Cryptol. ePrint Arch. 2012: 627 (2012) - 2011
- [b1]Laila El Aimani:
Design and Analysis of Opaque Signatures. University of Bonn, 2011, pp. 1-200 - [c7]Laila El Aimani:
Generic Constructions for Verifiable Signcryption. ICISC 2011: 204-218 - [i5]Laila El Aimani:
Generic Constructions for Verifiable Signcryption. IACR Cryptol. ePrint Arch. 2011: 592 (2011) - 2010
- [c6]Laila El Aimani, Yona Raekow:
Reselling Digital Content. ARES 2010: 391-396 - [c5]Laila El Aimani:
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm. ProvSec 2010: 87-101
2000 – 2009
- 2009
- [c4]Laila El Aimani:
Anonymity from Public Key Encryption to Undeniable Signatures. AFRICACRYPT 2009: 217-234 - [c3]Laila El Aimani:
On Generic Constructions of Designated Confirmer Signatures. INDOCRYPT 2009: 343-362 - [i4]Laila El Aimani:
Toward a Generic Construction of Convertible Undeniable Signatures from Pairing-Based Signatures. IACR Cryptol. ePrint Arch. 2009: 362 (2009) - [i3]Laila El Aimani:
On Generic Constructions of Designated Confirmer Signatures (The "Encryption of a Signature" Paradigm Revisited). IACR Cryptol. ePrint Arch. 2009: 403 (2009) - [i2]Laila El Aimani:
Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm. IACR Cryptol. ePrint Arch. 2009: 435 (2009) - 2008
- [c2]Laila El Aimani:
Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures. INDOCRYPT 2008: 145-157 - 2007
- [c1]Laila El Aimani, Damien Vergnaud:
Gradually Convertible Undeniable Signatures. ACNS 2007: 478-496 - [i1]Laila El Aimani, Joachim von zur Gathen:
Finding Low Weight Polynomial Multiples Using Lattices. IACR Cryptol. ePrint Arch. 2007: 423 (2007)
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-04-25 05:52 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:
