Elliptic curves have become key ingredients for instantiating zero-knowledge proofs and
more generally proof systems. Recently, there have been many tailored constructions of …

Abstract At CANS'20, El Housni and Guillevic introduced a new 2-chain of pairing-friendly
elliptic curves for recursive zero-knowledge Succinct Non-interactive ARguments of …

The arithmetic of computing multiple scalar multiplications in an elliptic curve group then
adding them together is called multi-scalar multiplication (MSM). MSM over fixed points …

There have been notable improvements in discrete logarithm computations in finite fields
since 2015 and the introduction of the Tower Number Field Sieve algorithm (TNFS) for …

A zero-knowledge proof is a method by which one can prove knowledge of general non-
deterministic polynomial (NP) statements. SNARKs are in addition non-interactive, short and …

Abstract The Internet of Things (IoT) has brought a new era of interconnected devices and
seamless data exchange. As the IoT ecosystem continues to expand, there is an increasing …

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 …

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 …

Pairing-friendly curves with odd prime embedding degrees at the 128-bit security level, such
as BW13-310 and BW19-286, sparked interest in the field of public-key cryptography as …

Despite the latest efforts to foster the adoption of privacy-enhancing Attribute-Based
Credential (p-ABC) systems in electronic services, those systems are not yet broadly …