DGM: A Dynamic and Revocable Group Merkle Signature

RPVC: A Revocable Publicly Verifiable Computation Solution for Edge Computing

“…Camenisch also proposed a scheme based on an accumulator [ 18 ], but if group members frequently join or quit the group, another group member needs to update their credential in a timely manner. The same problems also occur in the scheme [ 22 , 23 ] by Yehia and Buser, furthermore, the mechanism of merkle tree makes the scale increase super-linearly with the joining or quitting of users. Brickell [ 20 ] put forward a solution based on the local revocation list, which is inspired by the work of Boneh [ 19 ]; group members do not need to update their credentials frequently.…”

“…At the same time, ref. [ 22 , 23 ] based on merkle hash tree, suggested that the storage and computational overhead vary superlinearly along with the number of users who frequently join or quit An attribute tree using secret sharing [ 24 ] and Lagrange interpolation impels the users satisfying certain attributes and can decrypt messages under the broadcast encryption [ 25 ]. The idea of subset covering or subset difference [ 26 , 27 ] in an attribute tree to reduce search time and communication cost can be used to improve revocable group signature.…”

Hash-Based Direct Anonymous Attestation

“…The security of symmetric primitives is the most well-understood and easier to evaluate, hence it serves as a safety net if the security of other approaches were endangered by newly discovered threats. Symmetric primitives have been used to build several variants of anonymous signature schemes, such as group signatures [12,33,45,52,60,61], ring signatures [36,45] and EPID [5]. However, due to the use of a single Merkle tree for membership credentials in a group, these group signature and EPID schemes can only handle a small group size, which is not suitable for TPM use.…”