Name
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.entcs.2004.05.019 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
extension of dolev-yao model,rsa encryption,message space,np decision procedure,free term algebra,deduction modulo and complexity.,cryptographic protocol,automatic analysis,cryptographic protocols,important instance,deduction modulo and complexity,encryption function,public key encryption,commuting public key encryption,protocol,security | Multiple encryption,Client-side encryption,Computer security,Attribute-based encryption,Cryptographic primitive,Encryption,40-bit encryption,Probabilistic encryption,56-bit encryption,Mathematics | Journal |
Volume | Issue | ISSN |
125 | 1 | Electronic Notes in Theoretical Computer Science |
Citations | PageRank | References |
11 | 0.73 | 10 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yannick Chevalier | 1 | 910 | 44.46 |
| Ralf Küsters | 2 | 1014 | 69.62 |
| Michaël Rusinowitch | 3 | 1377 | 101.15 |
| Mathieu Turuani | 4 | 698 | 31.32 |