Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round

DOI10.1007/978-3-642-41227-1_3zbMath1319.94095OpenAlexW94237871MaRDI QIDQ2856155

Layamrudhaa Renganathan Venkatesan, C. Pandu Rangan, S. Sree Vivek, S. Sharmila Deva Selvi

Publication date: 23 October 2013

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-41227-1_3

zbMATH Keywords

provable securitytight reductionrandom oracle modelforward secrecyreflection attacksgeneral forking lemmaidentity based key agreementkey compromise impersonation attacks

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

Strongly secure identity-based authenticated key agreement protocols without bilinear pairings

This page was built for publication: Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round