Related Experiment Video
Updated: Apr 27, 2026

The Collective Trust Game: An Online Group Adaptation of the Trust Game Based on the HoneyComb Paradigm
Published on: October 20, 2022
A provably secure revocable ID-based authenticated group key exchange protocol with identifying malicious
Tsu-Yang Wu1, Tung-Tso Tsai2, Yuh-Min Tseng2
1Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055, China ; Shenzhen Key Laboratory of Internet Information Collaboration, Shenzhen 518055, China.
Abstract:
The existence of malicious participants is a major threat for authenticated group key exchange (AGKE) protocols. Typically, there are two detecting ways (passive and active) to resist malicious participants in AGKE protocols. In 2012, the revocable identity- (ID-) based public key system (R-IDPKS) was proposed to solve the revocation problem in the ID-based public key system (IDPKS). Afterwards, based on the R-IDPKS, Wu et al. proposed a revocable ID-based AGKE (RID-AGKE) protocol, which adopted a passive detecting way to resist malicious participants. However, it needs three rounds and cannot identify malicious participants. In this paper, we fuse a noninteractive confirmed computation technique to propose the first two-round RID-AGKE protocol with identifying malicious participants, which is an active detecting way. We demonstrate that our protocol is a provably secure AGKE protocol with forward secrecy and can identify malicious participants. When compared with the recently proposed ID/RID-AGKE protocols, our protocol possesses better performance and more robust security properties.
Related Concept Videos
Role-Based Identity
Protecting Groups for Aldehydes and Ketones: Introduction
Second Uniqueness Theorem
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
Impact of Groups on Groups
Norton's Theorem
Net Change Theorem