A round-optimal three-party ID-based authenticated key agreement protocol
From MaRDI portal
Publication:425537
DOI10.1016/J.INS.2011.09.038zbMATH Open1239.94077OpenAlexW1977378149MaRDI QIDQ425537FDOQ425537
Authors: Kyung-Ah Shim 
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
Recommendations
- Communication-efficient three-party protocols for authentication and key agreement
- Efficient three-party authenticated key agreement protocol in certificateless cryptography
- Comparative study of tripartite identity-based authenticated key agreement protocols
- Cryptography and Coding
- An ID-based authenticated dynamic group key agreement with optimal round
- Efficient verifier-based key agreement protocol for three parties without server's public key
- scientific article
digital signatureauthenticated key agreementbilinear Diffie-Hellman problemcollusion attack algorithm with \(k\)-traitor problemidentity-based system
Cites Work
- Security proofs for signature schemes
- Identity-based cryptosystems and signature schemes
- New directions in cryptography
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Public Key Cryptography – PKC 2004
- Title not available (Why is that?)
- Reducing elliptic curve logarithms to logarithms in a finite field
- Title not available (Why is that?)
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- An improved identity-based key agreement protocol and its security proof
- Title not available (Why is that?)
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Cryptosystems based on elliptic curve pairing
- Progress in Cryptology – Mycrypt 2005
- Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
Cited In (7)
- Weakness in ID-based one round authenticated tripartite multiple-key agreement protocol with pairings
- Information Security
- Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
- An XTR-based constant round key agreement scheme
- An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes
- Simplified small exponent test for batch verification
- Secure multiparty computation of solid geometric problems and their applications
This page was built for publication: A round-optimal three-party ID-based authenticated key agreement protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q425537)
