Verification methods for the computationally complete symbolic attacker based on indistinguishability

DOI10.1145/3343508zbMATH Open1433.68075OpenAlexW2979563688WikidataQ127155729 ScholiaQ127155729MaRDI QIDQ4972166FDOQ4972166

Authors: Gergei Bana, Rohit Chadha, Ajay K. Eeralla, Mitsuhiro Okada 

Publication date: 22 November 2019

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3343508

Recommendations

• scientific article; zbMATH DE number 6678480
• Towards unconditional soundness: computationally complete symbolic attacker
• Computational soundness of indistinguishability properties without computable parsing
• On Communication Models When Verifying Equivalence Properties
• Automatic verification of security protocols in the symbolic model: the verifier ProVerif

zbMATH Keywords

authenticationfirst-order logiccomputational modelsecrecyDolev-Yao modelcomputational soundness

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Cited In (2)

• Towards unconditional soundness: computationally complete symbolic attacker
• Title not available (Why is that?)

Uses Software

• Coq

This page was built for publication: Verification methods for the computationally complete symbolic attacker based on indistinguishability

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