Efficient general AGH-unification

General E-unification is an important tool in cryptographic protocol analysis, where the equational theory E represents properties of the cryptographic algorithm, and uninterpreted function symbols represent other functions. The property of a homomorphism over an Abelian group is common in encryptio...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information and computation Ročník 238; s. 128 - 156
Hlavní autoři: Liu, Zhiqiang, Lynch, Christopher
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.11.2014
Témata:
Abelian group
General unification
Homomorphism
Abelian group
Homomorphism
General unification
ISSN:0890-5401, 1090-2651
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:General E-unification is an important tool in cryptographic protocol analysis, where the equational theory E represents properties of the cryptographic algorithm, and uninterpreted function symbols represent other functions. The property of a homomorphism over an Abelian group is common in encryption algorithms such as RSA. The general E-unification problem in this theory is NP-complete, and existing algorithms are highly nondeterministic. We give a mostly deterministic set of inference rules for solving general E-unification modulo a homomorphism over an Abelian group, and prove that it is sound, complete and terminating. These inference rules have been implemented in Maude, and will be incorporated into the Maude-NRL Protocol Analyzer (Maude-NPA).
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2014.07.008