## Soundness of formal encryption in the presence of key-cycles (2005)

### Cached

### Download Links

- [wslc.math.ist.utl.pt]
- [www.cs.math.ist.utl.pt]
- [www.math.upenn.edu]
- [www.math.ist.utl.pt]
- CiteULike
- DBLP

### Other Repositories/Bibliography

Venue: | In Proc. 10th European Symposium on Research in Computer Security (ESORICS’05), volume 3679 of LNCS |

Citations: | 36 - 4 self |

### BibTeX

@INPROCEEDINGS{Adão05soundnessof,

author = {Pedro Adão and Gergei Bana and Jonathan Herzog and Andre Scedrov},

title = {Soundness of formal encryption in the presence of key-cycles},

booktitle = {In Proc. 10th European Symposium on Research in Computer Security (ESORICS’05), volume 3679 of LNCS},

year = {2005},

pages = {374--396},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. Both the formal and the computational models of cryptography contain the notion of message equivalence or indistinguishability. An encryption scheme provides soundness for indistinguishability if, when mapping formal messages into the computational model, equivalent formal messages are mapped to indistinguishable computational distributions. Previous soundness results are limited in that they do not apply when key-cycles are present. We demonstrate that an encryption scheme provides soundness in the presence of key-cycles if it satisfies the recently-introduced notion of key-dependent message (KDM) security. We also show that soundness in the presence of key-cycles (and KDM security) neither implies nor is implied by security against chosen ciphertext attack (CCA-2). Therefore, soundness for key-cycles is possible using a new notion of computational security, not possible using previous such notions, and the relationship between the formal and computational models extends beyond chosen-ciphertext security. 1