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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bansal, N., Liu, Z.: Capacity, delay and mobility in wireless ad-hoc networks. In: Infocom 2003. IEEE, Los Alamitos (2003)
Becker, C., Wille, U.: Communication complexity of group key distribution. In: ACM Conference on Computer and Communications Security. ACM Press, NY (1998)
Burmester, M., Desmedt, Y.: A secure and efficient conference key distribution system. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 275–286. Springer, Heidelberg (1995)
Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups (extended abstract). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 410–424. Springer, Heidelberg (1997)
Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: ACM Conference on Computer and Communications Security 2000, pp. 235–244. ACM Press, NY (2000)
Kim, Y., Perrig, A., Tsudik, G.: Communication-efficient group key agreement. In: Information Systems Security, Proc. of the 17th International Information Security Conference, IFIP SEC 2001 (2001)
Kim, Y., Perrig, A., Tsudik, G.: Tree-based group key agreement. ACM Transactions on Information and System Security 7(1), 60–96 (2004)
Steiner, M., Tsudik, G., Waidner, M.: Key agreement in dynamic peer groups. IEEE Transactions on Parallel and Distributed Systems 11(8) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manulis, M., Schwenk, J. (2005). Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH. In: Castelluccia, C., Hartenstein, H., Paar, C., Westhoff, D. (eds) Security in Ad-hoc and Sensor Networks. ESAS 2004. Lecture Notes in Computer Science, vol 3313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30496-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30496-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24396-0
Online ISBN: 978-3-540-30496-8
eBook Packages: Computer ScienceComputer Science (R0)