DMCA
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption) (2000)
Cached
Download Links
- [www.cse.ucsc.edu]
- [pa.bell-labs.com]
- [www.cs.ucdavis.edu]
- [www.cs.ucdavis.edu]
- [www.lsv.ens-cachan.fr]
- [web.cs.ucdavis.edu]
- [web.cs.ucdavis.edu]
- DBLP
Other Repositories/Bibliography
by
Martín Abadi
,
Phillip Rogaway
| Citations: | 378 - 11 self |
BibTeX
@MISC{Abadi00reconcilingtwo,
author = {Martín Abadi and Phillip Rogaway},
title = {Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Two distinct, rigorous views of cryptography have developed over the years, in two mostly separate communities. One of the views relies on a simple but effective formal approach; the other, on a detailed computational model that considers issues of complexity and probability.
