Paper 2011/203 Original: eprint.iacr.org/2011/203 ↗

Key agreement based on homomorphisms of algebraic structures

Juha Partala
Abstract

We give a generalization of the Diffie-Hellman key agreement scheme that is based on the hardness of computing homomorphic images from an algebra to another. We formulate computational and decision versions of the homomorphic image problem and devise a key agreement protocol that is secure in the Canetti-Krawczyk model under the decision homomorphic image assumption. We also give an instantiation of the protocol using an additively homomorphic symmetric encryption scheme of Armknecht and Sadeghi. We prove that the instantiation is secure under the assumption that the encryption scheme is IND-CPA secure.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2011-04-25: last updated
2011-04-25: published
Short URL
https://ia.cr/2011/203
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2011/203,
      author = {Juha Partala},
      title = {Key agreement based on homomorphisms of algebraic structures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/203},
      year = {2011},
      url = {https://eprint.iacr.org/2011/203}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.