6 search results - page 1 / 2 » Deduction with XOR Constraints in Security API Modelling |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
We introduce XOR constraints, and show how they enable a theorem prover to reason effectively about security critical subsystems which employ bitwise XOR. Our primary case study is...
LICS
2003
IEEE
13 years 10 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
We describe a new algorithm for analysing security protocols that use XOR, such as key-management APIs. As a case study, we consider the IBM 4758 CCA API, which is widely used in t...
AGENTS
1998
Springer
13 years 9 months ago
1998
Springer
The New Millennium Remote Agent NMRA will be the rst AI system to control an actual spacecraft. The spacecraft domain places a strong premium on autonomy and requires dynamic reco...
IFIP
2004
Springer
13 years 10 months ago
2004
Springer
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...