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, 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.
Type de document :
Communication dans un congrès
Silvio Ghilardi and Roberto Sebastiani. 7th International Symposium on Frontiers of Combining Systems - FroCoS 2009, Sep 2009, Trento, Italy. Springer, 5749, pp.100-116, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-04222-5_6〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00426798
Contributeur : Michaël Rusinowitch <>
Soumis le : mercredi 28 octobre 2009 - 08:43:42
Dernière modification le : jeudi 11 janvier 2018 - 06:20:00

Identifiants

Citation

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch. Unification Modulo Homomorphic Encryption. Silvio Ghilardi and Roberto Sebastiani. 7th International Symposium on Frontiers of Combining Systems - FroCoS 2009, Sep 2009, Trento, Italy. Springer, 5749, pp.100-116, 2009, Lecture Notes in Computer Science. 〈10.1007/978-3-642-04222-5_6〉. 〈inria-00426798〉

Partager

Métriques

Consultations de la notice

250