 |
|
|
|
| HAL: inria-00426798, version 1 |
| DOI: 10.1007/978-3-642-04222-5_6 |
| See detailed view |  BibTeX,EndNote,... |
|
|
| 7th International Symposium on Frontiers of Combining Systems - FroCoS 2009, Trento : Italie (2009) |
|
|
|
|
| Unification Modulo Homomorphic Encryption |
|
|
| Siva Anantharaman 1Hai Lin |
|
|
| (2009) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
| 2: | University at Albany |
|
|
|
State university of New York |
|
|
| 3: | CASSIS (INRIA Lorraine - LORIA / LIFC) |
|
|
|
INRIA – CNRS : UMR7503 – CNRS : FRE2661 – Université de Franche-Comté – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine |
|
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Logic in Computer Science |
| inria-00426798, version 1 | |
| http://hal.inria.fr/inria-00426798 | |
| oai:hal.inria.fr:inria-00426798 | |
| From: Michael Rusinowitch | |
| Submitted on: Wednesday, 28 October 2009 08:43:42 | |
| Updated on: Monday, 9 November 2009 16:15:27 | |
