Threshold ECDSA receives interest lately due to its widespread adoption in blockchain
applications. A common building block of all leading constructions involves a secure …

In many applications, it is important to verify that an RSA public key (N, e) specifies a
permutation over the entire space Z _N, in order to prevent attacks due to adversarially …

This work investigates zero-knowledge protocols in subverted RSA groups where the prover
can choose the modulus and where the verifier does not know the group order. We …

Non-interactive zero-knowledge (NIZK) proof systems are very useful for statement
verification without interaction in cryptography; they entail just one message, called the …

We revisit the problem of proving that a user algorithm selected and correctly used a truly
random seed in the generation of her cryptographic key. A first approach was proposed in …

This paper describes a non-interactive process allowing a prover to convince a verifier that a
modulus n is the product of two primes (p, q) of about the same size. A further heuristic …

In a recent paper Géraud-Stewart and Naccache\cite {gsn2021}(GSN) described an non-
interactive process allowing a prover $\mathcal P $ to convince a verifier $\mathcal V $ that …

This manuscript proposes new cryptographic protocols that are respectful of users' privacy
and which have real-world applications. In a first part, the focus is on group signatures, a …