Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Dynamic Group Diffie-Hellman Key Exchange under Standard Assumptions
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
A three round authenticated group key agreement protocol for ad hoc networks
Pervasive and Mobile Computing
Constant-Round Password-Based Authenticated Key Exchange Protocol for Dynamic Groups
Financial Cryptography and Data Security
Efficient Hybrid Password-Based Authenticated Group Key Exchange
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Secure and Efficient Group Key Agreements for Cluster Based Networks
Transactions on Computational Science IV
On security models and compilers for group key exchange protocols
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
DLPKH - distributed logical public-key hierarchy
ICISS'07 Proceedings of the 3rd international conference on Information systems security
Dynamic asymmetric group key agreement for ad hoc networks
Ad Hoc Networks
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Constant round dynamic group key agreement
ISC'05 Proceedings of the 8th international conference on Information Security
| Hi-index | 0.00 |
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We prove that our protocol is provably secure in the standard security model of Bresson et al. An appropriate modification of Katz-Yung approach to tree based setting is adopted while proving its security against active adversaries. The protocol has an in-built hierarchical structure that makes it desirable for certain applications.