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 propose a generalization of exTNFS algorithm recently introduced by Kim and
Barbulescu (CRYPTO 2016). The algorithm, exTNFS, is a state-of-the-art algorithm for …

Recent algorithmic improvements of discrete logarithm computation in special extension
fields threaten the security of pairing-friendly curves used in practice. A possible answer to …

In this paper, we provide a notable step towards filling the gap between theory (estimates of
running-time) and practice (a discrete logarithm record computation) for the Tower Number …

Chu et al.(ASIACCS 2012) proposed group signature with time-bound keys (GS-TBK),
where each signing key is associated with expiry time τ. In addition, to prove membership of …

We construct an efficient two-level homomorphic public-key encryption in prime-order
bilinear groups. Such a scheme supports polynomially many homomorphic additions and …

Despite of having many revocable group signatures schemes proposed in recent years,
backward security, which prevents a revoked signer from generating group signatures for …

The final exponentiation, which is the exponentiation by a fixed large exponent, must be
performed in the Tate and (optimal) Ate pairing computation to ensure output uniqueness …

We study the discrete logarithm problem at the boundary case between small and medium
characteristic finite fields, which is precisely the area where finite fields used in pairing …