scientific article; zbMATH DE number 7297874

MaRDI QIDQ5144673zbMATH OpenFDO

Authors

Publication date 19 January 2021

Full work available at URL http://dl.acm.org/citation.cfm?id=3330061

Mathematics Subject Classification ID

Computer security (68M25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Modular verification of protocol equivalence in the presence of randomness
• scientific article; zbMATH DE number 7650814
• Model checking indistinguishability of randomized security protocols
• scientific article; zbMATH DE number 1962854
• Model Checking Software
• The practice of cryptographic protocol verification
• Modelchecking safety properties in randomized security protocols

Cited in

(10)

• Verification of cryptographic protocols: tagging enforces termination
• Modular verification of protocol equivalence in the presence of randomness
• Cryptographic Verification by Typing for a Sample Protocol Implementation
• Validating Security Protocols under the General Attacker
• Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
• Probabilistic relational verification for cryptographic implementations
• Random polynomial-time attacks and Dolev-Yao models
• Coalgebraic tools for randomness-conserving protocols
• Coalgebraic tools for randomness-conserving protocols
• Model checking indistinguishability of randomized security protocols

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144673)