Unification Modulo Homomorphic Encryption

DOI10.1007/978-3-642-04222-5_6zbMath1193.68231OpenAlexW1524919255WikidataQ118190442 ScholiaQ118190442MaRDI QIDQ3655194

Siva Anantharaman, Christopher Lynch, Michaël Rusinowitch, Paliath Narendran, Hai Lin

Publication date: 7 January 2010

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04222-5_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Unification modulo homomorphic encryption ⋮ Bounded ACh unification

Cites Work

• Intruder deduction for the equational theory of abelian groups with distributive encryption
• Unification problems with one-sided distributivity
• A practical secret voting scheme for large scale elections
• On the unification problem for Cartesian closed categories
• The complexity of satisfiability problems
• Intruders with Caps

This page was built for publication: Unification Modulo Homomorphic Encryption