Abstract
A deniable key exchange allows two parties to jointly share a secret key while neither of two nor an outsider can prove to a third party that the communication between the two happened. This is an important mechanism for realizing a deniably secure channel. In this paper, we propose an efficient key exchange protocol and prove its deniable security. We compare our construction with the best known protocol with the same property and show the advantages of the new construction. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Jiang, S., & Safavi-Naini, R. (2008). An efficient deniable key exchange protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5143 LNCS, pp. 47–52). https://doi.org/10.1007/978-3-540-85230-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
