Digital signature is a fundamental primitive with numerous applications. Following the
development of pairing-based cryptography, several taking advantage of this setting have …

In the past two years there have been several advances in Number Field Sieve (NFS)
algorithms for computing discrete logarithms in finite fields\mathbb F _ p^ n where p is prime …

Recently many pairing-based cryptographic protocols have been designed with a wide
variety of new novel applications including the ones in the emerging technologies like cloud …

We construct both randomizable and strongly existentially unforgeable structure-preserving
signatures for messages consisting of many group elements. To sign a message consisting …

Attribute-based encryption (ABE) is a cryptographic primitive which supports fine-grained
access control on encrypted data, making it an appealing building block for many …

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 …

Pairings are a powerful tool to build advanced cryptographic schemes. The most efficient
way to instantiate a pairing scheme is through Pairing-Friendly Elliptic Curves. Because a …

Recent work on structure‐preserving signatures (SPS) studies optimality of these schemes
in terms of the number of group elements needed in the verification key and the signature …

We investigate structure-preserving signatures in asymmetric bilinear groups with an
efficiently computable homomorphism from one source group to the other, ie, the Type II …

We construct a new structure-preserving signature scheme in the efficient Type-III
asymmetric bilinear group setting with signatures shorter than all existing schemes. Our …