10 search results - page 1 / 2 » Improving Techniques for Proving Undecidability of Checking ... |
IEEEARES
2008
IEEE
13 years 11 months ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
CSFW
1998
IEEE
13 years 9 months ago
1998
IEEE
Model checkers such as FDR have been extremely e ective in checking for, and nding, attacks on cryptographic protocols { see, for example 11, 12, 14] and many of the papers in 3]....
TCS
2002
13 years 4 months ago
2002
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
IANDC
2008
13 years 5 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...