(Not Surprising) Attacks on Recent Pairing‐Free Attribute‐Based Encryption Schemes

The fact that designing secure and efficient identity or attribute‐based encryption (ABE) schemes requires the use of specific algebraic tools like bilinear pairings or lattices is well known in the cryptographic community. However, some journals whose main topics are not cryptographic still publish papers proposing, for instance, ABE schemes in settings like the (pairing‐free) discrete logarithm one. The goal of this submission is to emphasize, once again, the statements in the two previous paragraphs. As an illustration, we describe attacks on five insecure schemes that have recently been published in (prestigious) journals.