Download Now Free registration required
Usually a communication link is secured by means of a symmetric-key algorithm. For that, a method is required to securely establish a symmetric-key for that algorithm. This old key establishment problem is still relevant and of paramount importance both in existing computer networks and new large-scale ubiquitous systems comprising resource-constrained devices. Identity-based pair-wise key agreement allows for the generation of a common key between two parties given a secret keying material owned by the first party and the identity of the second one. However, existing methods, e.g., based on polynomials, are prone to collusion attacks.
- Format: PDF
- Size: 290 KB