Sciweavers

BIRTHDAY
2006
Springer
13 years 8 months ago
Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses
We consider secrecy problems for cryptographic protocols modeled using Horn clauses and present general classes of Horn clauses which can be efficiently decided. Besides simplifyin...
Helmut Seidl, Kumar Neeraj Verma