Download now Free registration required
The authors show that the recent technique of computationally complete symbolic attackers proposed by Bana and Comon-Lundh for computationally sound verification of security protocols is powerful enough to verify actual protocols. In their paper, Bana and Comon-Lundh presented only the general framework, but they did not introduce sufficiently many axioms to actually prove protocols. They present a set of axioms - some generic axioms that are computationally sound for all PPT algorithms, two specific axioms that are sound for CCA2 secure encryptions, and a further minimal parsing assumption for pairing - and illustrate the power of this technique by giving the first computationally sound verification (secrecy and authentication) via symbolic attackers of the NSL Protocol that does not need any further restrictive assumptions about the computational implementation.
- Format: PDF
- Size: 357.17 KB