Unification Modulo Homomorphic Encryption - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Unification Modulo Homomorphic Encryption

Résumé

Encryption ‘distributing over pairs' is a technique employed in several cryptographic protocols. We show that unification is decidable for an equational theory HE specifying such an encryption. The method consists in transforming any given problem in such a way, that the resulting problem can be solved by combining a graph-based reasoning on its equations involving the homomorphisms, with a syntactic reasoning on its pairings. We show HE-unification to be NP-hard and in NEXPTIME.

Dates et versions

inria-00426798 , version 1 (28-10-2009)

Identifiants

Citer

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch. Unification Modulo Homomorphic Encryption. 7th International Symposium on Frontiers of Combining Systems - FroCoS 2009, Sep 2009, Trento, Italy. pp.100-116, ⟨10.1007/978-3-642-04222-5_6⟩. ⟨inria-00426798⟩
123 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More