Pseudonym generation scheme for ad-hoc group communication based on IDH

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Tree-based Group Diffie-Hellman (TGDH) protocol suite, that consists of group key agreement protocols based on IDH key trees. Furthermore, we consider the anonymity of members during group communication over a public broadcast channel that provides untraceability of messages. The main goal of the proposed pseudonym generation scheme is to allow group members to generate their own pseudonyms that can be linked to their real identities only by a democratic decision of some interacting group members. The real identities are bound to public keys used in the group key agreement. The communication and computation costs as well as the security of the scheme can be optimized with respect to the characteristics of involved mobile devices. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Manulis, M., & Schwenk, J. (2005). Pseudonym generation scheme for ad-hoc group communication based on IDH. In Lecture Notes in Computer Science (Vol. 3313, pp. 107–124). Springer Verlag. https://doi.org/10.1007/978-3-540-30496-8_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free