Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
From MaRDI portal
Recommendations
Cited in
(14)- Resource-aware protocols for authenticated group key exchange in integrated wired and wireless networks
- T-robust scalable group key exchange protocol with O( n) complexity
- Flexible group key exchange with on-demand computation of subgroup keys
- Generic one round group key exchange in the standard model
- Revisiting Pairing Based Group Key Exchange
- An XTR-based constant round key agreement scheme
- Post-Quantum Constant-Round Group Key Exchange from Static Assumptions
- Comments on "Provably Secure Constant Round Contributory Group Key Agreement in Dynamic Setting
- Advances in Cryptology - CRYPTO 2003
- Scalable Authenticated Tree Based Group Key Exchange for Ad-Hoc Groups
- Constant-Round Authenticated Group Key Exchange for Dynamic Groups
- Public Key Cryptography - PKC 2006
- Public Key Cryptography – PKC 2004
- Scalable protocols for authenticated group key exchange
This page was built for publication: Constant-Round Authenticated Group Key Exchange with Logarithmic Computation Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612379)