Cap Unification: Application to Protocol Security modulo Homomorphic Encryption - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Cap Unification: Application to Protocol Security modulo Homomorphic Encryption

Hai Lin
  • Function : Author
  • PersonId : 866283
Christopher Lynch
  • Function : Author
  • PersonId : 866284
Paliath Narendran
  • Function : Author
  • PersonId : 833673

Abstract

We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and the intruder abilities as an equational theory. The problem of active intrusion -- such as whether a secret term can be derived, possibly via interaction with the honest participants of the protocol -- is then formulated as a Cap Unification problem. Cap Unification is an extension of Equational Unification: look for a cap to be placed on a given set of terms, so as to unify it with a given term modulo the equational theory. We give a decision procedure for Cap Unification, when the intruder capabilities are modeled as homomorphic encryption theory. Our procedure can be employed in a simple manner to detect attacks exploiting some properties of block ciphers.
No file

Dates and versions

inria-00448703 , version 1 (19-01-2010)

Identifiers

  • HAL Id : inria-00448703 , version 1

Cite

Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch. Cap Unification: Application to Protocol Security modulo Homomorphic Encryption. 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS 2010, Apr 2010, Beijing, China. ⟨inria-00448703⟩
160 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More