Asymmetric pairings e: G 1× G 2→ GT for which an efficiently-computable isomorphism ψ: G
2→ G 1 is known are called Type 2 pairings; if such an isomorphism ψ is not known then e is …

Blind signatures are a fundamental tool for privacy-preserving applications. Known
constructions of concurrently secure blind signature schemes either are prohibitively …

Users of social applications like to be notified when their friends are online. Typically, this is
done by a central server keeping track of who is online and offline, as well as of all of the …

As self-organizing, highly heterogeneous and multi-interactive networks, vehicular ad-hoc
networks (VANETs) are rapidly improving the efficiency of modern traffic. This promising …

Pairings are typically implemented using ordinary pairing-friendly elliptic curves. The two
input groups of the pairing function are groups of elliptic curve points, while the target group …

A ciphertext-policy attribute-based encryption protocol uses bilinear pairings to provide
control access mechanisms, where the set of user's attributes is specified by means of a …

Various sources have revealed that cryptographic standards and components have been
subverted to undermine the security of users, reigniting research on means to achieve …

We propose a method to convert schemes designed over symmetric bilinear groups into
schemes over asymmetric bilinear groups. The conversion assigns variables to one or both …

Sequential aggregate signature schemes allow n signers, in order, to sign a message each,
at a lower total cost than the cost of n individual signatures. We present a sequential …

We focus on the implementation and security aspects of cryptographic protocols that use
Type 1 and Type 4 pairings. On the implementation front, we report improved timings for …