Model checking indistinguishability of randomized security protocols

DOI10.1007/978-3-319-96142-2_10MaRDI QIDQ6039398zbMATH OpenFDO

Authors Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

Publication date 5 May 2023

Published in Computer Aided Verification (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-319-96142-2_10

Mathematics Subject Classification ID

Computer security (68M25) Specification and verification (program logics, model checking, etc.) (68Q60) Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 7297874
• Automated verification of equivalence properties of cryptographic protocols
• Deciding knowledge in security protocols under some e-voting theories
• Modular verification of protocol equivalence in the presence of randomness
• SeVe: automatic tool for verification of security protocols

Cited in

(5)

• Modular verification of protocol equivalence in the presence of randomness
• Attacks on the basic cMix design: on the necessity of commitments and randomized partial checking
• scientific article; zbMATH DE number 1583798 (Why is no real title available?)
• scientific article; zbMATH DE number 7297874 (Why is no real title available?)
• Model checking the observational determinism security property using PROMELA and SPIN

This page was built for publication: Model checking indistinguishability of randomized security protocols

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