3 search results - page 1 / 1 » Flat and one-variable clauses: Complexity of verifying crypt... |
TOCL
2008
13 years 4 months ago
2008
Cryptographic protocols with single blind copying were defined and modeled by Comon and Cortier using the new class C of first order clauses, which extends the Skolem class. They s...
RTA
2009
Springer
13 years 9 months ago
2009
Springer
BIRTHDAY
2006
Springer
13 years 8 months ago
2006
Springer
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...