Search Results for:

In this paper, we analyze proofs based on the partitioning technique through a new lens.

In this work we prove lower bounds on the (communication) cost of maintaining a shared key among a dynamic group of users. Being "dynamic'' means one can add and remove users from the group.

We construct an efficient dynamic group signature (or more generally an accountable ring signature) from isogeny and lattice assumptions.