Group Signature without Random Oracles from Randomizable Signatures

Contrary to the latter ap- proach, in this article, we remove the bilinear map from Boneh-Boyen signatures to obtain the first efficient undeniable signature scheme without

In order to have all the elements needed to give a technical overview of our scheme, we start by describing three existing constructions: the group signa- ture scheme of [KY19], the

to allow signature holders to monitor the verification of a given signature in the sense that any plain signature can be publicly turned into a signature which is only verifiable

Despite the above advances, and irrespective of the restrictions imposed on sources, the UCE framework is intrinsically limited in a number of aspects: it only allows the source

This is however not the case in the scheme proposed in [HT07]: the final signature is a proof of knowledge of some values computed by the issuer made non-interactive by the

We formulate and study the security of cryptographic hash functions in the backdoored random-oracle (BRO) model, whereby a big brother designs a “good” hash function, but can also

On the positive side, we show that when considering signature schemes with appropriate restrictions on the message length O-SNARKs for the corresponding signing oracles exist, based

On the spectral radius of a random matrix: an upper bound without fourth moment.. Charles Bordenave, Pietro Caputo, Djalil Chafaï,