mOT+: An efficient and secure identity-based diffie-hellman protocol over RSA group

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In 2010, Rosario Gennaro et al. revisited the old and elegant Okamoto-Tanaka scheme and presented a variant of it called mOT. How-ever the compromise of ephemeral private key will lead to the leakage of the session key and the user’s static private key. In this paper, we propose an improved version of mOT(denoted as mOT+). Moreover, based on RSA assumption and CDH assumption we provide a tight and intuitive security reduction in the id-eCK model. Without any extra computa-tional cost, mOT+ achieves security in the id-eCK model, and further-more it also meets full perfect forward secrecy against active adversary.

Cite

CITATION STYLE

APA

Tian, B., Wei, F., & Ma, C. (2015). mOT+: An efficient and secure identity-based diffie-hellman protocol over RSA group. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9473, pp. 407–421). Springer Verlag. https://doi.org/10.1007/978-3-319-27998-5_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free