A Composable Computational Soundness Notion
A Composable Computational Soundness Notion. Véronique Cortier and Bogdan Warinschi. In 18th ACM Conference on Computer and Communications Security (CCS'11), pp. 63–74, ACM, Chicago, USA, October 2011.
Download
Abstract
Computational soundness results show that under certain conditions it is possible to conclude
computational security whenever symbolic security holds.
Unfortunately, each soundness result is usually established for some set of cryptographic primitives and extending the result to encompass new primitives typically requires redoing most of the work. In this paper we suggest a way of getting around this problem.
Furthermore, our notion of soundness concerns cryptographic primitives
in a way that is independent of any protocol specification
language. Nonetheless, we show that deduction soundness leads to
computational soundness for languages (or protocols) that satisfy a so
called commutation property.
BibTeX
@InProceedings{CCS2011-Bogdan, doi = {10.1145/2046707.2046717}, author = {V\'eronique Cortier and Bogdan Warinschi}, title = {A Composable Computational Soundness Notion}, booktitle = {18th ACM Conference on Computer and Communications Security (CCS'11)}, year = {2011}, address = {Chicago, USA}, month = {October}, abstract = {Computational soundness results show that under certain conditions it is possible to conclude computational security whenever symbolic security holds. Unfortunately, each soundness result is usually established for some set of cryptographic primitives and extending the result to encompass new primitives typically requires redoing most of the work. In this paper we suggest a way of getting around this problem. \par Furthermore, our notion of soundness concerns cryptographic primitives in a way that is independent of any protocol specification language. Nonetheless, we show that deduction soundness leads to computational soundness for languages (or protocols) that satisfy a so called commutation property.}, pages = {63-74}, publisher = {ACM}, }