Computational soundness of formal reasoning about indistinguishability and non-malleability of cryptographic expressions
Analysis and verification of security protocols are typically carried out in two different models of cryptography: formal cryptography and computational cryptography. Formal cryptography, originally inspired by the work of Dolev and Yao [14], takes an abstract and idealized view of security, and d...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/3496 |