We present a secure unauthenticated as well as an authenticated multi party key agreement protocol. The unauthenticated version of our protocol uses ternary trees and is based on bilinear maps and Joux's three party protocol. The number of rounds, computation/communication complexity of our protocol compares favourably with previously known protocols. The authenticated version of our protocol also uses ternary trees and is based on public IDs and Key Generation Centres. The authenticated version of our protocol is more efficient than all previously known authenticated key agreement protocols. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Barua, R., Dutta, R., & Sarkar, P. (2003). Extending Joux’s protocol to multi party key agreement: (Extended abstract). Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2904, 205–217. https://doi.org/10.1007/978-3-540-24582-7_15
Mendeley helps you to discover research relevant for your work.