Identity based encryption schemes [*] seem to have great potential in high-latency Delay-Tolerant and mobile, ad-hoc networks since they apparently seem to avoid the need for key negotiation and exchanges. Used soley for key exchange, they allow any pair of members in the same group (however you choose to define it) to establish a unique pairwise secret that can be computed by each member up-front and as a function of their respective identities.

However, since each pairing based scheme - that I'm aware of - is predicated on a pre-distribution of some shared secret (e.g., the hashed ID of the agent raised to some secret integer), do any of these schemes offer any significant advantages over, let's say, a simple authenticated diffie-hellman (at least for purposes of symmetric key establishment)?

[*] Including pairing-based symmetric-key establishment schemes.

Identity-based encryption schemes[*] seem to have great potential in high-latency, delay-tolerant and mobile, ad-hoc networks since they apparently seem to avoid the need for key negotiation and exchanges. Used solely for key exchange, they allow any pair of members in the same group (however you choose to define it) to establish a unique pairwise secret that can be computed by each member up-front and as a function of their respective identities.

However, since each pairing based scheme - that I'm aware of - is predicated on a pre-distribution of some shared secret (e.g., the hashed ID of the agent raised to some secret integer), do any of these schemes offer any significant advantages over, let's say, a simple authenticated Diffie-Hellman (at least for purposes of symmetric key establishment)?

[*] Including pairing-based symmetric-key establishment schemes.