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 problem of securely outsourcing the computation of a bilinear pairing has been widely
investigated in the literature. Designing an efficient protocol with the desired functionality …

Several fault attacks against pairing-based cryptography have been described theoretically
in recent years. Interestingly, none of these has been practically evaluated. We accomplish …

Public-key encryption with keyword search (PEKS) schemes enable public key holders to
encrypt documents, while the secret key holder is able to generate queries for the encrypted …

Zk-SNARKs (succinct non-interactive zero-knowledge arguments of knowledge) are needed
in many applications. Unfortunately, all previous zk-SNARKs for interesting languages are …

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

We propose a novel approach that generalizes interleaved modular multiplication
algorithms for the computation of sums of products over large prime fields. This operation …

We propose a new random oracle-less NIZK shuffle argument. It has a simple structure,
where the first verification equation ascertains that the prover has committed to a …

With the recent advances in mobile technologies, biometric verification is being adopted in
many smart devices as a means for authenticating their owners. As biometric data leakage …

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 …