Gradually Convertible Undeniable Signatures. - Laila El Aimani; Damien Vergnaud (ACNS, 2007)

Finding Low Weight Polynomial Multiples Using Lattices. - Laila El Aimani; Joachim von zur Gathen (IACR Cryptol. ePrint Arch., 2007)

Toward a Generic Construction of Universally Convertible Undeniable Signatures from Pairing-Based Signatures. - Laila El Aimani (INDOCRYPT, 2008)

Anonymity from Public Key Encryption to Undeniable Signatures. - Laila El Aimani (AFRICACRYPT, 2009)

On Generic Constructions of Designated Confirmer Signatures. - Laila El Aimani (INDOCRYPT, 2009)

Toward a Generic Construction of Convertible Undeniable Signatures from Pairing-Based Signatures. - Laila El Aimani (IACR Cryptol. ePrint Arch., 2009)

On Generic Constructions of Designated Confirmer Signatures (The "Encryption of a Signature" Paradigm Revisited). - Laila El Aimani (IACR Cryptol. ePrint Arch., 2009)

Efficient Confirmer Signatures from the "Signature of a Commitment" Paradigm. - Laila El Aimani (IACR Cryptol. ePrint Arch., 2009)

Reselling Digital Content. - Laila El Aimani; Yona Raekow (ARES, 2010)

Generic Constructions for Verifiable Signcryption. - Laila El Aimani (IACR Cryptol. ePrint Arch., 2011)

Design and Analysis of Opaque Signatures. - Laila El Aimani (2011)

Toward Practical Group Encryption. - Laila El Aimani; Marc Joye (IACR Cryptol. ePrint Arch., 2012)

Efficient Group Signatures in the Standard Model. - Laila El Aimani; Olivier Sanders (IACR Cryptol. ePrint Arch., 2012)

The Joint Signature and Encryption Revisited. - Laila El Aimani (CoRR, 2016)

A New Approach for finding Low-Weight Polynomial Multiples. - Laila El Aimani (IACR Cryptol. ePrint Arch., 2021)

Finding Low-Weight Polynomial Multiples Using the Rho Method. - Laila El Aimani (AFRICACRYPT, 2022)