Common Contracts

2 similar null contracts

AutoNDA by SimpleDocs
Key agreement based on homomorphisms of algebraic structures
April 21st, 2011
  • Filed
    April 21st, 2011

We give a generalization of the Diffie-Hellman key agreement scheme that is based on the hardness of computing homomorphic images from an alge- bra 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.

Time is Money Join Law Insider Premium to draft better contracts faster.