A round-optimal three-party ID-based authenticated key agreement protocol
From MaRDI portal
Publication:425537
DOI10.1016/J.INS.2011.09.038zbMath1239.94077OpenAlexW1977378149MaRDI QIDQ425537
Publication date: 8 June 2012
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2011.09.038
digital signatureauthenticated key agreementbilinear Diffie-Hellman problemcollusion attack algorithm with \(k\)-traitor problemidentity-based system
Related Items (4)
An XTR-based constant round key agreement scheme ⋮ Simplified small exponent test for batch verification ⋮ Secure multiparty computation of solid geometric problems and their applications ⋮ Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
- An improved identity-based key agreement protocol and its security proof
- Security Proofs for Signature Schemes
- Identity-Based Cryptosystems and Signature Schemes
- New directions in cryptography
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Reducing elliptic curve logarithms to logarithms in a finite field
- Advances in Cryptology - EUROCRYPT 2004
- Progress in Cryptology – Mycrypt 2005
- Topics in Cryptology – CT-RSA 2005
- Public Key Cryptography – PKC 2004
This page was built for publication: A round-optimal three-party ID-based authenticated key agreement protocol
