269 search results - page 1 / 54 » Computational soundness of observational equivalence |
CCS
2008
ACM
13 years 7 months ago
2008
ACM
Many security properties are naturally expressed as indistinguishability between two versions of a protocol. In this paper, we show that computational proofs of indistinguishabili...
CCS
2009
ACM
13 years 11 months ago
2009
ACM
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
ASIAN
2006
Springer
13 years 8 months ago
2006
Springer
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
FOSSACS
2006
Springer
13 years 8 months ago
2006
Springer
The indistinguishability of two pieces of data (or two lists of pieces of data) can be represented formally in terms of a relation called static equivalence. Static equivalence dep...
CAV
2009
Springer
14 years 5 months ago
2009
Springer
We present HOMER, an observational-equivalence model checker for the 3rd-order fragment of Idealized Algol (IA) augmented with iteration. It works by first translating terms of the...