Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

98

CONCUR
2000
Springer

81views Distributed And Parallel Com...» more CONCUR 2000»

On the Reachability Problem in Cryptographic Protocols

15 years 6 months ago

On the Reachability Problem in Cryptographic Protocols

Download reference.kfupm.edu.sa

Roberto M. Amadio, Denis Lugiez

Real-time Traffic

CONCUR 2000 | Distributed And Parallel Computing |

claim paper

Related Content

» Constraint solving for boundedprocess cryptographic protocol analysis

» Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols

» Symbolic reachability analysis using narrowing and its application to verification of cryp...

» Intruder Deductions Constraint Solving and Insecurity Decision in Presence of Exclusive or

» Formal Analysis of TimeDependent Cryptographic Protocols in RealTime Maude

» Modeling of Multiple Agent based Cryptographic Key Recovery Protocol

» Constraint Solving for ContractSigning Protocols

» A rewritingbased inference system for the NRL protocol analyzer grammar generation

» Regular Protocols and Attacks with Regular Knowledge

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	CONCUR
Authors	Roberto M. Amadio, Denis Lugiez

Comments (0)