User Tools

Site Tools


Deciding the Security of Protocols with Commuting Public Key Encryption (BibTeX)

@INPROCEEDINGS{ChevalierKuestersRusinowitchTuruani-ARSPA-2004,
  author = {Y.~Chevalier and R.~K{\"u}sters and M.~Rusinowitch and M.~Turuani},
  title = {{Deciding the Security of Protocols with Commuting Public Key Encryption}},
  booktitle = {IJCAR 2004 Workshop W6 ARSPA Automated Reasoning for Security Protocol Analysis (ARSPA 2004)},
  year = 2004,
  abstract = {Many cryptographic protocols and attacks on these protocols make use of  the fact that the order in which encryption is performed does not  affect the result of the encryption, i.e., encryption is commutative. However, most models for the automatic analysis of cryptographic  protocols can not handle such encryption functions since in these models the message  space is considered a free term algebra. In this paper, we present an NP  decision procedure for the insecurity of protocols that employ RSA  encryption, which is one of the most important instances of commuting   public key encryption.}
}