A round-optimal three-party ID-based authenticated key agreement protocol

DOI10.1016/J.INS.2011.09.038MaRDI QIDQ425537zbMATHOpenAlexFDO

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

zbMATH Keywords

digital signatureauthenticated key agreementbilinear Diffie-Hellman problemcollusion attack algorithm with \(k\)-traitor problemidentity-based system

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

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; zbMATH DE number 6719494

Cites work

• scientific article; zbMATH DE number 1643939 (Why is no real title available?)
• scientific article; zbMATH DE number 1304129 (Why is no real title available?)
• scientific article; zbMATH DE number 1341873 (Why is no real title available?)
• scientific article; zbMATH DE number 1024060 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Advances in Cryptology - EUROCRYPT 2004
• An improved identity-based key agreement protocol and its security proof
• Cryptanalysis of tripartite and multi-party authenticated key agreement protocols
• Cryptosystems based on elliptic curve pairing
• Identity-based cryptosystems and signature schemes
• New directions in cryptography
• Progress in Cryptology – Mycrypt 2005
• Public Key Cryptography – PKC 2004
• Reducing elliptic curve logarithms to logarithms in a finite field
• Security proofs for signature schemes
• Topics in Cryptology – CT-RSA 2005

Cited in

(7)

• Computationally sound symbolic security reduction analysis of the group key exchange protocols using bilinear pairings
• Weakness in ID-based one round authenticated tripartite multiple-key agreement protocol with pairings
• Simplified small exponent test for batch verification
• Secure multiparty computation of solid geometric problems and their applications
• An ID-based key sharing scheme based on discrete logarithm problem over a product of three primes
• An XTR-based constant round key agreement scheme
• Information Security

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)