A machine-checked formalization of the generic model and the random oracle model (2004)
Cached
Download Links
- [wslc.math.ist.utl.pt]
- [www.cs.math.ist.utl.pt]
- DBLP
Other Repositories/Bibliography
| Venue: | Automated Reasoning: Second International Joint Conference, IJCAR 2004, number 3097 in LNCS |
| Citations: | 17 - 4 self |
BibTeX
@INPROCEEDINGS{Barthe04amachine-checked,
author = {Gilles Barthe and Jan Cederquist and Sabrina Tarento},
title = {A machine-checked formalization of the generic model and the random oracle model},
booktitle = {Automated Reasoning: Second International Joint Conference, IJCAR 2004, number 3097 in LNCS},
year = {2004},
pages = {385--399},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Most approaches to the formal analyses of cryptographic protocols make the perfect cryptography assumption, i.e. the hypothese that there is no way to obtain knowledge about the plaintext pertaining to a ciphertext without knowing the key. Ideally, one would prefer to rely on a weaker hypothesis on the computational cost of gaining information about the plaintext pertaining to a ciphertext without knowing the key. Such a view is permitted by the Generic Model and the Random Oracle Model which provide non-standard computational models in which one may reason about the computational cost of breaking a cryptographic scheme. Using the proof assistant Coq, we provide a machine-checked account of the Generic Model and the Random Oracle Model. 1
