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

Authors:
Mark Manulis;Jörg Schwenk
Affiliations:
Network and Data Security Group, Department of Electrical Engineering & Information Sciences, IC 4/158, Ruhr-Universität, Bochum, Germany;Network and Data Security Group, Department of Electrical Engineering & Information Sciences, IC 4/158, Ruhr-Universität, Bochum, Germany
Venue:
ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Year:
2004

Citing 6
Cited 1

Communication complexity of group key distribution

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Simple and fault-tolerant key agreement for dynamic collaborative groups

Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups

IEEE Transactions on Parallel and Distributed Systems
Efficient Group Signature Schemes for Large Groups (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Communication-Efficient Group Key Agreement

IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge
Tree-based group key agreement

ACM Transactions on Information and System Security (TISSEC)

Decentralized generation of multiple, uncorrelatable pseudonyms without trusted third parties

TrustBus'11 Proceedings of the 8th international conference on Trust, privacy and security in digital business

Quantified Score

Hi-index	0.00

Visualization

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.