Hidden Vector Encryption in prime order fields

In this paper two new posibilities for implementing HVE in prime order fields are presented. These are focused on hiding the identity from the decryption entity in predicate encryption. The first advantage is that the decryption key and ciphertext are flattered. Another advantage is that these require implementation of elliptic curves over prime order field which improve the computation speed over composite ones. The main application of these new algorithms is in the automatic mail distribution field.