Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability

DOI10.1145/3343508zbMath1433.68075OpenAlexW2979563688WikidataQ127155729 ScholiaQ127155729MaRDI QIDQ4972166

Ajay K. Eeralla, Gergei Bana, Rohit Chadha, 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

zbMATH Keywords

first-order logiccomputational modelauthenticationsecrecyDolev-Yao modelcomputational soundness

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Uses Software

• Coq

This page was built for publication: Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability