Ledger-based systems that support rich applications often suffer from two limitations. First,
validating a transaction requires re-executing the state transition that it attests to. Second …

Recent progress on NFS imposed a new estimation of the security of pairings. In this work
we study the best attacks against some of the most popular pairings and propose new key …

We introduce a new variant of the number field sieve algorithm for discrete logarithms in F _
p^ n called exTNFS. The most important modification is done in the polynomial selection …

Zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs) have
emerged as a valuable tool for verifiable computation and privacy preserving protocols …

In a functional encryption scheme, secret keys are associated with functions and ciphertexts
are associated with messages. Given a secret key for a function f, and a ciphertext for a …

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 …

Pairing-friendly elliptic curves in the Barreto-Lynn-Scott family are seeing a resurgence in
popularity because of the recent result of Kim and Barbulescu that improves attacks against …

We generalize the Bernstein-Yang (BY) algorithm [11] for constant-time modular inversion to
compute the Kronecker symbol, of which the Jacobi and Legendre symbols are special …

Measuring efficiency is difficult. In the last decades, several works have contributed in the
quest to successfully determine and compare the efficiency of pairing-based attribute-based …

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 …