Sciweavers

3 search results - page 1 / 1
» Flat and One-Variable Clauses for Single Blind Copying Proto...
Sort
View
66
Voted
BIRTHDAY
2006
Springer
15 years 1 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
98
Voted
TOCL
2008
102views more  TOCL 2008»
14 years 9 months ago
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying
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...
Helmut Seidl, Kumar Neeraj Verma