Unification Modulo Homomorphic Encryption

Siva Anantharaman 1 Hai Lin Christopher Lynch Paliath Narendran 2 Michael Rusinowitch 3
3 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00426798
Contributor : Michaël Rusinowitch <>
Submitted on : Wednesday, October 28, 2009 - 8:43:42 AM
Last modification on : Thursday, June 27, 2019 - 1:24:46 AM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

319